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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800213
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526793318423

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 CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ 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-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= PaidFor_p11_1)
lola: LP says that atomic proposition is always false: (3 <= PaySchemeData_p11_10)
lola: E (F (E (X ((2 <= PayReceipt_p21_12))))) : (E (F (((p3_5 <= 1) AND (p3_6 + 1 <= Delivery_p22_1)))) OR NOT(((p11_4 <= DeliveryResponse_p12_6) OR A (X ((Status_p21_11 <= p12_4)))))) : NOT(A (((p6_4 <= 2) U ((p12_3 <= HowDeliver_p12_2) AND (HowDeliver_p12_2 <= p11_11))))) : A (F (((3 <= p6_7) AND ((2 <= DeliveryNote_p22_14) OR (p6_4 + 1 <= Organization_p21_8))))) : A ((E (X ((p11_3 <= p12_4))) U ((1 <= p3_3) AND (3 <= ConsumerDelivery_p6_0) AND (p6_5 + 1 <= Delivery_p22_4)))) : E (G (A (((PaymentRequest_p11_9 <= p1_1) U (Organization_p21_4 <= Status_p22_7))))) : E (X (A (G (((2 <= p6_2) OR (p3_10 <= p7_3)))))) : NOT((A (F ((2 <= p7_3))) OR ((1 <= Organization_p22_5)))) : E (G (((2 <= Status_p20) OR A (F ((Status_p20_6 <= p3_10)))))) : (E (F (((p3_2 <= 0) AND (Order_p20_8 + 1 <= DeliveryNote_p22_14)))) OR (((p3_9 <= p6_2) AND (1 <= Order_p22_3)) AND A (F (((1 <= PaymentNote_p21_13) OR (PaySchemeData_p11_10 <= PaySchemeData_p21_6)))))) : (E ((((1 <= p12_3) OR (2 <= PaySchemeData_p21_10)) U (2 <= Organization_p22_5))) AND (((PaidFor_p11_1 <= p3_4) OR (p5_2 <= p4_1)))) : E (((3 <= p5_2) U A (F ((2 <= Organization_p21_4))))) : E (G ((A (F ((1 <= p4_3))) OR (1 <= OfferResponce_p10)))) : A (F ((A (G ((2 <= Order_p22_6))) OR (((OfferRequest_p10 <= PayReceipt_p21_12) AND (2 <= Payment_p20)) OR (3 <= p4_5))))) : E (G (NOT(E (X ((2 <= Delivery_p22_8)))))) : (((1 <= Status_p22_11) AND (3 <= p6_6)) OR (A (F (((2 <= Order_p22_3) OR (2 <= Order_p22_10)))) OR (3 <= PayReceipt_p21_15)))
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((2 <= PayReceipt_p21_12)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (2 <= PayReceipt_p21_12)
lola: processed formula length: 24
lola: 19 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--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 /EXEF
lola: The predicate is reachable from some successor.
lola: 49 markings, 48 edges
lola:
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p3_5 <= 1) AND (p3_6 + 1 <= Delivery_p22_1)))) OR ((DeliveryResponse_p12_6 + 1 <= p11_4) AND E (X ((p12_4 + 1 <= Status_p21_11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DeliveryResponse_p12_6 + 1 <= p11_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (DeliveryResponse_p12_6 + 1 <= p11_4)
lola: processed formula length: 37
lola: 18 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p3_5 <= 1) AND (p3_6 + 1 <= Delivery_p22_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 (((p3_5 <= 1) AND (p3_6 + 1 <= Delivery_p22_1))))
lola: processed formula length: 54
lola: 19 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: ((p3_5 <= 1) AND (p3_6 + 1 <= Delivery_p22_1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p11_3 <= p12_4))) U ((1 <= p3_3) AND (3 <= ConsumerDelivery_p6_0) AND (p6_5 + 1 <= Delivery_p22_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(EX((p11_3 <= p12_4)) U ((1 <= p3_3) AND (3 <= ConsumerDelivery_p6_0) AND (p6_5 + 1 <= Delivery_p22_4)))
lola: processed formula length: 105
lola: 20 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 224 markings, 224 edges
lola:
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-4 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: E (X (A (G (((2 <= p6_2) OR (p3_10 <= p7_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U ((p6_2 <= 1) AND (p7_3 + 1 <= p3_10)))))
lola: processed formula length: 56
lola: 21 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 43 markings, 42 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-6 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 (G (A (X ((Delivery_p22_8 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(AX((Delivery_p22_8 <= 1)))))
lola: processed formula length: 45
lola: 20 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 224 markings, 224 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-14 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 (F (((3 <= p6_7) AND ((2 <= DeliveryNote_p22_14) OR (p6_4 + 1 <= Organization_p21_8)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((p6_7 <= 2) OR ((DeliveryNote_p22_14 <= 1) AND (Organization_p21_8 <= p6_4)))
lola: processed formula length: 79
lola: 20 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 does not eventually occur.
lola: 166 markings, 166 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((1 <= p4_3))) OR (1 <= OfferResponce_p10))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (1 <= p4_3))) AND (OfferResponce_p10 <= 0))))
lola: processed formula length: 72
lola: 22 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: 1061854 markings, 4811706 edges, 212371 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1831297 markings, 8884637 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((3 <= p5_2) U A (F ((2 <= Organization_p21_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((3 <= p5_2) U A(TRUE U (2 <= Organization_p21_4)))
lola: processed formula length: 52
lola: 20 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 224 markings, 225 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= Status_p20) OR A (F ((Status_p20_6 <= p3_10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U ((Status_p20 <= 1) AND NOT(A(TRUE U (Status_p20_6 <= p3_10))))))
lola: processed formula length: 77
lola: 22 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: 1344 markings, 1791 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (((PaymentRequest_p11_9 <= p1_1) U (Organization_p21_4 <= Status_p22_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A((PaymentRequest_p11_9 <= p1_1) U (Organization_p21_4 <= Status_p22_7)))))
lola: processed formula length: 92
lola: 20 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 19445 markings, 78146 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((2 <= Order_p22_6))) OR (((OfferRequest_p10 <= PayReceipt_p21_12) AND (2 <= Payment_p20)) OR (3 <= p4_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U (NOT(E(TRUE U (Order_p22_6 <= 1))) OR (((OfferRequest_p10 <= PayReceipt_p21_12) AND (2 <= Payment_p20)) OR (3 <= p4_5))))
lola: processed formula length: 131
lola: 21 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 658 markings, 1172 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p7_3 <= 1))) AND ((Organization_p22_5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes yes unknown no no no no unknown yes unknown unknown no yes no yes unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 24064 KB
lola: time consumption: 722 seconds
lola: time limit reached - aborting
lola:
preliminary result: yes yes unknown no no no no unknown yes unknown unknown no yes no yes unknown
lola:
preliminary result: yes yes unknown no no no no unknown yes unknown unknown no yes no yes unknown
lola: memory consumption: 24064 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="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-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 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-152658630800213"
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 ;