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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469900767
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527057861213

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 CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ 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-CTLFireability.task
lola: A (G (E (X (A (F ((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)))))))) : NOT(E (F ((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(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(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 ((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(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)))))))) : NOT(E (F (((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)) 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 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)))))) : A (G ((NOT(E (X ((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 A (((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)) U (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))))))) : ((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(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 A (X (A (F ((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 (A (X ((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)))))) : (E (X (((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(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 A (X ((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 E (F (E (F ((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))))))) : E (F ((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(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)) 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)) 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)))))) : ((FIREABLE(FF1b_10) OR (A (X (FIREABLE(FF1a_3))) AND E ((FIREABLE(End_5) U FIREABLE(FF2b_1))))) AND A (G (NOT(A (G (FIREABLE(FF1a_10))))))) : (NOT(E (F (E (G (FIREABLE(End_10)))))) AND NOT FIREABLE(FF2b_1)) : E ((NOT FIREABLE(FF2a_8) U A (X (FIREABLE(FF1a_8))))) : ((A ((NOT FIREABLE(FF2a_6) U FIREABLE(FF2b_1))) OR A (G (A (G (FIREABLE(FF1b_5)))))) OR A (G (NOT(A (G (FIREABLE(FF2b_1))))))) : E (F (A (F (A (X (FIREABLE(FF1a_3))))))) : E ((NOT(A (X (FIREABLE(FF1b_10)))) U A (G (FIREABLE(End_5))))) : E (X (((E (G (FIREABLE(FF1b_9))) AND E (F (FIREABLE(FF2b_9)))) AND FIREABLE(End_2)))) : FIREABLE(FF2a_1)
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(FF2a_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(FF2a_1)
lola: processed formula length: 16
lola: 30 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-15 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 ((A (X ((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)))) OR A (((FIREABLE(FF2a_4) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_6) OR FIREABLE(FF2a_7) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(E(TRUE U (NOT(AX((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(A((FIREABLE(FF2a_4) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_6) OR FIREABLE(FF2a_7) OR FIREABLE(FF2a_1) OR FIREABLE(FF2... (shortened)
lola: processed formula length: 706
lola: 34 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 11 markings, 20 edges
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((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(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 FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (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: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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: processed formula length: 248
lola: 30 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (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))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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))
lola: processed formula length: 208
lola: 30 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((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: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (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: processed formula length: 238
lola: 32 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 3679 markings, 17001 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (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))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (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: processed formula length: 248
lola: 32 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--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 /EXEF
lola: The predicate is not invariant from successors.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X ((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(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 F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((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: ========================================
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(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: processed formula length: 256
lola: 31 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.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(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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((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(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 FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((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(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 FIREAB... (shortened)
lola: processed formula length: 413
lola: 31 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-6 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: ((FIREABLE(FF1b_10) OR (A (X (FIREABLE(FF1a_3))) AND E ((FIREABLE(End_5) U FIREABLE(FF2b_1))))) AND A (G (E (F (NOT FIREABLE(FF1a_10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (NOT FIREABLE(FF1a_10)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: NOT FIREABLE(FF1a_10)
lola: processed formula length: 21
lola: 31 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 59049 markings, 432764 edges
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(FF1b_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(FF1b_10)
lola: processed formula length: 17
lola: 30 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(FF2a_8) U A (X (FIREABLE(FF1a_8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(NOT FIREABLE(FF2a_8) U AX(FIREABLE(FF1a_8)))
lola: processed formula length: 46
lola: 32 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 15 markings, 16 edges
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (FIREABLE(FF1a_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX(FIREABLE(FF1a_3)))
lola: processed formula length: 30
lola: 32 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 15 markings, 16 edges
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-12 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 ((E (X (NOT FIREABLE(FF1b_10))) U A (G (FIREABLE(End_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(EX(NOT FIREABLE(FF1b_10)) U NOT(E(TRUE U NOT FIREABLE(End_5))))
lola: processed formula length: 65
lola: 34 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 59049 markings, 524870 edges
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (G (FIREABLE(FF1b_9))) AND (E (F (FIREABLE(FF2b_9))) AND FIREABLE(End_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX((NOT(A(TRUE U NOT FIREABLE(FF1b_9))) AND (E(TRUE U FIREABLE(FF2b_9)) AND FIREABLE(End_2))))
lola: processed formula length: 94
lola: 34 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 527 markings, 681 edges
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-14 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 (E (X (A (F ((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))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(A(TRUE U (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)))))))
lola: processed formula length: 242
lola: 33 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 60 markings, 79 edges
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-0 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(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(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:695
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)) 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(F... (shortened)
lola: processed formula length: 855
lola: 32 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.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:695
lola: SUBRESULT
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)) 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)) 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 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: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(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 ... (shortened)
lola: processed formula length: 1515
lola: 31 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.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_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(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)) 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)) 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 38 markings, 42 edges
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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(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 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:695
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(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 FI... (shortened)
lola: processed formula length: 1457
lola: 32 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.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:695
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(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(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 ((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(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: 8 markings, 7 edges
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-1 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 (A (F (NOT FIREABLE(End_10))))) AND NOT FIREABLE(FF2b_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(FF2b_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(FF2b_1)
lola: processed formula length: 20
lola: 30 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (NOT FIREABLE(End_10)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: FIREABLE(End_10)
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: lola: ========================================
SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 26 markings, 33 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((NOT FIREABLE(FF2a_6) U FIREABLE(FF2b_1))) OR (A (G (FIREABLE(FF1b_5))) OR A (G (E (F (NOT FIREABLE(FF2b_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(FF2a_6) U FIREABLE(FF2b_1)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((NOT FIREABLE(FF2a_6) U FIREABLE(FF2b_1)))
lola: processed formula length: 45
lola: 34 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 11 markings, 11 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (NOT FIREABLE(FF2b_1)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: NOT FIREABLE(FF2b_1)
lola: processed formula length: 20
lola: 31 rewrites
lola: closed formula file Philosophers-PT-000010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 59049 markings, 433844 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Philosophers-PT-000010-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no yes yes yes no yes yes yes no no no
lola:
preliminary result: no no no no no no yes yes yes no yes yes yes no no no
lola: memory consumption: 14668 KB
lola: time consumption: 2 seconds

BK_STOP 1527057863160

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