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 304K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K 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 4.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K 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 139K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Dekker-PT-015, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936800084
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526623114775

info: Time: 3600 - MCC
===========================================================================================
prep: translating Dekker-PT-015 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-015 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Dekker-PT-015 @ 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: 330/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 75
lola: finding significant places
lola: 75 places, 255 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 495 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-015-ReachabilityFireability.task
lola: E (F ((FIREABLE(withdraw_10_5) AND (FIREABLE(withdraw_12_8) OR FIREABLE(exit_13)) AND FIREABLE(withdraw_3_11)))) : A (G ((NOT FIREABLE(withdraw_2_14) OR NOT FIREABLE(withdraw_10_7) OR NOT FIREABLE(withdraw_0_10) OR NOT FIREABLE(withdraw_5_1) OR FIREABLE(withdraw_1_7)))) : A (G (((NOT FIREABLE(withdraw_14_11) OR NOT FIREABLE(withdraw_7_0) OR FIREABLE(try_6)) AND (NOT FIREABLE(withdraw_0_12) OR NOT FIREABLE(withdraw_6_11) OR (NOT FIREABLE(withdraw_14_13) AND NOT FIREABLE(withdraw_12_13)))))) : E (F ((FIREABLE(withdraw_13_4) AND FIREABLE(withdraw_9_7) AND (FIREABLE(withdraw_13_11) OR FIREABLE(withdraw_9_14)) AND ((FIREABLE(exit_7) AND FIREABLE(exit_1)) OR FIREABLE(withdraw_7_6)) AND ((NOT FIREABLE(exit_9) AND NOT FIREABLE(withdraw_3_14)) OR NOT FIREABLE(withdraw_14_8))))) : E (F ((FIREABLE(withdraw_11_1) AND FIREABLE(withdraw_4_2) AND FIREABLE(withdraw_10_2) AND NOT FIREABLE(enter_10) AND FIREABLE(withdraw_7_6)))) : E (F (((FIREABLE(withdraw_9_11) OR FIREABLE(withdraw_11_8)) AND NOT FIREABLE(withdraw_0_8) AND (FIREABLE(withdraw_8_7) OR FIREABLE(withdraw_6_1) OR (FIREABLE(withdraw_10_4) AND FIREABLE(withdraw_4_2))) AND FIREABLE(withdraw_9_12)))) : E (F ((FIREABLE(withdraw_10_2) AND FIREABLE(withdraw_9_13) AND FIREABLE(withdraw_8_13) AND FIREABLE(enter_8)))) : E (F (((NOT FIREABLE(withdraw_1_8) AND NOT FIREABLE(withdraw_12_1) AND ((FIREABLE(withdraw_9_14) AND FIREABLE(withdraw_11_2)) OR (FIREABLE(withdraw_6_1) AND FIREABLE(withdraw_2_14)))) OR (FIREABLE(exit_8) AND FIREABLE(withdraw_8_14))))) : A (G ((NOT FIREABLE(withdraw_5_9) OR (NOT FIREABLE(withdraw_5_13) AND NOT FIREABLE(withdraw_10_11)) OR ((NOT FIREABLE(withdraw_0_10) OR NOT FIREABLE(withdraw_4_8)) AND NOT FIREABLE(withdraw_14_4))))) : E (F ((FIREABLE(withdraw_1_12) AND FIREABLE(withdraw_2_8) AND FIREABLE(withdraw_11_5) AND ((FIREABLE(withdraw_6_12) AND FIREABLE(enter_0) AND FIREABLE(withdraw_11_12)) OR (FIREABLE(withdraw_14_13) AND FIREABLE(withdraw_13_6) AND FIREABLE(withdraw_10_6) AND FIREABLE(withdraw_0_1)))))) : A (G ((NOT FIREABLE(withdraw_2_9) OR NOT FIREABLE(enter_10) OR FIREABLE(withdraw_0_11) OR (FIREABLE(exit_2) AND (NOT FIREABLE(withdraw_11_7) OR NOT FIREABLE(enter_6)))))) : E (F ((FIREABLE(withdraw_5_10) AND FIREABLE(withdraw_13_4) AND (FIREABLE(withdraw_11_8) OR FIREABLE(withdraw_9_2)) AND (NOT FIREABLE(exit_9) OR NOT FIREABLE(withdraw_7_5)) AND FIREABLE(withdraw_2_1)))) : A (G ((NOT FIREABLE(withdraw_9_14) OR NOT FIREABLE(withdraw_10_4) OR NOT FIREABLE(withdraw_2_9) OR NOT FIREABLE(withdraw_2_14) OR (((FIREABLE(withdraw_8_1) AND FIREABLE(withdraw_8_0)) OR (FIREABLE(withdraw_14_11) AND FIREABLE(withdraw_9_0))) AND (FIREABLE(withdraw_11_3) OR FIREABLE(withdraw_9_7) OR FIREABLE(withdraw_9_14) OR FIREABLE(exit_2)))))) : E (F ((NOT FIREABLE(withdraw_6_7) AND (FIREABLE(withdraw_10_0) OR FIREABLE(withdraw_0_8)) AND FIREABLE(withdraw_5_4) AND FIREABLE(exit_8)))) : E (F ((FIREABLE(withdraw_12_2) AND (FIREABLE(withdraw_2_5) OR FIREABLE(withdraw_4_5) OR (FIREABLE(withdraw_14_11) AND FIREABLE(exit_14))) AND FIREABLE(withdraw_12_9) AND FIREABLE(withdraw_14_7) AND (FIREABLE(withdraw_2_1) OR FIREABLE(exit_3)) AND FIREABLE(exit_2) AND FIREABLE(withdraw_11_2) AND (FIREABLE(withdraw_7_2) OR FIREABLE(withdraw_9_1))))) : E (F ((FIREABLE(withdraw_2_0) AND (NOT FIREABLE(withdraw_7_5) OR NOT FIREABLE(withdraw_6_7)) AND (NOT FIREABLE(withdraw_2_13) OR NOT FIREABLE(withdraw_6_4)) AND FIREABLE(withdraw_8_14))))
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_10_5) AND (FIREABLE(withdraw_12_8) OR FIREABLE(exit_13)) AND FIREABLE(withdraw_3_11))))
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_10_5) AND (FIREABLE(withdraw_12_8) OR FIREABLE(exit_13)) AND FIREABLE(withdraw_3_11))))
lola: processed formula length: 113
lola: 1 rewrites
lola: closed formula file Dekker-PT-015-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_10_5) AND (FIREABLE(withdraw_12_8) OR FIREABLE(exit_13)) AND FIREABLE(withdraw_3_11))
lola: state equation: Generated DNF with 17 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-015-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-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 ((FIREABLE(withdraw_10_2) AND FIREABLE(withdraw_9_13) AND FIREABLE(withdraw_8_13) AND FIREABLE(enter_8))))
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_10_2) AND FIREABLE(withdraw_9_13) AND FIREABLE(withdraw_8_13) AND FIREABLE(enter_8))))
lola: processed formula length: 111
lola: 1 rewrites
lola: closed formula file Dekker-PT-015-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
sara: try reading problem file Dekker-PT-015-ReachabilityFireability-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(withdraw_10_2) AND FIREABLE(withdraw_9_13) AND FIREABLE(withdraw_8_13) AND FIREABLE(enter_8))
lola: state equation: Generated DNF with 24 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-015-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-015-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-6 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_11_1) AND FIREABLE(withdraw_4_2) AND FIREABLE(withdraw_10_2) AND NOT FIREABLE(enter_10) AND FIREABLE(withdraw_7_6))))
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_1) AND FIREABLE(withdraw_4_2) AND FIREABLE(withdraw_10_2) AND NOT FIREABLE(enter_10) AND FIREABLE(withdraw_7_6))))
lola: processed formula length: 142
lola: 1 rewrites
lola: closed formula file Dekker-PT-015-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_1) AND FIREABLE(withdraw_4_2) AND FIREABLE(withdraw_10_2) AND NOT FIREABLE(enter_10) AND FIREABLE(withdraw_7_6))
lola: state equation: Generated DNF with 182 literals and 14 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-015-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-015-ReachabilityFireability-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-4 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 ((NOT FIREABLE(withdraw_2_14) OR NOT FIREABLE(withdraw_10_7) OR NOT FIREABLE(withdraw_0_10) OR NOT FIREABLE(withdraw_5_1) OR FIREABLE(withdraw_1_7))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(withdraw_2_14) OR NOT FIREABLE(withdraw_10_7) OR NOT FIREABLE(withdraw_0_10) OR NOT FIREABLE(withdraw_5_1) OR FIREABLE(withdraw_1_7))))
lola: processed formula length: 159
lola: 2 rewrites
lola: closed formula file Dekker-PT-015-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_2_14) AND FIREABLE(withdraw_10_7) AND FIREABLE(withdraw_0_10) AND FIREABLE(withdraw_5_1) AND NOT FIREABLE(withdraw_1_7))
lola: state equation: Generated DNF with 13 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-015-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-015-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(withdraw_6_7) AND (FIREABLE(withdraw_10_0) OR FIREABLE(withdraw_0_8)) AND FIREABLE(withdraw_5_4) AND FIREABLE(exit_8))))
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_6_7) AND (FIREABLE(withdraw_10_0) OR FIREABLE(withdraw_0_8)) AND FIREABLE(withdraw_5_4) AND FIREABLE(exit_8))))
lola: processed formula length: 141
lola: 1 rewrites
lola: closed formula file Dekker-PT-015-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_6_7) AND (FIREABLE(withdraw_10_0) OR FIREABLE(withdraw_0_8)) AND FIREABLE(withdraw_5_4) AND FIREABLE(exit_8))
lola: state equation: Generated DNF with 54 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-015-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-015-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-13 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_2_9) OR NOT FIREABLE(enter_10) OR FIREABLE(withdraw_0_11) OR (FIREABLE(exit_2) AND (NOT FIREABLE(withdraw_11_7) OR NOT FIREABLE(enter_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 ((NOT FIREABLE(withdraw_2_9) OR NOT FIREABLE(enter_10) OR FIREABLE(withdraw_0_11) OR (FIREABLE(exit_2) AND (NOT FIREABLE(withdraw_11_7) OR NOT FIREABLE(enter_6))))))
lola: processed formula length: 174
lola: 2 rewrites
lola: closed formula file Dekker-PT-015-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_2_9) AND FIREABLE(enter_10) AND NOT FIREABLE(withdraw_0_11) AND (NOT FIREABLE(exit_2) OR (FIREABLE(withdraw_11_7) AND FIREABLE(enter_6))))
lola: state equation: Generated DNF with 134 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-015-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-015-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Dekker-PT-015-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_5_9) OR (NOT FIREABLE(withdraw_5_13) AND NOT FIREABLE(withdraw_10_11)) OR ((NOT FIREABLE(withdraw_0_10) OR NOT FIREABLE(withdraw_4_8)) AND NOT FIREABLE(withdraw_14_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 ((NOT FIREABLE(withdraw_5_9) OR (NOT FIREABLE(withdraw_5_13) AND NOT FIREABLE(withdraw_10_11)) OR ((NOT FIREABLE(withdraw_0_10) OR NOT FIREABLE(withdraw_4_8)) AND NOT FIREABLE(withdraw_14_4)))))
lola: processed formula length: 202
lola: 2 rewrites
lola: closed formula file Dekker-PT-015-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_5_9) AND (FIREABLE(withdraw_5_13) OR FIREABLE(withdraw_10_11)) AND ((FIREABLE(withdraw_0_10) AND FIREABLE(withdraw_4_8)) OR FIREABLE(withdraw_14_4)))
lola: state equation: Generated DNF with 42 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-015-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA Dekker-PT-015-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(withdraw_2_0) AND (NOT FIREABLE(withdraw_7_5) OR NOT FIREABLE(withdraw_6_7)) AND (NOT FIREABLE(withdraw_2_13) OR NOT FIREABLE(withdraw_6_4)) AND FIREABLE(withdraw_8_14))))
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_2_0) AND (NOT FIREABLE(withdraw_7_5) OR NOT FIREABLE(withdraw_6_7)) AND (NOT FIREABLE(withdraw_2_13) OR NOT FIREABLE(withdraw_6_4)) AND FIREABLE(withdraw_8_14))))
lola: processed formula length: 189
lola: 1 rewrites
lola: closed formula file Dekker-PT-015-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: 5 markings, 4 edges
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file Dekker-PT-015-ReachabilityFireability-6-0.sara.
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(withdraw_14_11) OR NOT FIREABLE(withdraw_7_0) OR FIREABLE(try_6)) AND (NOT FIREABLE(withdraw_0_12) OR NOT FIREABLE(withdraw_6_11) OR (NOT FIREABLE(withdraw_14_13) AND NOT FIREABLE(withdraw_12_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_14_11) OR NOT FIREABLE(withdraw_7_0) OR FIREABLE(try_6)) AND (NOT FIREABLE(withdraw_0_12) OR NOT FIREABLE(withdraw_6_11) OR (NOT FIREABLE(withdraw_14_13) AND NOT FIREABLE(withdraw_12_13))))))
lola: processed formula length: 225
lola: 2 rewrites
lola: closed formula file Dekker-PT-015-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_14_11) AND FIREABLE(withdraw_7_0) AND NOT FIREABLE(try_6)) OR (FIREABLE(withdraw_0_12) AND FIREABLE(withdraw_6_11) AND (FIREABLE(withdraw_14_13) OR FIREABLE(withdraw_12_13))))
lola: state equation: Generated DNF with 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-015-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: 6 markings, 5 edges
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(withdraw_5_10) AND FIREABLE(withdraw_13_4) AND (FIREABLE(withdraw_11_8) OR FIREABLE(withdraw_9_2)) AND (NOT FIREABLE(exit_9) OR NOT FIREABLE(withdraw_7_5)) AND FIREABLE(withdraw_2_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 ((FIREABLE(withdraw_5_10) AND FIREABLE(withdraw_13_4) AND (FIREABLE(withdraw_11_8) OR FIREABLE(withdraw_9_2)) AND (NOT FIREABLE(exit_9) OR NOT FIREABLE(withdraw_7_5)) AND FIREABLE(withdraw_2_1))))
lola: processed formula length: 203
lola: 1 rewrites
lola: closed formula file Dekker-PT-015-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_5_10) AND FIREABLE(withdraw_13_4) AND (FIREABLE(withdraw_11_8) OR FIREABLE(withdraw_9_2)) AND (NOT FIREABLE(exit_9) OR NOT FIREABLE(withdraw_7_5)) AND FIREABLE(withdraw_2_1))
lola: state equation: Generated DNF with 91 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to Dekker-PT-015-ReachabilityFireability-9-0.sara
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(withdraw_1_8) AND NOT FIREABLE(withdraw_12_1) AND ((FIREABLE(withdraw_9_14) AND FIREABLE(withdraw_11_2)) OR (FIREABLE(withdraw_6_1) AND FIREABLE(withdraw_2_14)))) OR (FIREABLE(exit_8) AND FIREABLE(withdraw_8_14)))))
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_1_8) AND NOT FIREABLE(withdraw_12_1) AND ((FIREABLE(withdraw_9_14) AND FIREABLE(withdraw_11_2)) OR (FIREABLE(withdraw_6_1) AND FIREABLE(withdraw_2_14)))) OR (FIREABLE(exit_8) AND FIREABLE(withdraw_8_14)))))
lola: processed formula length: 238
lola: 1 rewrites
lola: closed formula file Dekker-PT-015-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_1_8) AND NOT FIREABLE(withdraw_12_1) AND ((FIREABLE(withdraw_9_14) AND FIREABLE(withdraw_11_2)) OR (FIREABLE(withdraw_6_1) AND FIREABLE(withdraw_2_14)))) OR (FIREABLE(exit_8) AND FIREABLE(withdraw_8_14)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: Generated DNF with 109 literals and 14 conjunctive subformulas
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-7 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 (((FIREABLE(withdraw_9_11) OR FIREABLE(withdraw_11_8)) AND NOT FIREABLE(withdraw_0_8) AND (FIREABLE(withdraw_8_7) OR FIREABLE(withdraw_6_1) OR (FIREABLE(withdraw_10_4) AND FIREABLE(withdraw_4_2))) AND FIREABLE(withdraw_9_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_9_11) OR FIREABLE(withdraw_11_8)) AND NOT FIREABLE(withdraw_0_8) AND (FIREABLE(withdraw_8_7) OR FIREABLE(withdraw_6_1) OR (FIREABLE(withdraw_10_4) AND FIREABLE(withdraw_4_2))) AND FIREABLE(withdraw_9_12))))
lola: processed formula length: 235
lola: 1 rewrites
lola: closed formula file Dekker-PT-015-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_9_11) OR FIREABLE(withdraw_11_8)) AND NOT FIREABLE(withdraw_0_8) AND (FIREABLE(withdraw_8_7) OR FIREABLE(withdraw_6_1) OR (FIREABLE(withdraw_10_4) AND FIREABLE(withdraw_4_2))) AND FIREABLE(withdraw_9_12))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 155 literals and 14 conjunctive subformulas
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to Dekker-PT-015-ReachabilityFireability-11-0.sara
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-5 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(withdraw_13_4) AND FIREABLE(withdraw_9_7) AND (FIREABLE(withdraw_13_11) OR FIREABLE(withdraw_9_14)) AND ((FIREABLE(exit_7) AND FIREABLE(exit_1)) OR FIREABLE(withdraw_7_6)) AND ((NOT FIREABLE(exit_9) AND NOT FIREABLE(withdraw_3_14)) OR NOT FIREABLE(withdraw_14_8)))))
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_13_4) AND FIREABLE(withdraw_9_7) AND (FIREABLE(withdraw_13_11) OR FIREABLE(withdraw_9_14)) AND ((FIREABLE(exit_7) AND FIREABLE(exit_1)) OR FIREABLE(withdraw_7_6)) AND ((NOT FIREABLE(exit_9) AND NOT FIREABLE(withdraw_3_14)) OR NOT FIREABLE(withdraw_14_8)))))
lola: processed formula length: 285
lola: 1 rewrites
lola: closed formula file Dekker-PT-015-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_13_4) AND FIREABLE(withdraw_9_7) AND (FIREABLE(withdraw_13_11) OR FIREABLE(withdraw_9_14)) AND ((FIREABLE(exit_7) AND FIREABLE(exit_1)) OR FIREABLE(withdraw_7_6)) AND ((NOT FIREABLE(exit_9) AND NOT FIREABLE(withdraw_3_14)) OR NOT FIREABLE(withdraw_14_8)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(withdraw_1_12) AND FIREABLE(withdraw_2_8) AND FIREABLE(withdraw_11_5) AND ((FIREABLE(withdraw_6_12) AND FIREABLE(enter_0) AND FIREABLE(withdraw_11_12)) OR (FIREABLE(withdraw_14_13) AND FIREABLE(withdraw_13_6) AND FIREABLE(withdraw_10_6) AND FIREABLE(withdraw_0_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 ((FIREABLE(withdraw_1_12) AND FIREABLE(withdraw_2_8) AND FIREABLE(withdraw_11_5) AND ((FIREABLE(withdraw_6_12) AND FIREABLE(enter_0) AND FIREABLE(withdraw_11_12)) OR (FIREABLE(withdraw_14_13) AND FIREABLE(withdraw_13_6) AND FIREABLE(withdraw_10_6) AND FIREABLE(withdraw_0_1))))))
lola: processed formula length: 285
lola: 1 rewrites
lola: closed formula file Dekker-PT-015-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_1_12) AND FIREABLE(withdraw_2_8) AND FIREABLE(withdraw_11_5) AND ((FIREABLE(withdraw_6_12) AND FIREABLE(enter_0) AND FIREABLE(withdraw_11_12)) OR (FIREABLE(withdraw_14_13) AND FIREABLE(withdraw_13_6) AND FIREABLE(withdraw_10_6) AND FIREABLE(withdraw_0_1))))
lola: state equation: Generated DNF with 51 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-015-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-015-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 489 markings, 1684 edges
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_9_14) OR NOT FIREABLE(withdraw_10_4) OR NOT FIREABLE(withdraw_2_9) OR NOT FIREABLE(withdraw_2_14) OR (((FIREABLE(withdraw_8_1) AND FIREABLE(withdraw_8_0)) OR (FIREABLE(withdraw_14_11) AND FIREABLE(withdraw_9_0))) AND (FIREABLE(withdraw_11_3) OR FIREABLE(withdraw_9_7) OR FIREABLE(withdraw_9_14) OR FIREABLE(exit_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 ((NOT FIREABLE(withdraw_9_14) OR NOT FIREABLE(withdraw_10_4) OR NOT FIREABLE(withdraw_2_9) OR NOT FIREABLE(withdraw_2_14) OR (((FIREABLE(withdraw_8_1) AND FIREABLE(withdraw_8_0)) OR (FIREABLE(withdraw_14_11) AND FIREABLE(withdraw_9_0))) AND (FIREABLE(withdraw_11_3) OR FIREABLE(withdraw_9_7) OR FIREABLE(withdraw_9_14) OR FIREABLE(exit_2))))))
lola: processed formula length: 356
lola: 2 rewrites
lola: closed formula file Dekker-PT-015-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_9_14) AND FIREABLE(withdraw_10_4) AND FIREABLE(withdraw_2_9) AND FIREABLE(withdraw_2_14) AND (((NOT FIREABLE(withdraw_8_1) OR NOT FIREABLE(withdraw_8_0)) AND (NOT FIREABLE(withdraw_14_11) OR NOT FIREABLE(withdraw_9_0))) OR (NOT FIREABLE(withdraw_11_3) AND NOT FIREABLE(withdraw_9_7) AND NOT FIREABLE(withdraw_9_14) AND NOT FIREABLE(exit_2))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(withdraw_12_2) AND (FIREABLE(withdraw_2_5) OR FIREABLE(withdraw_4_5) OR (FIREABLE(withdraw_14_11) AND FIREABLE(exit_14))) AND FIREABLE(withdraw_12_9) AND FIREABLE(withdraw_14_7) AND (FIREABLE(withdraw_2_1) OR FIREABLE(exit_3)) AND FIREABLE(exit_2) AND FIREABLE(withdraw_11_2) AND (FIREABLE(withdraw_7_2) OR FIREABLE(withdraw_9_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 ((FIREABLE(withdraw_12_2) AND (FIREABLE(withdraw_2_5) OR FIREABLE(withdraw_4_5) OR (FIREABLE(withdraw_14_11) AND FIREABLE(exit_14))) AND FIREABLE(withdraw_12_9) AND FIREABLE(withdraw_14_7) AND (FIREABLE(withdraw_2_1) OR FIREABLE(exit_3)) AND FIREABLE(exit_2) AND FIREABLE(withdraw_11_2) AND (FIREABLE(withdraw_7_2) OR FIREABLE(withdraw_9_1)))))
lola: processed formula length: 353
lola: 1 rewrites
lola: closed formula file Dekker-PT-015-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_12_2) AND (FIREABLE(withdraw_2_5) OR FIREABLE(withdraw_4_5) OR (FIREABLE(withdraw_14_11) AND FIREABLE(exit_14))) AND FIREABLE(withdraw_12_9) AND FIREABLE(withdraw_14_7) AND (FIREABLE(withdraw_2_1) OR FIREABLE(exit_3)) AND FIREABLE(exit_2) AND FIREABLE(withdraw_11_2) AND (FIREABLE(withdraw_7_2) OR FIREABLE(withdraw_9_1)))
lola: state equation: Generated DNF with 278 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-015-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-015-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA Dekker-PT-015-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes no yes no yes yes yes no yes no yes
lola:
preliminary result: yes no no yes yes yes no yes no yes yes yes no yes no yes
lola: memory consumption: 14872 KB
lola: time consumption: 1 seconds

BK_STOP 1526623115202

--------------------
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-015"
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-015.tgz
mv Dekker-PT-015 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-015, 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-152649936800084"
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 ;