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 312K
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K 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 4.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K 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 7.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 41K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Philosophers-PT-000010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469900770
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527057901647

info: Time: 3600 - MCC
===========================================================================================
prep: translating Philosophers-PT-000010 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-000010 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Philosophers-PT-000010 @ 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: 100/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 50
lola: finding significant places
lola: 50 places, 50 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-PT-000010-ReachabilityFireability.task
lola: A (G ((FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8)) AND (FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10))) OR ((FIREABLE(End_1) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_10) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_4) OR FIREABLE(End_5)) AND (FIREABLE(FF2a_4) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_6) OR FIREABLE(FF2a_7) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_9) OR FIREABLE(FF2a_8) OR FIREABLE(FF2a_10))) OR (NOT FIREABLE(FF2a_4) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_6) AND NOT FIREABLE(FF2a_7) AND NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_9) AND NOT FIREABLE(FF2a_8) AND NOT FIREABLE(FF2a_10) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10) AND (FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10)))))) : A (G ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8) OR (NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10)) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8) OR ((FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_9) OR FIREABLE(FF2b_8)) AND (FIREABLE(End_1) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_10) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_4) OR FIREABLE(End_5))) OR ((FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR FIREABLE(End_1) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_10) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_4) OR FIREABLE(End_5)) AND (FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_9) OR FIREABLE(FF2b_8)) AND ((NOT FIREABLE(End_1) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_10) AND NOT FIREABLE(End_8) AND NOT FIREABLE(End_9) AND NOT FIREABLE(End_6) AND NOT FIREABLE(End_7) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_5)) OR ((FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10)) AND (FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_9) OR FIREABLE(FF2b_8)))))))) : A (G ((FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR (NOT FIREABLE(End_1) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_10) AND NOT FIREABLE(End_8) AND NOT FIREABLE(End_9) AND NOT FIREABLE(End_6) AND NOT FIREABLE(End_7) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_5))))) : A (G ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8)))) : A (G ((FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR (NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10)) OR ((FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10)) AND (FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8))) OR FIREABLE(End_1) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_10) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_4) OR FIREABLE(End_5)))) : A (G ((FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10)) AND (FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_9) OR FIREABLE(FF2b_8))) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8) OR (NOT FIREABLE(FF2b_3) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_10) AND NOT FIREABLE(FF2b_7) AND NOT FIREABLE(FF2b_6) AND NOT FIREABLE(FF2b_9) AND NOT FIREABLE(FF2b_8) AND (FIREABLE(FF2a_4) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_6) OR FIREABLE(FF2a_7) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_9) OR FIREABLE(FF2a_8) OR FIREABLE(FF2a_10) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10)))))) : A (G ((FIREABLE(End_1) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_10) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_4) OR FIREABLE(End_5) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10)))) : A (G ((((FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_9) OR FIREABLE(FF2b_8)) AND (FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10)) AND (FIREABLE(End_1) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_10) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_4) OR FIREABLE(End_5))) OR ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8)) AND (FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8)))))) : E (F ((FIREABLE(FF1b_2) AND FIREABLE(FF1a_1) AND (FIREABLE(FF1a_4) OR FIREABLE(FF1b_4)) AND FIREABLE(End_10) AND FIREABLE(FF1b_3) AND FIREABLE(FF2a_7) AND FIREABLE(End_8) AND NOT FIREABLE(End_2)))) : E (F ((FIREABLE(FF2a_8) AND FIREABLE(FF1a_6) AND (FIREABLE(FF1a_8) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2b_2) OR FIREABLE(FF2b_8) OR (FIREABLE(FF1a_4) AND FIREABLE(FF2a_10))) AND ((FIREABLE(FF2b_2) AND FIREABLE(End_10) AND (FIREABLE(FF1a_2) OR FIREABLE(FF2b_7))) OR (FIREABLE(End_2) AND FIREABLE(FF2b_1) AND (FIREABLE(End_7) OR FIREABLE(FF2a_10))))))) : E (F (FIREABLE(FF2b_4))) : A (G (((NOT FIREABLE(FF2b_8) OR (NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2))) AND FIREABLE(FF1b_9)))) : E (F (((NOT FIREABLE(End_5) OR NOT FIREABLE(End_8)) AND FIREABLE(FF2b_8) AND (FIREABLE(FF1a_9))))) : A (G ((FIREABLE(FF2b_9) OR NOT FIREABLE(FF1a_1)))) : E (F ((FIREABLE(FF1a_6) OR (FIREABLE(FF1a_10) AND (FIREABLE(End_4) OR FIREABLE(FF2a_9) OR NOT FIREABLE(End_10)))))) : A (G ((FIREABLE(FF1b_5) OR FIREABLE(End_9) OR FIREABLE(FF2b_8))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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-000010-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_4)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges

FORMULA Philosophers-PT-000010-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to Philosophers-PT-000010-ReachabilityFireability-0.sara
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(FF2b_9) OR NOT FIREABLE(FF1a_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(FF2b_9) OR NOT FIREABLE(FF1a_1))))
lola: processed formula length: 51
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000010-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: state equation: calling and running sara
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(FF2b_9) AND FIREABLE(FF1a_1))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola:
========================================FORMULA Philosophers-PT-000010-ReachabilityFireability-13 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(FF2b_8) OR (NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2))) AND FIREABLE(FF1b_9))))
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(FF2b_8) OR (NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2))) AND FIREABLE(FF1b_9))))
lola: processed formula length: 105
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000010-ReachabilityFireability.task
sara: try reading problem file Philosophers-PT-000010-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: 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(FF2b_8) AND (FIREABLE(FF1b_9) OR FIREABLE(FF1b_2))) OR NOT FIREABLE(FF1b_9))
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola:
FORMULA Philosophers-PT-000010-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(FF1b_5) OR FIREABLE(End_9) OR FIREABLE(FF2b_8))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(FF1b_5) OR FIREABLE(End_9) OR FIREABLE(FF2b_8))))
lola: processed formula length: 67
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: formula 0: (NOT FIREABLE(FF1b_5) AND NOT FIREABLE(End_9) AND NOT FIREABLE(FF2b_8))

