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 244K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 4.0K 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-C01M01P01D01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800199
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526789510888

info: Time: 3600 - MCC
===========================================================================================
prep: translating IOTPpurchase-PT-C01M01P01D01 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating IOTPpurchase-PT-C01M01P01D01 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ IOTPpurchase-PT-C01M01P01D01 @ 3569 seconds
lola: LoLA will run for 3569 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-C01M01P01D01-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= Payment_p20_9)
lola: LP says that atomic proposition is always false: (3 <= p3_9)
lola: place invariant simplifies atomic proposition
lola: before: (Status_p21_14 <= PaymentNote_p21_16)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= Organization_p20_2)
lola: LP says that atomic proposition is always false: (3 <= Organization_p20_7)
lola: LP says that atomic proposition is always false: (2 <= Status_p21_11)
lola: LP says that atomic proposition is always true: (p3_8 <= p12_7)
lola: LP says that atomic proposition is always false: (2 <= p6_6)
lola: LP says that atomic proposition is always false: (3 <= p5_2)
lola: LP says that atomic proposition is always false: (3 <= p3_10)
lola: LP says that atomic proposition is always false: (2 <= Status_p21_14)
lola: LP says that atomic proposition is always false: (2 <= ConsumerOffer_p1)
lola: LP says that atomic proposition is always false: (2 <= Status_p22_13)
lola: LP says that atomic proposition is always false: (3 <= p3_7)
lola: LP says that atomic proposition is always false: (3 <= PaySchemeData_p11_10)
lola: LP says that atomic proposition is always false: (2 <= p3_5)
lola: LP says that atomic proposition is always false: (3 <= ConsumerPayment_p3)
lola: LP says that atomic proposition is always false: (2 <= DeliveryNote_p22_12)
lola: LP says that atomic proposition is always false: (3 <= p11_4)
lola: NOT((A (X (())) AND A (F ((p6_5 <= PaymentNote_p21_13))))) : (E (X (E (X ((p6_4 <= Status_p22_11))))) OR (((((p6_2 <= Order_p20) AND (p3_7 <= DeliveryNote_p22_12)) OR (p1_2 <= ConsumerPayment_p3)) AND A (F (FALSE))) AND E (X (((p3_6 <= Status_p22_13)))))) : ((((1 <= DeliveryResponse_p12_6)) OR A (X (((Payment_p20 <= p8_2) AND (Status_p21_14 <= Delivery_p22_1))))) OR (E (F (TRUE)) OR NOT(A (G (FALSE))))) : (A (G (TRUE)) AND (DeliveryNote_p22_12 <= PaymentResponse_p11_12)) : A (G ((((p3_3 <= PayReceipt_p21_12)) AND A (X ((1 <= p3_10)))))) : (Status_p22_13 <= Payment_p21_3) : A (G ((E (X ((p1_3 <= PaidFor_p11_1))) OR A (F ((1 <= PaymentResponse_p11_12)))))) : NOT(A (((Status_p20 + 1 <= p4_2) U ()))) : NOT((A (G (((Delivery_p22_1 <= ConsumerOffer_p1) OR (1 <= p11_3)))) AND A (G ((PayReceipt_p21_12 <= PaidFor_p11_1))))) : (1 <= p1_1) : (A (X ((Status_p22_11 <= p3_7))) OR (A (G (FALSE)) OR ())) : FALSE : E ((A (G ((Status_p22_11 <= ConsumerOffer_p1))) U FALSE)) : (p6_7 <= p6_6) : E ((((Status_p21_5 + 1 <= Organization_p22_5) AND (Delivery_p22_4 <= p6_2)) U E (F (FALSE)))) : (E (G ((p6_5 <= p1_2))) OR (A ((FALSE U FALSE)) OR ((p6_7 <= p4_5) AND E (F ((PaidFor_p11_1 <= BrandSelection_p11_5))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 61 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-2 TRUE 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: (DeliveryNote_p22_12 <= PaymentResponse_p11_12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (DeliveryNote_p22_12 <= PaymentResponse_p11_12)
lola: processed formula length: 47
lola: 61 rewrites
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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-3 TRUE 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: (Status_p22_13 <= Payment_p21_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Status_p22_13 <= Payment_p21_3)
lola: processed formula length: 32
lola: 61 rewrites
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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-5 TRUE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 61 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-7 TRUE 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: (1 <= p1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p1_1)
lola: processed formula length: 11
lola: 61 rewrites
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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-9 FALSE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 61 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-10 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 61 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.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-C01M01P01D01-CTLCardinality-11 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: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 61 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.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

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p6_7 <= p6_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6_7 <= p6_6)
lola: processed formula length: 14
lola: 61 rewrites
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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-13 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 61 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.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-C01M01P01D01-CTLCardinality-14 FALSE 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: E (X (E (X ((p6_4 <= Status_p22_11)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(EX((p6_4 <= Status_p22_11)))
lola: processed formula length: 31
lola: 63 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-1 TRUE 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 ((E (X ((p1_3 <= PaidFor_p11_1))) OR A (F ((1 <= PaymentResponse_p11_12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(E(TRUE U (NOT(EX((p1_3 <= PaidFor_p11_1))) AND NOT(A(TRUE U (1 <= PaymentResponse_p11_12))))))
lola: processed formula length: 98
lola: 65 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 204 markings, 459 edges
lola:
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-6 TRUE 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 (((p3_3 <= PayReceipt_p21_12)))) AND A (X (A (G ((1 <= p3_10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p3_3 <= PayReceipt_p21_12))))
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 (((p3_3 <= PayReceipt_p21_12))))
lola: processed formula length: 37
lola: 63 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.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: ((PayReceipt_p21_12 + 1 <= p3_3))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-CTLCardinality-12-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: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-4 FALSE 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: (NOT DEADLOCK OR E (G ((PaymentNote_p21_13 + 1 <= p6_5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 61 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-0 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: (E (F (((ConsumerOffer_p1 + 1 <= Delivery_p22_1) AND (p11_3 <= 0)))) OR E (F ((PaidFor_p11_1 + 1 <= PayReceipt_p21_12))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((PaidFor_p11_1 + 1 <= PayReceipt_p21_12)))
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 ((PaidFor_p11_1 + 1 <= PayReceipt_p21_12)))
lola: processed formula length: 48
lola: 62 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.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: (PaidFor_p11_1 + 1 <= PayReceipt_p21_12)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-8 TRUE 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: (E (G ((p6_5 <= p1_2))) OR ((p6_7 <= p4_5) AND E (F ((PaidFor_p11_1 <= BrandSelection_p11_5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p6_7 <= p4_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6_7 <= p4_5)
lola: processed formula length: 14
lola: 61 rewrites
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: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p6_5 <= p1_2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p6_5 <= p1_2)))
lola: processed formula length: 22
lola: 61 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 38 markings, 37 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G ((p6_5 <= p1_2))) OR ((p6_7 <= p4_5) AND E (F ((PaidFor_p11_1 <= BrandSelection_p11_5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p6_7 <= p4_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6_7 <= p4_5)
lola: processed formula length: 14
lola: 61 rewrites
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: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((PaidFor_p11_1 <= BrandSelection_p11_5)))
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 ((PaidFor_p11_1 <= BrandSelection_p11_5)))
lola: processed formula length: 47
lola: 62 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes yes yes yes no yes no no yes no yes
lola:
preliminary result: yes yes yes yes no yes yes yes yes no yes no no yes no yes
lola: memory consumption: 24180 KB
lola: time consumption: 0 seconds

BK_STOP 1526789511432

--------------------
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-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/IOTPpurchase-PT-C01M01P01D01.tgz
mv IOTPpurchase-PT-C01M01P01D01 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-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 r100-smll-152658630800199"
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 ;