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

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

=== Now, execution of the tool begins

BK_START 1526792380187

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 ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ IOTPpurchase-PT-C01M01P01D01 @ 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-C01M01P01D01-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(PutOfferRequest_t1) OR (FIREABLE(PutWhatDeliver_t6_1) AND FIREABLE(CheckDeliveryRequest_t8_1)) OR (NOT FIREABLE(CheckPaymentRequest_t5_1) AND NOT FIREABLE(CheckWhatDeliver_t7_1)) OR (FIREABLE(GetBrandList_t3_2) AND FIREABLE(CheckDeliveryNote_t6_6) AND NOT FIREABLE(PutBrandList_t4_2) AND ((FIREABLE(SelectBrand_t3_3) AND FIREABLE(PaymentResponse_t5_3)) OR NOT FIREABLE(MakeChoice_t1)))))) : E (F ((FIREABLE(CheckRequest_t2) AND (((FIREABLE(PutPaymentRequest_t3_7) OR FIREABLE(GetPaymentAmount_t3_5)) AND (FIREABLE(GetPaymentRequest_t5_0) OR FIREABLE(PutPaidFor_t3_1))) OR (NOT FIREABLE(GetDeliveryResponse_t6_5) AND NOT FIREABLE(PaymentResponse_t5_3)))))) : A (G (FIREABLE(CheckDeliveryNote_t6_6))) : A (G (FIREABLE(PutBrandList_t4_2))) : E (F ((NOT FIREABLE(CheckOffer_t3) OR (FIREABLE(PutWhatDeliver_t6_1) AND NOT FIREABLE(MakeChoice_t1))))) : A (G ((FIREABLE(t6_7) AND NOT FIREABLE(CheckPaymentRequest_t5_1)))) : A (G ((FIREABLE(WhatDeliverDecision_t6_0) AND FIREABLE(CheckDeliveryRequest_t8_1) AND FIREABLE(MakeChoice_t1)))) : E (F ((FIREABLE(CheckPaymentReseitp_t3_10) AND (NOT FIREABLE(PutOfferRequest_t1) OR NOT FIREABLE(PutBrandList_t4_2) OR (FIREABLE(CheckOffer_t3) AND (FIREABLE(CheckPaymentRequest_t5_1) OR FIREABLE(PutDeliveryResponse_t8_2))))))) : E (F (((NOT FIREABLE(SelectBrand_t3_3) OR NOT FIREABLE(GetOfferRequest_t2) OR (NOT FIREABLE(CheckBrandSelection_t4_4) AND NOT FIREABLE(GetOfferResponse_t1))) AND FIREABLE(PutPaymentRequest_t3_7)))) : A (G ((NOT FIREABLE(PutBrandSelection_t3_4) OR FIREABLE(GetHowDeliver_t6_2) OR FIREABLE(CheckRequest_t2)))) : E (F (FIREABLE(PaymentResponse_t3_9))) : A (G (((FIREABLE(t8_4) AND FIREABLE(GetPaymentRequest_t5_0) AND FIREABLE(PutBrandList_t4_2) AND (FIREABLE(CheckPaymentRequest_t5_1) OR FIREABLE(PaymentExchange_t5_2) OR NOT FIREABLE(GetDeliveryRequest_t8_0))) OR ((NOT FIREABLE(CheckWhatDeliver_t7_1) OR NOT FIREABLE(GetPaymentAmount_t3_5)) AND ((FIREABLE(CheckWhatDeliver_t7_1) AND FIREABLE(PutPaymentAmount_t4_5)) OR NOT FIREABLE(t7_4)))))) : E (F (((FIREABLE(t8_4) OR FIREABLE(GetPaymentAmount_t3_5)) AND FIREABLE(GetWhatDeliver_t7_0)))) : A (G (FIREABLE(WhatDeliverDecision_t6_0))) : E (F ((NOT FIREABLE(CheckPaymentRequest_t5_1) OR NOT FIREABLE(TradeDecision_t3_0)))) : A (G (((FIREABLE(PaymentExchange_t3_8) AND FIREABLE(PutPaidFor_t3_1) AND FIREABLE(BrandDecision_t4_1) AND FIREABLE(CheckPaymentAmount_t3_6)) OR (FIREABLE(PutDeliveryRequest_t6_4) AND FIREABLE(CheckDeliveryInfo_t6_3) AND NOT FIREABLE(GetBrandSelection_t4_3) AND (NOT FIREABLE(CheckPaymentReseitp_t3_10) OR NOT FIREABLE(PaymentExchange_t3_8))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(CheckDeliveryNote_t6_6)))
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 (FIREABLE(CheckDeliveryNote_t6_6)))
lola: processed formula length: 40
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: NOT FIREABLE(CheckDeliveryNote_t6_6)
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-2 FALSE 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: A (G (FIREABLE(PutBrandList_t4_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 (FIREABLE(PutBrandList_t4_2)))
lola: processed formula length: 35
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: NOT FIREABLE(PutBrandList_t4_2)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-3 FALSE 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: E (F (FIREABLE(PaymentResponse_t3_9)))
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 (FIREABLE(PaymentResponse_t3_9)))
lola: processed formula length: 38
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: FIREABLE(PaymentResponse_t3_9)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-10 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: A (G (FIREABLE(WhatDeliverDecision_t6_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 (FIREABLE(WhatDeliverDecision_t6_0)))
lola: processed formula length: 42
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: NOT FIREABLE(WhatDeliverDecision_t6_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola:
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: calling and running sara
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t6_7) AND NOT FIREABLE(CheckPaymentRequest_t5_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 ((FIREABLE(t6_7) AND NOT FIREABLE(CheckPaymentRequest_t5_1))))
lola: processed formula length: 67
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-5 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: E (F ((NOT FIREABLE(CheckPaymentRequest_t5_1) OR NOT FIREABLE(TradeDecision_t3_0))))
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 ((NOT FIREABLE(CheckPaymentRequest_t5_1) OR NOT FIREABLE(TradeDecision_t3_0))))
lola: processed formula length: 85
lola: 1 rewrites
lola: sara: try reading problem file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-3-0.sara.
closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: (NOT FIREABLE(CheckPaymentRequest_t5_1) OR NOT FIREABLE(TradeDecision_t3_0))
lola: state equation: Generated DNF with 5 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-5-0.sara

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(CheckOffer_t3) OR (FIREABLE(PutWhatDeliver_t6_1) AND NOT FIREABLE(MakeChoice_t1)))))
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 ((NOT FIREABLE(CheckOffer_t3) OR (FIREABLE(PutWhatDeliver_t6_1) AND NOT FIREABLE(MakeChoice_t1)))))
lola: processed formula length: 105
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: (NOT FIREABLE(CheckOffer_t3) OR (FIREABLE(PutWhatDeliver_t6_1) AND NOT FIREABLE(MakeChoice_t1)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-4 TRUE 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: E (F (((FIREABLE(t8_4) OR FIREABLE(GetPaymentAmount_t3_5)) AND FIREABLE(GetWhatDeliver_t7_0))))
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 (((FIREABLE(t8_4) OR FIREABLE(GetPaymentAmount_t3_5)) AND FIREABLE(GetWhatDeliver_t7_0))))
lola: processed formula length: 96
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: ((FIREABLE(t8_4) OR FIREABLE(GetPaymentAmount_t3_5)) AND FIREABLE(GetWhatDeliver_t7_0))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 75 markings, 74 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
try reading problem file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-5-0.sara.
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(WhatDeliverDecision_t6_0) AND FIREABLE(CheckDeliveryRequest_t8_1) AND FIREABLE(MakeChoice_t1))))
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 ((FIREABLE(WhatDeliverDecision_t6_0) AND FIREABLE(CheckDeliveryRequest_t8_1) AND FIREABLE(MakeChoice_t1))))
lola: processed formula length: 112
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(WhatDeliverDecision_t6_0) OR NOT FIREABLE(CheckDeliveryRequest_t8_1) OR NOT FIREABLE(MakeChoice_t1))
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(PutBrandSelection_t3_4) OR FIREABLE(GetHowDeliver_t6_2) OR FIREABLE(CheckRequest_t2))))
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 ((NOT FIREABLE(PutBrandSelection_t3_4) OR FIREABLE(GetHowDeliver_t6_2) OR FIREABLE(CheckRequest_t2))))
lola: processed formula length: 109
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(PutBrandSelection_t3_4) AND NOT FIREABLE(GetHowDeliver_t6_2) AND NOT FIREABLE(CheckRequest_t2))
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(SelectBrand_t3_3) OR NOT FIREABLE(GetOfferRequest_t2) OR (NOT FIREABLE(CheckBrandSelection_t4_4) AND NOT FIREABLE(GetOfferResponse_t1))) AND FIREABLE(PutPaymentRequest_t3_7))))
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 (((NOT FIREABLE(SelectBrand_t3_3) OR NOT FIREABLE(GetOfferRequest_t2) OR (NOT FIREABLE(CheckBrandSelection_t4_4) AND NOT FIREABLE(GetOfferResponse_t1))) AND FIREABLE(PutPaymentRequest_t3_7))))
lola: processed formula length: 199
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: ((NOT FIREABLE(SelectBrand_t3_3) OR NOT FIREABLE(GetOfferRequest_t2) OR (NOT FIREABLE(CheckBrandSelection_t4_4) AND NOT FIREABLE(GetOfferResponse_t1))) AND FIREABLE(PutPaymentRequest_t3_7))
lola: state equation: Generated DNF with 37 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-10-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: 21 markings, 20 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(CheckPaymentReseitp_t3_10) AND (NOT FIREABLE(PutOfferRequest_t1) OR NOT FIREABLE(PutBrandList_t4_2) OR (FIREABLE(CheckOffer_t3) AND (FIREABLE(CheckPaymentRequest_t5_1) OR FIREABLE(PutDeliveryResponse_t8_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 ((FIREABLE(CheckPaymentReseitp_t3_10) AND (NOT FIREABLE(PutOfferRequest_t1) OR NOT FIREABLE(PutBrandList_t4_2) OR (FIREABLE(CheckOffer_t3) AND (FIREABLE(CheckPaymentRequest_t5_1) OR FIREABLE(PutDeliveryResponse_t8_2)))))))
lola: processed formula length: 230
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: (FIREABLE(CheckPaymentReseitp_t3_10) AND (NOT FIREABLE(PutOfferRequest_t1) OR NOT FIREABLE(PutBrandList_t4_2) OR (FIREABLE(CheckOffer_t3) AND (FIREABLE(CheckPaymentRequest_t5_1) OR FIREABLE(PutDeliveryResponse_t8_2)))))
lola: state equation: Generated DNF with 48 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-7 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: E (F ((FIREABLE(CheckRequest_t2) AND (((FIREABLE(PutPaymentRequest_t3_7) OR FIREABLE(GetPaymentAmount_t3_5)) AND (FIREABLE(GetPaymentRequest_t5_0) OR FIREABLE(PutPaidFor_t3_1))) OR (NOT FIREABLE(GetDeliveryResponse_t6_5) AND NOT FIREABLE(PaymentResponse_t5_3))))))
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 ((FIREABLE(CheckRequest_t2) AND (((FIREABLE(PutPaymentRequest_t3_7) OR FIREABLE(GetPaymentAmount_t3_5)) AND (FIREABLE(GetPaymentRequest_t5_0) OR FIREABLE(PutPaidFor_t3_1))) OR (NOT FIREABLE(GetDeliveryResponse_t6_5) AND NOT FIREABLE(PaymentResponse_t5_3))))))
lola: processed formula length: 267
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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)
sara: try reading problem file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-11-0.sara.
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(CheckRequest_t2) AND (((FIREABLE(PutPaymentRequest_t3_7) OR FIREABLE(GetPaymentAmount_t3_5)) AND (FIREABLE(GetPaymentRequest_t5_0) OR FIREABLE(PutPaidFor_t3_1))) OR (NOT FIREABLE(GetDeliveryResponse_t6_5) AND NOT FIREABLE(PaymentResponse_t5_3))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: Generated DNF with 58 literals and 14 conjunctive subformulas
lola: ========================================
sara: place or transition ordering is non-deterministic

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(PaymentExchange_t3_8) AND FIREABLE(PutPaidFor_t3_1) AND FIREABLE(BrandDecision_t4_1) AND FIREABLE(CheckPaymentAmount_t3_6)) OR (FIREABLE(PutDeliveryRequest_t6_4) AND FIREABLE(CheckDeliveryInfo_t6_3) AND NOT FIREABLE(GetBrandSelection_t4_3) AND (NOT FIREABLE(CheckPaymentReseitp_t3_10) OR NOT FIREABLE(PaymentExchange_t3_8))))))
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 (((FIREABLE(PaymentExchange_t3_8) AND FIREABLE(PutPaidFor_t3_1) AND FIREABLE(BrandDecision_t4_1) AND FIREABLE(CheckPaymentAmount_t3_6)) OR (FIREABLE(PutDeliveryRequest_t6_4) AND FIREABLE(CheckDeliveryInfo_t6_3) AND NOT FIREABLE(GetBrandSelection_t4_3) AND (NOT FIREABLE(CheckPaymentReseitp_t3_10) OR NOT FIREABLE(PaymentExchange_t3_8))))))
lola: processed formula length: 346
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: ((NOT FIREABLE(PaymentExchange_t3_8) OR NOT FIREABLE(PutPaidFor_t3_1) OR NOT FIREABLE(BrandDecision_t4_1) OR NOT FIREABLE(CheckPaymentAmount_t3_6)) AND (NOT FIREABLE(PutDeliveryRequest_t6_4) OR NOT FIREABLE(CheckDeliveryInfo_t6_3) OR FIREABLE(GetBrandSelection_t4_3) OR (FIREABLE(CheckPaymentReseitp_t3_10) AND FIREABLE(PaymentExchange_t3_8))))
lola: state equation: Generated DNF with 130 literals and 52 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t8_4) AND FIREABLE(GetPaymentRequest_t5_0) AND FIREABLE(PutBrandList_t4_2) AND (FIREABLE(CheckPaymentRequest_t5_1) OR FIREABLE(PaymentExchange_t5_2) OR NOT FIREABLE(GetDeliveryRequest_t8_0))) OR ((NOT FIREABLE(CheckWhatDeliver_t7_1) OR NOT FIREABLE(GetPaymentAmount_t3_5)) AND ((FIREABLE(CheckWhatDeliver_t7_1) AND FIREABLE(PutPaymentAmount_t4_5)) OR NOT FIREABLE(t7_4))))))
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 (((FIREABLE(t8_4) AND FIREABLE(GetPaymentRequest_t5_0) AND FIREABLE(PutBrandList_t4_2) AND (FIREABLE(CheckPaymentRequest_t5_1) OR FIREABLE(PaymentExchange_t5_2) OR NOT FIREABLE(GetDeliveryRequest_t8_0))) OR ((NOT FIREABLE(CheckWhatDeliver_t7_1) OR NOT FIREABLE(GetPaymentAmount_t3_5)) AND ((FIREABLE(CheckWhatDeliver_t7_1) AND FIREABLE(PutPaymentAmount_t4_5)) OR NOT FIREABLE(t7_4))))))
lola: processed formula length: 396
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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
sara: place or transition ordering is non-deterministic
lola: formula 0: ((NOT FIREABLE(t8_4) OR NOT FIREABLE(GetPaymentRequest_t5_0) OR NOT FIREABLE(PutBrandList_t4_2) OR (NOT FIREABLE(CheckPaymentRequest_t5_1) AND NOT FIREABLE(PaymentExchange_t5_2) AND FIREABLE(GetDeliveryRequest_t8_0))) AND ((FIREABLE(CheckWhatDeliver_t7_1) AND FIREABLE(GetPaymentAmount_t3_5)) OR ((NOT FIREABLE(CheckWhatDeliver_t7_1) OR NOT FIREABLE(PutPaymentAmount_t4_5)) AND FIREABLE(t7_4))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34 markings, 33 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(PutOfferRequest_t1) OR (FIREABLE(PutWhatDeliver_t6_1) AND FIREABLE(CheckDeliveryRequest_t8_1)) OR (NOT FIREABLE(CheckPaymentRequest_t5_1) AND NOT FIREABLE(CheckWhatDeliver_t7_1)) OR (FIREABLE(GetBrandList_t3_2) AND FIREABLE(CheckDeliveryNote_t6_6) AND NOT FIREABLE(PutBrandList_t4_2) AND ((FIREABLE(SelectBrand_t3_3) AND FIREABLE(PaymentResponse_t5_3)) OR NOT FIREABLE(MakeCho... (shortened)
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 ((NOT FIREABLE(PutOfferRequest_t1) OR (FIREABLE(PutWhatDeliver_t6_1) AND FIREABLE(CheckDeliveryRequest_t8_1)) OR (NOT FIREABLE(CheckPaymentRequest_t5_1) AND NOT FIREABLE(CheckWhatDeliver_t7_1)) OR (FIREABLE(GetBrandList_t3_2) AND FIREABLE(CheckDeliveryNote_t6_6) AND NOT FIREABLE(PutBrandList_t4_2) AND ((FIREABLE(SelectBrand_t3_3) AND FIREABLE(PaymentResponse_t5_3)) OR NOT FIREABLE(MakeCho... (shortened)
lola: processed formula length: 412
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability.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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(PutOfferRequest_t1) OR (FIREABLE(PutWhatDeliver_t6_1) AND FIREABLE(CheckDeliveryRequest_t8_1)) OR (NOT FIREABLE(CheckPaymentRequest_t5_1) AND NOT FIREABLE(CheckWhatDeliver_t7_1)) OR (FIREABLE(GetBrandList_t3_2) AND FIREABLE(CheckDeliveryNote_t6_6) AND NOT FIREABLE(PutBrandList_t4_2) AND ((FIREABLE(SelectBrand_t3_3) AND FIREABLE(PaymentResponse_t5_3)) OR NOT FIREABLE(MakeChoice_t1))))
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 55 literals and 11 conjunctive subformulas
lola: 0 markings, 0 edges

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no yes no no yes yes no yes no yes no yes no
lola:
preliminary result: yes yes no no yes no no yes yes no yes no yes no yes no
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityFireability-15-0.sara
lola: ========================================

lola: memory consumption: 14828 KB
lola: time consumption: 0 seconds


BK_STOP 1526792380504

--------------------
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="ReachabilityFireability"
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 ReachabilityFireability"
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-152658630800203"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;