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 1.7M
-rw-r--r-- 1 mcc users 3.5K 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 3.0K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.5M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Dekker-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936800098
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526626815676

info: Time: 3600 - MCC
===========================================================================================
prep: translating Dekker-PT-050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Dekker-PT-050 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Dekker-PT-050 @ 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: 2850/65536 symbol table entries, 428 collisions
lola: preprocessing...
lola: Size of bit vector: 250
lola: finding significant places
lola: 250 places, 2600 transitions, 100 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5150 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-050-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(withdraw_18_25) OR NOT FIREABLE(withdraw_11_27) OR NOT FIREABLE(withdraw_49_21) OR NOT FIREABLE(withdraw_1_22) OR (FIREABLE(withdraw_10_8) AND NOT FIREABLE(withdraw_31_0))))) : E (F ((FIREABLE(withdraw_24_14) AND FIREABLE(withdraw_47_18) AND ((NOT FIREABLE(enter_44) AND FIREABLE(withdraw_36_19)) OR FIREABLE(withdraw_11_3))))) : E (F ((FIREABLE(try_42) AND FIREABLE(withdraw_2_41) AND (FIREABLE(withdraw_46_17) OR FIREABLE(withdraw_40_29))))) : A (G ((NOT FIREABLE(withdraw_0_36) OR NOT FIREABLE(withdraw_46_20) OR FIREABLE(withdraw_0_49) OR NOT FIREABLE(withdraw_21_14)))) : E (F ((FIREABLE(withdraw_0_23) AND FIREABLE(withdraw_17_34) AND (FIREABLE(withdraw_43_25) OR FIREABLE(withdraw_19_5)) AND (NOT FIREABLE(withdraw_14_12) OR (FIREABLE(withdraw_20_42) AND FIREABLE(withdraw_28_42))) AND (NOT FIREABLE(withdraw_13_11) OR NOT FIREABLE(withdraw_49_20) OR FIREABLE(withdraw_28_12))))) : E (F (((FIREABLE(withdraw_11_35) OR FIREABLE(withdraw_10_35) OR (FIREABLE(withdraw_45_11) AND FIREABLE(withdraw_41_27))) AND (FIREABLE(withdraw_17_21) OR (FIREABLE(withdraw_6_39) AND FIREABLE(withdraw_29_45))) AND FIREABLE(withdraw_12_19)))) : E (F ((FIREABLE(withdraw_40_8) AND FIREABLE(withdraw_40_30) AND (FIREABLE(withdraw_36_28) OR FIREABLE(withdraw_15_37))))) : A (G ((NOT FIREABLE(withdraw_36_33) OR NOT FIREABLE(withdraw_6_0) OR NOT FIREABLE(withdraw_34_7) OR NOT FIREABLE(withdraw_32_2) OR (NOT FIREABLE(withdraw_43_33) AND NOT FIREABLE(withdraw_14_45)) OR (NOT FIREABLE(withdraw_16_30) AND NOT FIREABLE(withdraw_10_31))))) : A (G ((NOT FIREABLE(withdraw_32_30) OR NOT FIREABLE(withdraw_35_10) OR FIREABLE(withdraw_47_33) OR (NOT FIREABLE(withdraw_18_41) AND NOT FIREABLE(withdraw_11_6) AND NOT FIREABLE(withdraw_13_38))))) : E (F ((FIREABLE(withdraw_43_45) AND FIREABLE(withdraw_23_47) AND FIREABLE(withdraw_12_13) AND FIREABLE(withdraw_41_34) AND ((FIREABLE(withdraw_0_43) AND FIREABLE(withdraw_28_4) AND NOT FIREABLE(withdraw_24_5)) OR (FIREABLE(withdraw_24_17) AND FIREABLE(withdraw_14_48) AND (FIREABLE(withdraw_25_21) OR FIREABLE(withdraw_27_42))))))) : A (G ((NOT FIREABLE(withdraw_6_20) OR NOT FIREABLE(withdraw_16_18) OR (FIREABLE(withdraw_0_23) AND FIREABLE(withdraw_47_27)) OR FIREABLE(withdraw_8_46)))) : A (G (((NOT FIREABLE(withdraw_49_30) AND NOT FIREABLE(withdraw_13_11) AND NOT FIREABLE(withdraw_48_21) AND NOT FIREABLE(withdraw_17_12)) OR NOT FIREABLE(withdraw_34_13)))) : E (F ((FIREABLE(withdraw_38_13) AND FIREABLE(withdraw_10_22)))) : E (F ((NOT FIREABLE(withdraw_20_9) AND NOT FIREABLE(withdraw_39_49) AND FIREABLE(withdraw_14_13) AND FIREABLE(withdraw_37_34) AND NOT FIREABLE(withdraw_9_4) AND ((FIREABLE(withdraw_16_26) AND FIREABLE(withdraw_1_38)) OR NOT FIREABLE(withdraw_24_30))))) : E (F ((FIREABLE(withdraw_47_30) AND FIREABLE(withdraw_49_41) AND (FIREABLE(withdraw_45_17) OR FIREABLE(exit_5))))) : E (F ((FIREABLE(withdraw_11_40) AND FIREABLE(withdraw_1_0) AND ((FIREABLE(withdraw_29_16) AND FIREABLE(withdraw_20_38)) OR (NOT FIREABLE(withdraw_43_9) AND NOT FIREABLE(withdraw_19_10))))))
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 (F ((FIREABLE(withdraw_38_13) AND FIREABLE(withdraw_10_22))))
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(withdraw_38_13) AND FIREABLE(withdraw_10_22))))
lola: processed formula length: 63
lola: 1 rewrites
lola: closed formula file Dekker-PT-050-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(withdraw_38_13) AND FIREABLE(withdraw_10_22))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-050-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA Dekker-PT-050-ReachabilityFireability-12 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: A (G ((NOT FIREABLE(withdraw_0_36) OR NOT FIREABLE(withdraw_46_20) OR FIREABLE(withdraw_0_49) OR NOT FIREABLE(withdraw_21_14))))
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(withdraw_0_36) OR NOT FIREABLE(withdraw_46_20) OR FIREABLE(withdraw_0_49) OR NOT FIREABLE(withdraw_21_14))))
lola: processed formula length: 131
lola: 2 rewrites
lola: closed formula file Dekker-PT-050-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: (FIREABLE(withdraw_0_36) AND FIREABLE(withdraw_46_20) AND NOT FIREABLE(withdraw_0_49) AND FIREABLE(withdraw_21_14))
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-050-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: 7 markings, 6 edges
lola: ========================================

