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 216K
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 3.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Philosophers-PT-000005, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469900763
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527057809278

info: Time: 3600 - MCC
===========================================================================================
prep: translating Philosophers-PT-000005 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 Philosophers-PT-000005 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Philosophers-PT-000005 @ 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: 50/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25
lola: finding significant places
lola: 25 places, 25 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 35 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-PT-000005-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3)))) : A (G (((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3))) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))) AND NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4)))) : A (G (((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)))))) : E (F ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))) : E (F ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)))) : A (G (((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))))) : E (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))))) : A (G (((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)) AND ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5))) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))))))) : A (G (FIREABLE(FF2b_4))) : A (G (FIREABLE(FF1b_4))) : A (G (NOT FIREABLE(FF1b_1))) : E (F (FIREABLE(FF2a_5))) : E (F ((FIREABLE(End_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_2) OR (((FIREABLE(FF2b_1) AND FIREABLE(End_4)) OR FIREABLE(FF2b_5)) AND FIREABLE(FF2b_1))))) : A (G ((NOT FIREABLE(FF1a_4) AND NOT FIREABLE(End_1)))) : A (G ((FIREABLE(FF2a_5) AND FIREABLE(FF1a_4)))) : E (F (FIREABLE(FF2b_4)))
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(FF2b_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(FF2b_4)))
lola: processed formula length: 24
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000005-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(FF2b_4)
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-PT-000005-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000005-ReachabilityFireability-8 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(FF1b_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(FF1b_4)))
lola: processed formula length: 24
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000005-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(FF1b_4)
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
sara: try reading problem file Philosophers-PT-000005-ReachabilityFireability-0.sara.
sara: could not read problem information -- aborting [#01]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to Philosophers-PT-000005-ReachabilityFireability-0.sara

FORMULA Philosophers-PT-000005-ReachabilityFireability-9 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: A (G (NOT FIREABLE(FF1b_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 (NOT FIREABLE(FF1b_1)))
lola: processed formula length: 28
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000005-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(FF1b_1)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-PT-000005-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Philosophers-PT-000005-ReachabilityFireability-2-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 Philosophers-PT-000005-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
sara: try reading problem file Philosophers-PT-000005-ReachabilityFireability-0.sara.
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(FF2a_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(FF2a_5)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file Philosophers-PT-000005-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(FF2a_5)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-PT-000005-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Philosophers-PT-000005-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA Philosophers-PT-000005-ReachabilityFireability-11 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(FF2b_4)))
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(FF2b_4)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file Philosophers-PT-000005-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: 2 markings, 1 edges
lola: ========================================

FORMULA Philosophers-PT-000005-ReachabilityFireability-15 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 ((FIREABLE(FF2a_5) AND FIREABLE(FF1a_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(FF2a_5) AND FIREABLE(FF1a_4))))
lola: processed formula length: 47
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000005-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

FORMULA Philosophers-PT-000005-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: lola: ========================================
subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(FF1a_4) AND NOT FIREABLE(End_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 ((NOT FIREABLE(FF1a_4) AND NOT FIREABLE(End_1))))
lola: processed formula length: 54
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000005-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(FF1a_4) OR FIREABLE(End_1))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000005-ReachabilityFireability-13 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 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_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(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))))
lola: processed formula length: 110
lola: 1 rewrites
lola: closed formula file Philosophers-PT-000005-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(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))
lola: state equation: Generated DNF with 10 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-PT-000005-ReachabilityFireability-7-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000005-ReachabilityFireability-4 TRUE 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: E (F ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_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(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))
lola: processed formula length: 110
lola: 1 rewrites
lola: closed formula file Philosophers-PT-000005-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(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))
lola: state equation: Generated DNF with 10 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to Philosophers-PT-000005-ReachabilityFireability-8-0.sara

FORMULA Philosophers-PT-000005-ReachabilityFireability-3 TRUE 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: ========================================
lola: state equation: calling and running sara
lola: ...considering subproblem: E (F ((FIREABLE(End_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_2) OR (((FIREABLE(FF2b_1) AND FIREABLE(End_4)) OR FIREABLE(FF2b_5)) AND FIREABLE(FF2b_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(End_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_2) OR (((FIREABLE(FF2b_1) AND FIREABLE(End_4)) OR FIREABLE(FF2b_5)) AND FIREABLE(FF2b_1)))))sara: try reading problem file Philosophers-PT-000005-ReachabilityFireability-8-0.sara.

lola: processed formula length: 198
lola: 1 rewrites
lola: closed formula file Philosophers-PT-000005-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)sara: place or transition ordering is non-deterministic

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(End_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_2) OR (((FIREABLE(FF2b_1) AND FIREABLE(End_4)) OR FIREABLE(FF2b_5)) AND FIREABLE(FF2b_1)))
lola: state equation: Generated DNF with 18 literals and 7 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 Philosophers-PT-000005-ReachabilityFireability-9-0.sara


FORMULA Philosophers-PT-000005-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3))))
lola: ========================================
lola: SUBTASK
lola: lola: state equation: calling and running sara
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(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3))))
lola: processed formula length: 255
lola: 1 rewrites
lola: closed formula file Philosophers-PT-000005-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: formula 0: (NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3))
lola: ========================================

FORMULA Philosophers-PT-000005-ReachabilityFireability-0 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: ========================================
sara: try reading problem file Philosophers-PT-000005-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: E (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_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 ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))
lola: processed formula length: 357
lola: 1 rewrites
lola: closed formula file Philosophers-PT-000005-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(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))
lola: state equation: Generated DNF with 960 literals and 80 conjunctive subformulas

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000005-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR... (shortened)
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(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR... (shortened)
lola: processed formula length: 657
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000005-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(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5)))) OR (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000005-ReachabilityFireability-2 FALSE 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(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR F... (shortened)
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(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR F... (shortened)
lola: processed formula length: 524
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000005-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(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5)) OR (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

lola: ========================================
FORMULA Philosophers-PT-000005-ReachabilityFireability-5 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(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3))) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1)... (shortened)
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(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3))) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1)... (shortened)
lola: processed formula length: 782
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000005-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(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5)) OR (NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4)))) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA Philosophers-PT-000005-ReachabilityFireability-1 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: A (G (((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)) AND ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5))) AND (FIREABLE(FF2b_1) OR FIREABLE... (shortened)
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(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)) AND ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5))) AND (FIREABLE(FF2b_1) OR FIREABLE... (shortened)
lola: processed formula length: 1019
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000005-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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3)) OR ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))) OR (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5)))))
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000005-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes yes no yes no no no no yes yes no no yes
lola:
preliminary result: yes no no yes yes no yes no no no no yes yes no no yes
lola: memory consumption: 14612 KB
lola: time consumption: 0 seconds

BK_STOP 1527057809659

--------------------
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="Philosophers-PT-000005"
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/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 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 Philosophers-PT-000005, 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 r112-csrt-152666469900763"
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 ;