FORMULA Philosophers-PT-000010-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(End_5) OR NOT FIREABLE(End_8)) AND FIREABLE(FF2b_8) AND (FIREABLE(FF1a_9)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NOT FIREABLE(End_5) OR NOT FIREABLE(End_8)) AND FIREABLE(FF2b_8) AND (FIREABLE(FF1a_9)))))
lola: processed formula length: 99
lola: 1 rewrites
lola: closed formula file Philosophers-PT-000010-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_5) OR NOT FIREABLE(End_8)) AND FIREABLE(FF2b_8) AND (FIREABLE(FF1a_9)))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-PT-000010-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Philosophers-PT-000010-ReachabilityFireability-4-0.sara.
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.

FORMULA Philosophers-PT-000010-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(FF1a_6) OR (FIREABLE(FF1a_10) AND (FIREABLE(End_4) OR FIREABLE(FF2a_9) OR NOT FIREABLE(End_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(FF1a_6) OR (FIREABLE(FF1a_10) AND (FIREABLE(End_4) OR FIREABLE(FF2a_9) OR NOT FIREABLE(End_10))))))
lola: processed formula length: 118
lola: 1 rewrites
lola: closed formula file Philosophers-PT-000010-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_6) OR (FIREABLE(FF1a_10) AND (FIREABLE(End_4) OR FIREABLE(FF2a_9) OR NOT FIREABLE(End_10))))
lola: state equation: Generated DNF with 12 literals and 4 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-000010-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(FF1b_2) AND FIREABLE(FF1a_1) AND (FIREABLE(FF1a_4) OR FIREABLE(FF1b_4)) AND FIREABLE(End_10) AND FIREABLE(FF1b_3) AND FIREABLE(FF2a_7) AND FIREABLE(End_8) AND NOT FIREABLE(End_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(FF1b_2) AND FIREABLE(FF1a_1) AND (FIREABLE(FF1a_4) OR FIREABLE(FF1b_4)) AND FIREABLE(End_10) AND FIREABLE(FF1b_3) AND FIREABLE(FF2a_7) AND FIREABLE(End_8) AND NOT FIREABLE(End_2))))
lola: processed formula length: 198
lola: 1 rewrites
lola: closed formula file Philosophers-PT-000010-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(FF1b_2) AND FIREABLE(FF1a_1) AND (FIREABLE(FF1a_4) OR FIREABLE(FF1b_4)) AND FIREABLE(End_10) AND FIREABLE(FF1b_3) AND FIREABLE(FF2a_7) AND FIREABLE(End_8) AND NOT FIREABLE(End_2))
lola: state equation: Generated DNF with 26 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-PT-000010-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Philosophers-PT-000010-ReachabilityFireability-6-0.sara.
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 Philosophers-PT-000010-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: A (G ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8))))
lola: processed formula length: 216
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000010-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(FF1a_3) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_7) AND NOT FIREABLE(FF1a_6) AND NOT FIREABLE(FF1a_5) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_10) AND NOT FIREABLE(FF1a_9) AND NOT FIREABLE(FF1a_8))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA Philosophers-PT-000010-ReachabilityFireability-3 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: E (F ((FIREABLE(FF2a_8) AND FIREABLE(FF1a_6) AND (FIREABLE(FF1a_8) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2b_2) OR FIREABLE(FF2b_8) OR (FIREABLE(FF1a_4) AND FIREABLE(FF2a_10))) AND ((FIREABLE(FF2b_2) AND FIREABLE(End_10) AND (FIREABLE(FF1a_2) OR FIREABLE(FF2b_7))) OR (FIREABLE(End_2) AND FIREABLE(FF2b_1) AND (FIREABLE(End_7) OR FIREABLE(FF2a_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(FF2a_8) AND FIREABLE(FF1a_6) AND (FIREABLE(FF1a_8) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2b_2) OR FIREABLE(FF2b_8) OR (FIREABLE(FF1a_4) AND FIREABLE(FF2a_10))) AND ((FIREABLE(FF2b_2) AND FIREABLE(End_10) AND (FIREABLE(FF1a_2) OR FIREABLE(FF2b_7))) OR (FIREABLE(End_2) AND FIREABLE(FF2b_1) AND (FIREABLE(End_7) OR FIREABLE(FF2a_10)))))))
lola: processed formula length: 357
lola: 1 rewrites
lola: closed formula file Philosophers-PT-000010-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_8) AND FIREABLE(FF1a_6) AND (FIREABLE(FF1a_8) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2b_2) OR FIREABLE(FF2b_8) OR (FIREABLE(FF1a_4) AND FIREABLE(FF2a_10))) AND ((FIREABLE(FF2b_2) AND FIREABLE(End_10) AND (FIREABLE(FF1a_2) OR FIREABLE(FF2b_7))) OR (FIREABLE(End_2) AND FIREABLE(FF2b_1) AND (FIREABLE(End_7) OR FIREABLE(FF2a_10)))))
lola: state equation: Generated DNF with 322 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-PT-000010-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Philosophers-PT-000010-ReachabilityFireability-8-0.sara.
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 Philosophers-PT-000010-ReachabilityFireability-9 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: A (G ((FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR (NOT FIREABLE(End_1) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_10) AND NOT FIREABLE(End_8) AND NOT FIREABLE(End_9) AND NOT FIREABLE(End_6) AND NOT 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(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR (NOT FIREABLE(End_1) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_10) AND NOT FIREABLE(End_8) AND NOT FIREABLE(End_9) AND NOT FIREABLE(End_6) AND NOT FIREABLE... (shortened)
lola: processed formula length: 459
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000010-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_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10) AND (FIREABLE(End_1) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_10) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_4) OR FIREABLE(End_5)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Philosophers-PT-000010-ReachabilityFireability-2 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: A (G ((FIREABLE(End_1) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_10) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_4) OR FIREABLE(End_5) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIR... (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_1) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_10) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_4) OR FIREABLE(End_5) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIR... (shortened)
lola: processed formula length: 417
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000010-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_1) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_10) AND NOT FIREABLE(End_8) AND NOT FIREABLE(End_9) AND NOT FIREABLE(End_6) AND NOT FIREABLE(End_7) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Philosophers-PT-000010-ReachabilityFireability-6 FALSE 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: A (G ((FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR (NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FI... (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_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR (NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FI... (shortened)
lola: processed formula length: 1098
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000010-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_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10) AND (FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10)) AND ((NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10)) OR (NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_7) AND NOT FIREABLE(FF1a_6) AND NOT FIREABLE(FF1a_5) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_10) AND NOT FIREABLE(FF1a_9) AND NOT FIREABLE(FF1a_8))) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_10) AND NOT FIREABLE(End_8) AND NOT FIREABLE(End_9) AND NOT FIREABLE(End_6) AND NOT FIREABLE(End_7) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_5))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Philosophers-PT-000010-ReachabilityFireability-4 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(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_9) OR FIREABLE(FF2b_8)) AND (FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) 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_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_9) OR FIREABLE(FF2b_8)) AND (FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(... (shortened)
lola: processed formula length: 1275
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000010-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_3) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_10) AND NOT FIREABLE(FF2b_7) AND NOT FIREABLE(FF2b_6) AND NOT FIREABLE(FF2b_9) AND NOT FIREABLE(FF2b_8)) OR (NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_7) AND NOT FIREABLE(FF1a_6) AND NOT FIREABLE(FF1a_5) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_10) AND NOT FIREABLE(FF1a_9) AND NOT FIREABLE(FF1a_8) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10)) OR (NOT FIREABLE(End_1) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_10) AND NOT FIREABLE(End_8) AND NOT FIREABLE(End_9) AND NOT FIREABLE(End_6) AND NOT FIREABLE(End_7) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_5))) AND ((NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_7) AND NOT FIREABLE(FF1a_6) AND NOT FIREABLE(FF1a_5) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_10) AND NOT FIREABLE(FF1a_9) AND NOT FIREABLE(FF1a_8)) OR (NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_7) AND NOT FIREABLE(FF1a_6) AND NOT FIREABLE(FF1a_5) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_10) AND NOT FIREABLE(FF1a_9) AND NOT FIREABLE(FF1a_8))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges

FORMULA Philosophers-PT-000010-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF... (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_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF... (shortened)
lola: processed formula length: 1954
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000010-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: 11 markings, 10 edges
lola: ========================================

FORMULA Philosophers-PT-000010-ReachabilityFireability-5 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: A (G ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8) OR (NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FI... (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(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_8) OR (NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FI... (shortened)
lola: processed formula length: 2611
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000010-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(FF1a_3) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_7) AND NOT FIREABLE(FF1a_6) AND NOT FIREABLE(FF1a_5) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_10) AND NOT FIREABLE(FF1a_9) AND NOT FIREABLE(FF1a_8) AND (FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10)) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_7) AND NOT FIREABLE(FF1a_6) AND NOT FIREABLE(FF1a_5) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_10) AND NOT FIREABLE(FF1a_9) AND NOT FIREABLE(FF1a_8) AND ((NOT FIREABLE(FF2b_3) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_10) AND NOT FIREABLE(FF2b_7) AND NOT FIREABLE(FF2b_6) AND NOT FIREABLE(FF2b_9) AND NOT FIREABLE(FF2b_8)) OR (NOT FIREABLE(End_1) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_10) AND NOT FIREABLE(End_8) AND NOT FIREABLE(End_9) AND NOT FIREABLE(End_6) AND NOT FIREABLE(End_7) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_5))) AND ((NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_10) AND NOT FIREABLE(End_8) AND NOT FIREABLE(End_9) AND NOT FIREABLE(End_6) AND NOT FIREABLE(End_7) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_5)) OR (NOT FIREABLE(FF2b_3) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_10) AND NOT FIREABLE(FF2b_7) AND NOT FIREABLE(FF2b_6) AND NOT FIREABLE(FF2b_9) AND NOT FIREABLE(FF2b_8)) OR ((FIREABLE(End_1) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_10) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_4) OR FIREABLE(End_5)) AND ((NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10)) OR (NOT FIREABLE(FF2b_3) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_10) AND NOT FIREABLE(FF2b_7) AND NOT FIREABLE(FF2b_6) AND NOT FIREABLE(FF2b_9) AND NOT FIREABLE(FF2b_8))))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 59047 markings, 336058 edges
lola:
FORMULA Philosophers-PT-000010-ReachabilityFireability-1 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: A (G ((FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF... (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_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR ((FIREABLE(FF1a_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_10) OR FIREABLE(FF... (shortened)
lola: processed formula length: 1779
lola: 2 rewrites
lola: closed formula file Philosophers-PT-000010-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_3) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_10) AND NOT FIREABLE(FF2b_7) AND NOT FIREABLE(FF2b_6) AND NOT FIREABLE(FF2b_9) AND NOT FIREABLE(FF2b_8) AND ((NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_7) AND NOT FIREABLE(FF1a_6) AND NOT FIREABLE(FF1a_5) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_10) AND NOT FIREABLE(FF1a_9) AND NOT FIREABLE(FF1a_8)) OR (NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10))) AND ((NOT FIREABLE(End_1) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_10) AND NOT FIREABLE(End_8) AND NOT FIREABLE(End_9) AND NOT FIREABLE(End_6) AND NOT FIREABLE(End_7) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_5)) OR (NOT FIREABLE(FF2a_4) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_6) AND NOT FIREABLE(FF2a_7) AND NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_9) AND NOT FIREABLE(FF2a_8) AND NOT FIREABLE(FF2a_10))) AND (FIREABLE(FF2a_4) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_6) OR FIREABLE(FF2a_7) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_9) OR FIREABLE(FF2a_8) OR FIREABLE(FF2a_10) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF1b_10) OR (NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_6) AND NOT FIREABLE(FF1b_7) AND NOT FIREABLE(FF1b_8) AND NOT FIREABLE(FF1b_9) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1b_10))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 22 edges
lola: ========================================

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

BK_STOP 1527057902677

--------------------
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-000010"
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-000010.tgz
mv Philosophers-PT-000010 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-000010, 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-152666469900770"
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 ;