FORMULA Dekker-PT-050-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(withdraw_40_8) AND FIREABLE(withdraw_40_30) AND (FIREABLE(withdraw_36_28) OR FIREABLE(withdraw_15_37)))))
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(withdraw_40_8) AND FIREABLE(withdraw_40_30) AND (FIREABLE(withdraw_36_28) OR FIREABLE(withdraw_15_37)))))
lola: processed formula length: 122
lola: 1 rewrites
lola: closed formula file Dekker-PT-050-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(withdraw_40_8) AND FIREABLE(withdraw_40_30) AND (FIREABLE(withdraw_36_28) OR FIREABLE(withdraw_15_37)))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to Dekker-PT-050-ReachabilityFireability-2-0.sara

FORMULA Dekker-PT-050-ReachabilityFireability-6 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(try_42) AND FIREABLE(withdraw_2_41) AND (FIREABLE(withdraw_46_17) OR FIREABLE(withdraw_40_29)))))
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(try_42) AND FIREABLE(withdraw_2_41) AND (FIREABLE(withdraw_46_17) OR FIREABLE(withdraw_40_29)))))
lola: processed formula length: 114
lola: 1 rewrites
lola: closed formula file Dekker-PT-050-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)
sara: try reading problem file Dekker-PT-050-ReachabilityFireability-2-0.sara.
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(try_42) AND FIREABLE(withdraw_2_41) AND (FIREABLE(withdraw_46_17) OR FIREABLE(withdraw_40_29)))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-050-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola:
FORMULA Dekker-PT-050-ReachabilityFireability-2 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: E (F ((FIREABLE(withdraw_47_30) AND FIREABLE(withdraw_49_41) AND (FIREABLE(withdraw_45_17) OR FIREABLE(exit_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 ((FIREABLE(withdraw_47_30) AND FIREABLE(withdraw_49_41) AND (FIREABLE(withdraw_45_17) OR FIREABLE(exit_5)))))
lola: processed formula length: 115
lola: 1 rewrites
lola: closed formula file Dekker-PT-050-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Dekker-PT-050-ReachabilityFireability-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 (G (((NOT FIREABLE(withdraw_49_30) AND NOT FIREABLE(withdraw_13_11) AND NOT FIREABLE(withdraw_48_21) AND NOT FIREABLE(withdraw_17_12)) OR NOT FIREABLE(withdraw_34_13))))
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(withdraw_49_30) AND NOT FIREABLE(withdraw_13_11) AND NOT FIREABLE(withdraw_48_21) AND NOT FIREABLE(withdraw_17_12)) OR NOT FIREABLE(withdraw_34_13))))
lola: processed formula length: 172
lola: 2 rewrites
lola: closed formula file Dekker-PT-050-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: ((FIREABLE(withdraw_49_30) OR FIREABLE(withdraw_13_11) OR FIREABLE(withdraw_48_21) OR FIREABLE(withdraw_17_12)) AND FIREABLE(withdraw_34_13))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA Dekker-PT-050-ReachabilityFireability-11 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 (F ((FIREABLE(withdraw_24_14) AND FIREABLE(withdraw_47_18) AND ((NOT FIREABLE(enter_44) AND FIREABLE(withdraw_36_19)) OR FIREABLE(withdraw_11_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(withdraw_24_14) AND FIREABLE(withdraw_47_18) AND ((NOT FIREABLE(enter_44) AND FIREABLE(withdraw_36_19)) OR FIREABLE(withdraw_11_3)))))
lola: processed formula length: 151
lola: 1 rewrites
lola: closed formula file Dekker-PT-050-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(withdraw_24_14) AND FIREABLE(withdraw_47_18) AND ((NOT FIREABLE(enter_44) AND FIREABLE(withdraw_36_19)) OR FIREABLE(withdraw_11_3)))
lola: state equation: Generated DNF with 509 literals and 51 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-050-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Dekker-PT-050-ReachabilityFireability-1 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: A (G ((NOT FIREABLE(withdraw_6_20) OR NOT FIREABLE(withdraw_16_18) OR (FIREABLE(withdraw_0_23) AND FIREABLE(withdraw_47_27)) OR FIREABLE(withdraw_8_46))))
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(withdraw_6_20) OR NOT FIREABLE(withdraw_16_18) OR (FIREABLE(withdraw_0_23) AND FIREABLE(withdraw_47_27)) OR FIREABLE(withdraw_8_46))))
lola: processed formula length: 157
lola: 2 rewrites
lola: closed formula file Dekker-PT-050-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: (FIREABLE(withdraw_6_20) AND FIREABLE(withdraw_16_18) AND (NOT FIREABLE(withdraw_0_23) OR NOT FIREABLE(withdraw_47_27)) AND NOT FIREABLE(withdraw_8_46))
lola: state equation: Generated DNF with 144 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-050-ReachabilityFireability-7-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: 5 markings, 4 edges
lola: ========================================

FORMULA Dekker-PT-050-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_18_25) OR NOT FIREABLE(withdraw_11_27) OR NOT FIREABLE(withdraw_49_21) OR NOT FIREABLE(withdraw_1_22) OR (FIREABLE(withdraw_10_8) AND NOT FIREABLE(withdraw_31_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 ((NOT FIREABLE(withdraw_18_25) OR NOT FIREABLE(withdraw_11_27) OR NOT FIREABLE(withdraw_49_21) OR NOT FIREABLE(withdraw_1_22) OR (FIREABLE(withdraw_10_8) AND NOT FIREABLE(withdraw_31_0)))))
lola: processed formula length: 198
lola: 2 rewrites
lola: closed formula file Dekker-PT-050-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: (FIREABLE(withdraw_18_25) AND FIREABLE(withdraw_11_27) AND FIREABLE(withdraw_49_21) AND FIREABLE(withdraw_1_22) AND (NOT FIREABLE(withdraw_10_8) OR FIREABLE(withdraw_31_0)))
lola: state equation: Generated DNF with 54 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-050-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges

FORMULA Dekker-PT-050-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_32_30) OR NOT FIREABLE(withdraw_35_10) OR FIREABLE(withdraw_47_33) OR (NOT FIREABLE(withdraw_18_41) AND NOT FIREABLE(withdraw_11_6) AND NOT FIREABLE(withdraw_13_38)))))
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(withdraw_32_30) OR NOT FIREABLE(withdraw_35_10) OR FIREABLE(withdraw_47_33) OR (NOT FIREABLE(withdraw_18_41) AND NOT FIREABLE(withdraw_11_6) AND NOT FIREABLE(withdraw_13_38)))))
lola: processed formula length: 200
lola: 2 rewrites
lola: closed formula file Dekker-PT-050-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: (FIREABLE(withdraw_32_30) AND FIREABLE(withdraw_35_10) AND NOT FIREABLE(withdraw_47_33) AND (FIREABLE(withdraw_18_41) OR FIREABLE(withdraw_11_6) OR FIREABLE(withdraw_13_38)))
lola: state equation: Generated DNF with 90 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Dekker-PT-050-ReachabilityFireability-8 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 (F ((FIREABLE(withdraw_11_40) AND FIREABLE(withdraw_1_0) AND ((FIREABLE(withdraw_29_16) AND FIREABLE(withdraw_20_38)) OR (NOT FIREABLE(withdraw_43_9) AND NOT FIREABLE(withdraw_19_10))))))
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(withdraw_11_40) AND FIREABLE(withdraw_1_0) AND ((FIREABLE(withdraw_29_16) AND FIREABLE(withdraw_20_38)) OR (NOT FIREABLE(withdraw_43_9) AND NOT FIREABLE(withdraw_19_10))))))
lola: processed formula length: 190
lola: 1 rewrites
lola: closed formula file Dekker-PT-050-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(withdraw_11_40) AND FIREABLE(withdraw_1_0) AND ((FIREABLE(withdraw_29_16) AND FIREABLE(withdraw_20_38)) OR (NOT FIREABLE(withdraw_43_9) AND NOT FIREABLE(withdraw_19_10))))
lola: state equation: Generated DNF with 84 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-050-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: 5 markings, 4 edges
lola: ========================================

FORMULA Dekker-PT-050-ReachabilityFireability-15 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: E (F ((NOT FIREABLE(withdraw_20_9) AND NOT FIREABLE(withdraw_39_49) AND FIREABLE(withdraw_14_13) AND FIREABLE(withdraw_37_34) AND NOT FIREABLE(withdraw_9_4) AND ((FIREABLE(withdraw_16_26) AND FIREABLE(withdraw_1_38)) OR NOT FIREABLE(withdraw_24_30)))))
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(withdraw_20_9) AND NOT FIREABLE(withdraw_39_49) AND FIREABLE(withdraw_14_13) AND FIREABLE(withdraw_37_34) AND NOT FIREABLE(withdraw_9_4) AND ((FIREABLE(withdraw_16_26) AND FIREABLE(withdraw_1_38)) OR NOT FIREABLE(withdraw_24_30)))))
lola: processed formula length: 253
lola: 1 rewrites
lola: closed formula file Dekker-PT-050-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(withdraw_20_9) AND NOT FIREABLE(withdraw_39_49) AND FIREABLE(withdraw_14_13) AND FIREABLE(withdraw_37_34) AND NOT FIREABLE(withdraw_9_4) AND ((FIREABLE(withdraw_16_26) AND FIREABLE(withdraw_1_38)) OR NOT FIREABLE(withdraw_24_30)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges

FORMULA Dekker-PT-050-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(withdraw_11_35) OR FIREABLE(withdraw_10_35) OR (FIREABLE(withdraw_45_11) AND FIREABLE(withdraw_41_27))) AND (FIREABLE(withdraw_17_21) OR (FIREABLE(withdraw_6_39) AND FIREABLE(withdraw_29_45))) AND FIREABLE(withdraw_12_19))))
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(withdraw_11_35) OR FIREABLE(withdraw_10_35) OR (FIREABLE(withdraw_45_11) AND FIREABLE(withdraw_41_27))) AND (FIREABLE(withdraw_17_21) OR (FIREABLE(withdraw_6_39) AND FIREABLE(withdraw_29_45))) AND FIREABLE(withdraw_12_19))))
lola: processed formula length: 244
lola: 1 rewrites
lola: closed formula file Dekker-PT-050-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(withdraw_11_35) OR FIREABLE(withdraw_10_35) OR (FIREABLE(withdraw_45_11) AND FIREABLE(withdraw_41_27))) AND (FIREABLE(withdraw_17_21) OR (FIREABLE(withdraw_6_39) AND FIREABLE(withdraw_29_45))) AND FIREABLE(withdraw_12_19))
lola: state equation: Generated DNF with 69 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges

FORMULA Dekker-PT-050-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to Dekker-PT-050-ReachabilityFireability-12-0.sara
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_36_33) OR NOT FIREABLE(withdraw_6_0) OR NOT FIREABLE(withdraw_34_7) OR NOT FIREABLE(withdraw_32_2) OR (NOT FIREABLE(withdraw_43_33) AND NOT FIREABLE(withdraw_14_45)) OR (NOT FIREABLE(withdraw_16_30) AND NOT FIREABLE(withdraw_10_31)))))
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(withdraw_36_33) OR NOT FIREABLE(withdraw_6_0) OR NOT FIREABLE(withdraw_34_7) OR NOT FIREABLE(withdraw_32_2) OR (NOT FIREABLE(withdraw_43_33) AND NOT FIREABLE(withdraw_14_45)) OR (NOT FIREABLE(withdraw_16_30) AND NOT FIREABLE(withdraw_10_31)))))
lola: processed formula length: 269
lola: 2 rewrites
lola: closed formula file Dekker-PT-050-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: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(withdraw_36_33) AND FIREABLE(withdraw_6_0) AND FIREABLE(withdraw_34_7) AND FIREABLE(withdraw_32_2) AND (FIREABLE(withdraw_43_33) OR FIREABLE(withdraw_14_45)) AND (FIREABLE(withdraw_16_30) OR FIREABLE(withdraw_10_31)))
lola: state equation: Generated DNF with 72 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-050-ReachabilityFireability-13-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: 12 markings, 11 edges
lola: ========================================

FORMULA Dekker-PT-050-ReachabilityFireability-7 FALSE 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 ((FIREABLE(withdraw_0_23) AND FIREABLE(withdraw_17_34) AND (FIREABLE(withdraw_43_25) OR FIREABLE(withdraw_19_5)) AND (NOT FIREABLE(withdraw_14_12) OR (FIREABLE(withdraw_20_42) AND FIREABLE(withdraw_28_42))) AND (NOT FIREABLE(withdraw_13_11) OR NOT FIREABLE(withdraw_49_20) OR FIREABLE(withdraw_28_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 ((FIREABLE(withdraw_0_23) AND FIREABLE(withdraw_17_34) AND (FIREABLE(withdraw_43_25) OR FIREABLE(withdraw_19_5)) AND (NOT FIREABLE(withdraw_14_12) OR (FIREABLE(withdraw_20_42) AND FIREABLE(withdraw_28_42))) AND (NOT FIREABLE(withdraw_13_11) OR NOT FIREABLE(withdraw_49_20) OR FIREABLE(withdraw_28_12)))))
lola: processed formula length: 313
lola: 1 rewrites
lola: closed formula file Dekker-PT-050-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(withdraw_0_23) AND FIREABLE(withdraw_17_34) AND (FIREABLE(withdraw_43_25) OR FIREABLE(withdraw_19_5)) AND (NOT FIREABLE(withdraw_14_12) OR (FIREABLE(withdraw_20_42) AND FIREABLE(withdraw_28_42))) AND (NOT FIREABLE(withdraw_13_11) OR NOT FIREABLE(withdraw_49_20) OR FIREABLE(withdraw_28_12)))
lola: state equation: Generated DNF with 644 literals and 52 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-050-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Dekker-PT-050-ReachabilityFireability-4 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 (F ((FIREABLE(withdraw_43_45) AND FIREABLE(withdraw_23_47) AND FIREABLE(withdraw_12_13) AND FIREABLE(withdraw_41_34) AND ((FIREABLE(withdraw_0_43) AND FIREABLE(withdraw_28_4) AND NOT FIREABLE(withdraw_24_5)) OR (FIREABLE(withdraw_24_17) AND FIREABLE(withdraw_14_48) AND (FIREABLE(withdraw_25_21) OR FIREABLE(withdraw_27_42)))))))
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(withdraw_43_45) AND FIREABLE(withdraw_23_47) AND FIREABLE(withdraw_12_13) AND FIREABLE(withdraw_41_34) AND ((FIREABLE(withdraw_0_43) AND FIREABLE(withdraw_28_4) AND NOT FIREABLE(withdraw_24_5)) OR (FIREABLE(withdraw_24_17) AND FIREABLE(withdraw_14_48) AND (FIREABLE(withdraw_25_21) OR FIREABLE(withdraw_27_42)))))))
lola: processed formula length: 333
lola: 1 rewrites
lola: closed formula file Dekker-PT-050-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(withdraw_43_45) AND FIREABLE(withdraw_23_47) AND FIREABLE(withdraw_12_13) AND FIREABLE(withdraw_41_34) AND ((FIREABLE(withdraw_0_43) AND FIREABLE(withdraw_28_4) AND NOT FIREABLE(withdraw_24_5)) OR (FIREABLE(withdraw_24_17) AND FIREABLE(withdraw_14_48) AND (FIREABLE(withdraw_25_21) OR FIREABLE(withdraw_27_42)))))
lola: state equation: Generated DNF with 99 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-050-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA Dekker-PT-050-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes yes no no yes no no yes yes yes yes
lola:
preliminary result: no yes yes no yes yes yes no no yes no no yes yes yes yes
lola: memory consumption: 21552 KB
lola: time consumption: 1 seconds
sara: place or transition ordering is non-deterministic


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="Dekker-PT-050"
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/Dekker-PT-050.tgz
mv Dekker-PT-050 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 Dekker-PT-050, 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 r076-blw3-152649936800098"
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 ;