fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r148-smll-152685547200231
Last Updated
June 26, 2018

About the Execution of LoLA for SafeBus-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
154.860 921.00 1867.00 37.50 FFFTFTTFTFFFFTFF normal

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 316K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K 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 15K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SafeBus-PT-03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547200231
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527026299198

info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-PT-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-PT-03 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ SafeBus-PT-03 @ 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: 148/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1824
lola: finding significant places
lola: 57 places, 91 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 108 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-03-ReachabilityFireability.task
lola: E (F (((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND ((NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)) OR (NOT FIREABLE(loss_m_1) AND NOT FIREABLE(loss_m_2) AND NOT FIREABLE(loss_m_3))) AND (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3) OR (FIREABLE(loss_a) AND (FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_reemit_1_3) OR FIREABLE(I_reemit_2_3))) OR (NOT FIREABLE(I_ask1_1_1) AND NOT FIREABLE(I_ask1_2_1) AND NOT FIREABLE(I_ask1_3_1) AND NOT FIREABLE(I_ask1_1_2) AND NOT FIREABLE(I_ask1_2_2) AND NOT FIREABLE(I_ask1_3_2) AND NOT FIREABLE(I_ask1_1_3) AND NOT FIREABLE(I_ask1_2_3) AND NOT FIREABLE(I_ask1_3_3)))))) : E (F ((NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3) AND NOT FIREABLE(I_ask1_1_1) AND NOT FIREABLE(I_ask1_2_1) AND NOT FIREABLE(I_ask1_3_1) AND NOT FIREABLE(I_ask1_1_2) AND NOT FIREABLE(I_ask1_2_2) AND NOT FIREABLE(I_ask1_3_2) AND NOT FIREABLE(I_ask1_1_3) AND NOT FIREABLE(I_ask1_2_3) AND NOT FIREABLE(I_ask1_3_3) AND ((NOT FIREABLE(I_ask2_1_1) AND NOT FIREABLE(I_ask2_2_1) AND NOT FIREABLE(I_ask2_3_1) AND NOT FIREABLE(I_ask2_1_2) AND NOT FIREABLE(I_ask2_2_2) AND NOT FIREABLE(I_ask2_3_2) AND NOT FIREABLE(I_ask2_1_3) AND NOT FIREABLE(I_ask2_2_3) AND NOT FIREABLE(I_ask2_3_3)) OR NOT FIREABLE(loss_a)) AND (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3))))) : E (F (((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) AND (FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3)) AND ((NOT FIREABLE(C_provide_1_1_1) AND NOT FIREABLE(C_provide_2_1_1) AND NOT FIREABLE(C_provide_3_1_1) AND NOT FIREABLE(C_provide_1_2_2) AND NOT FIREABLE(C_provide_2_2_2) AND NOT FIREABLE(C_provide_3_2_2) AND NOT FIREABLE(C_provide_1_3_3) AND NOT FIREABLE(C_provide_2_3_3) AND NOT FIREABLE(C_provide_3_3_3)) OR (NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3))) AND (FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3) OR FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3) OR FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3) OR FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))))) : A (G ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR (NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3) AND NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)) OR (NOT FIREABLE(I_ask2_1_1) AND NOT FIREABLE(I_ask2_2_1) AND NOT FIREABLE(I_ask2_3_1) AND NOT FIREABLE(I_ask2_1_2) AND NOT FIREABLE(I_ask2_2_2) AND NOT FIREABLE(I_ask2_3_2) AND NOT FIREABLE(I_ask2_1_3) AND NOT FIREABLE(I_ask2_2_3) AND NOT FIREABLE(I_ask2_3_3)) OR (NOT FIREABLE(C_refuse_1_1_1_1) AND NOT FIREABLE(C_refuse_2_1_1_1) AND NOT FIREABLE(C_refuse_3_1_1_1) AND NOT FIREABLE(C_refuse_1_2_1_1) AND NOT FIREABLE(C_refuse_2_2_1_1) AND NOT FIREABLE(C_refuse_3_2_1_1) AND NOT FIREABLE(C_refuse_1_3_1_1) AND NOT FIREABLE(C_refuse_2_3_1_1) AND NOT FIREABLE(C_refuse_3_3_1_1) AND NOT FIREABLE(C_refuse_1_1_2_2) AND NOT FIREABLE(C_refuse_2_1_2_2) AND NOT FIREABLE(C_refuse_3_1_2_2) AND NOT FIREABLE(C_refuse_1_2_2_2) AND NOT FIREABLE(C_refuse_2_2_2_2) AND NOT FIREABLE(C_refuse_3_2_2_2) AND NOT FIREABLE(C_refuse_1_3_2_2) AND NOT FIREABLE(C_refuse_2_3_2_2) AND NOT FIREABLE(C_refuse_3_3_2_2) AND NOT FIREABLE(C_refuse_1_1_3_3) AND NOT FIREABLE(C_refuse_2_1_3_3) AND NOT FIREABLE(C_refuse_3_1_3_3) AND NOT FIREABLE(C_refuse_1_2_3_3) AND NOT FIREABLE(C_refuse_2_2_3_3) AND NOT FIREABLE(C_refuse_3_2_3_3) AND NOT FIREABLE(C_refuse_1_3_3_3) AND NOT FIREABLE(C_refuse_2_3_3_3) AND NOT FIREABLE(C_refuse_3_3_3_3)) OR FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)))) : E (F ((NOT FIREABLE(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) AND (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3)) AND (FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)) AND NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3))))) : A (G ((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR (NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)) OR NOT FIREABLE(loss_a)))) : A (G ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR ((FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3)) AND (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3))) OR (NOT FIREABLE(C_provide_1_1_1) AND NOT FIREABLE(C_provide_2_1_1) AND NOT FIREABLE(C_provide_3_1_1) AND NOT FIREABLE(C_provide_1_2_2) AND NOT FIREABLE(C_provide_2_2_2) AND NOT FIREABLE(C_provide_3_2_2) AND NOT FIREABLE(C_provide_1_3_3) AND NOT FIREABLE(C_provide_2_3_3) AND NOT FIREABLE(C_provide_3_3_3)) OR (NOT FIREABLE(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3)) OR (NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)) OR (NOT FIREABLE(C_refuse_1_1_1_1) AND NOT FIREABLE(C_refuse_2_1_1_1) AND NOT FIREABLE(C_refuse_3_1_1_1) AND NOT FIREABLE(C_refuse_1_2_1_1) AND NOT FIREABLE(C_refuse_2_2_1_1) AND NOT FIREABLE(C_refuse_3_2_1_1) AND NOT FIREABLE(C_refuse_1_3_1_1) AND NOT FIREABLE(C_refuse_2_3_1_1) AND NOT FIREABLE(C_refuse_3_3_1_1) AND NOT FIREABLE(C_refuse_1_1_2_2) AND NOT FIREABLE(C_refuse_2_1_2_2) AND NOT FIREABLE(C_refuse_3_1_2_2) AND NOT FIREABLE(C_refuse_1_2_2_2) AND NOT FIREABLE(C_refuse_2_2_2_2) AND NOT FIREABLE(C_refuse_3_2_2_2) AND NOT FIREABLE(C_refuse_1_3_2_2) AND NOT FIREABLE(C_refuse_2_3_2_2) AND NOT FIREABLE(C_refuse_3_3_2_2) AND NOT FIREABLE(C_refuse_1_1_3_3) AND NOT FIREABLE(C_refuse_2_1_3_3) AND NOT FIREABLE(C_refuse_3_1_3_3) AND NOT FIREABLE(C_refuse_1_2_3_3) AND NOT FIREABLE(C_refuse_2_2_3_3) AND NOT FIREABLE(C_refuse_3_2_3_3) AND NOT FIREABLE(C_refuse_1_3_3_3) AND NOT FIREABLE(C_refuse_2_3_3_3) AND NOT FIREABLE(C_refuse_3_3_3_3))))) : E (F (((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)) AND NOT FIREABLE(loss_a) AND (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3)) AND (FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3) OR ((FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3))) OR FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3))))) : A (G ((((NOT FIREABLE(C_refuse_3_1_1_1) AND NOT FIREABLE(C_provide_2_1_1)) OR NOT FIREABLE(I_reemit_2_3)) AND NOT FIREABLE(C_refuse_3_3_3_3)))) : E (F (((NOT FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1)) AND (NOT FIREABLE(C_refuse_3_1_1_1) OR NOT FIREABLE(I_reemit_2_1)) AND FIREABLE(C_refuse_3_3_1_1)))) : E (F (((FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(I_emit_2_2_1) OR (FIREABLE(Gto_2) AND FIREABLE(C_provide_1_3_3))) AND ((FIREABLE(C_free_1_1) AND FIREABLE(C_refuse_2_3_1_1)) OR (FIREABLE(C_refuse_1_2_1_1) AND FIREABLE(C_refuse_3_2_3_3))) AND (FIREABLE(C_refuse_3_3_1_1) OR NOT FIREABLE(I_ask2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(I_free_1_3))))) : E (F ((FIREABLE(I_free_3_2) AND (FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_rec1_2_2)) AND NOT FIREABLE(I_free_2_1)))) : E (F (FIREABLE(C_refuse_1_1_3_3))) : E (F ((NOT FIREABLE(I_ask1_1_3) AND FIREABLE(loss_m_3) AND FIREABLE(I_ask2_1_3) AND FIREABLE(C_refuse_3_2_2_2) AND NOT FIREABLE(I_ask1_3_1) AND (NOT FIREABLE(C_free_1_1) OR NOT FIREABLE(I_ask2_1_3) OR (NOT FIREABLE(I_reemit_3_1) AND NOT FIREABLE(C_refuse_3_2_1_1)))))) : E (F (FIREABLE(C_refuse_2_2_2_2))) : E (F ((FIREABLE(I_ask1_3_1) AND FIREABLE(I_ask2_1_3))))
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(C_refuse_1_1_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(C_refuse_1_1_3_3)))
lola: processed formula length: 34
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(C_refuse_1_1_3_3)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-03-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3960 markings, 9705 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-12 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: E (F (FIREABLE(C_refuse_2_2_2_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(C_refuse_2_2_2_2)))
lola: processed formula length: 34
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(C_refuse_2_2_2_2)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-03-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3960 markings, 9768 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(I_ask1_3_1) AND FIREABLE(I_ask2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(I_ask1_3_1) AND FIREABLE(I_ask2_1_3))))
lola: processed formula length: 55
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(I_ask1_3_1) AND FIREABLE(I_ask2_1_3))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-03-ReachabilityFireability-2-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 SafeBus-PT-03-ReachabilityFireability-15 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: E (F (((NOT FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1)) AND (NOT FIREABLE(C_refuse_3_1_1_1) OR NOT FIREABLE(I_reemit_2_1)) AND FIREABLE(C_refuse_3_3_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NOT FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1)) AND (NOT FIREABLE(C_refuse_3_1_1_1) OR NOT FIREABLE(I_reemit_2_1)) AND FIREABLE(C_refuse_3_3_1_1))))
lola: processed formula length: 172
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1)) AND (NOT FIREABLE(C_refuse_3_1_1_1) OR NOT FIREABLE(I_reemit_2_1)) AND FIREABLE(C_refuse_3_3_1_1))
lola: state equation: Generated DNF with 54 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-03-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3960 markings, 9734 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-9 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: A (G ((((NOT FIREABLE(C_refuse_3_1_1_1) AND NOT FIREABLE(C_provide_2_1_1)) OR NOT FIREABLE(I_reemit_2_3)) AND NOT FIREABLE(C_refuse_3_3_3_3))))
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(C_refuse_3_1_1_1) AND NOT FIREABLE(C_provide_2_1_1)) OR NOT FIREABLE(I_reemit_2_3)) AND NOT FIREABLE(C_refuse_3_3_3_3))))
lola: processed formula length: 144
lola: 2 rewrites
lola: closed formula file SafeBus-PT-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_provide_2_1_1)) AND FIREABLE(I_reemit_2_3)) OR FIREABLE(C_refuse_3_3_3_3))
lola: state equation: Generated DNF with 16 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-03-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3944 markings, 9664 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-8 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: E (F ((FIREABLE(I_free_3_2) AND (FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_rec1_2_2)) AND NOT FIREABLE(I_free_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(I_free_3_2) AND (FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_rec1_2_2)) AND NOT FIREABLE(I_free_2_1))))
lola: processed formula length: 142
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(I_free_3_2) AND (FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_rec1_2_2)) AND NOT FIREABLE(I_free_2_1))
lola: state equation: Generated DNF with 20 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-03-ReachabilityFireability-5-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 SafeBus-PT-03-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR (NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)) OR NOT FIREABLE(loss_a))))
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(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR (NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)) OR NOT FIREABLE(loss_a))))
lola: processed formula length: 194
lola: 2 rewrites
lola: closed formula file SafeBus-PT-03-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(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3) AND (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND FIREABLE(loss_a))
lola: state equation: Generated DNF with 168 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-03-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3834 markings, 8737 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-5 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 ((NOT FIREABLE(I_ask1_1_3) AND FIREABLE(loss_m_3) AND FIREABLE(I_ask2_1_3) AND FIREABLE(C_refuse_3_2_2_2) AND NOT FIREABLE(I_ask1_3_1) AND (NOT FIREABLE(C_free_1_1) OR NOT FIREABLE(I_ask2_1_3) OR (NOT FIREABLE(I_reemit_3_1) AND NOT FIREABLE(C_refuse_3_2_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(I_ask1_1_3) AND FIREABLE(loss_m_3) AND FIREABLE(I_ask2_1_3) AND FIREABLE(C_refuse_3_2_2_2) AND NOT FIREABLE(I_ask1_3_1) AND (NOT FIREABLE(C_free_1_1) OR NOT FIREABLE(I_ask2_1_3) OR (NOT FIREABLE(I_reemit_3_1) AND NOT FIREABLE(C_refuse_3_2_1_1))))))
lola: processed formula length: 270
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(I_ask1_1_3) AND FIREABLE(loss_m_3) AND FIREABLE(I_ask2_1_3) AND FIREABLE(C_refuse_3_2_2_2) AND NOT FIREABLE(I_ask1_3_1) AND (NOT FIREABLE(C_free_1_1) OR NOT FIREABLE(I_ask2_1_3) OR (NOT FIREABLE(I_reemit_3_1) AND NOT FIREABLE(C_refuse_3_2_1_1))))
lola: state equation: Generated DNF with 140 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-03-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1174 markings, 1446 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(I_emit_2_2_1) OR (FIREABLE(Gto_2) AND FIREABLE(C_provide_1_3_3))) AND ((FIREABLE(C_free_1_1) AND FIREABLE(C_refuse_2_3_1_1)) OR (FIREABLE(C_refuse_1_2_1_1) AND FIREABLE(C_refuse_3_2_3_3))) AND (FIREABLE(C_refuse_3_3_1_1) OR NOT FIREABLE(I_ask2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(I_free_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(I_emit_2_2_1) OR (FIREABLE(Gto_2) AND FIREABLE(C_provide_1_3_3))) AND ((FIREABLE(C_free_1_1) AND FIREABLE(C_refuse_2_3_1_1)) OR (FIREABLE(C_refuse_1_2_1_1) AND FIREABLE(C_refuse_3_2_3_3))) AND (FIREABLE(C_refuse_3_3_1_1) OR NOT FIREABLE(I_ask2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(I_free_1_3)))))
lola: processed formula length: 359
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(C_refuse_2_1_3_3) OR FIREABLE(I_emit_2_2_1) OR (FIREABLE(Gto_2) AND FIREABLE(C_provide_1_3_3))) AND ((FIREABLE(C_free_1_1) AND FIREABLE(C_refuse_2_3_1_1)) OR (FIREABLE(C_refuse_1_2_1_1) AND FIREABLE(C_refuse_3_2_3_3))) AND (FIREABLE(C_refuse_3_3_1_1) OR NOT FIREABLE(I_ask2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(I_free_1_3)))
lola: state equation: Generated DNF with 418 literals and 30 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-03-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3966 markings, 9753 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) AND (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREAB... (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(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) AND (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREAB... (shortened)
lola: processed formula length: 814
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) AND (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3)) AND (FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)) AND NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3919 markings, 9506 edges
lola:
FORMULA SafeBus-PT-03-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3) AND NOT FIREABLE(I_ask1_1_1) AND NOT FIREABLE(I_ask1_2_1) AND NOT FIREABLE(I_ask1_3_1) AND NOT FIREABLE(I_ask1_1_2) AND NOT FIREABLE(I_ask1_2_2) AND NOT FIREABLE(I_ask1_3_2) AND NOT FIREABLE(I_ask1_1_3) AND NOT FIREABLE(I_ask1_2_3) AND NOT FIREABLE(I_ask1_3_3) AND ((NOT FIREABLE(I_ask2_1_1) AND NOT FIREABLE(I... (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(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3) AND NOT FIREABLE(I_ask1_1_1) AND NOT FIREABLE(I_ask1_2_1) AND NOT FIREABLE(I_ask1_3_1) AND NOT FIREABLE(I_ask1_1_2) AND NOT FIREABLE(I_ask1_2_2) AND NOT FIREABLE(I_ask1_3_2) AND NOT FIREABLE(I_ask1_1_3) AND NOT FIREABLE(I_ask1_2_3) AND NOT FIREABLE(I_ask1_3_3) AND ((NOT FIREABLE(I_ask2_1_1) AND NOT FIREABLE(I... (shortened)
lola: processed formula length: 870
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3) AND NOT FIREABLE(I_ask1_1_1) AND NOT FIREABLE(I_ask1_2_1) AND NOT FIREABLE(I_ask1_3_1) AND NOT FIREABLE(I_ask1_1_2) AND NOT FIREABLE(I_ask1_2_2) AND NOT FIREABLE(I_ask1_3_2) AND NOT FIREABLE(I_ask1_1_3) AND NOT FIREABLE(I_ask1_2_3) AND NOT FIREABLE(I_ask1_3_3) AND ((NOT FIREABLE(I_ask2_1_1) AND NOT FIREABLE(I_ask2_2_1) AND NOT FIREABLE(I_ask2_3_1) AND NOT FIREABLE(I_ask2_1_2) AND NOT FIREABLE(I_ask2_2_2) AND NOT FIREABLE(I_ask2_3_2) AND NOT FIREABLE(I_ask2_1_3) AND NOT FIREABLE(I_ask2_2_3) AND NOT FIREABLE(I_ask2_3_3)) OR NOT FIREABLE(loss_a)) AND (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4318 markings, 10768 edges

FORMULA SafeBus-PT-03-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) AND (FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3)) AND ((NOT FIREABLE(C_provide_1_1_1) AND NOT FIREABLE(C_provide_2_1_1) AND NOT FIREABLE(C_provi... (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 (((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) AND (FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3)) AND ((NOT FIREABLE(C_provide_1_1_1) AND NOT FIREABLE(C_provide_2_1_1) AND NOT FIREABLE(C_provi... (shortened)
lola: processed formula length: 1078
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) AND (FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3)) AND ((NOT FIREABLE(C_provide_1_1_1) AND NOT FIREABLE(C_provide_2_1_1) AND NOT FIREABLE(C_provide_3_1_1) AND NOT FIREABLE(C_provide_1_2_2) AND NOT FIREABLE(C_provide_2_2_2) AND NOT FIREABLE(C_provide_3_2_2) AND NOT FIREABLE(C_provide_1_3_3) AND NOT FIREABLE(C_provide_2_3_3) AND NOT FIREABLE(C_provide_3_3_3)) OR (NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3))) AND (FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3) OR FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3) OR FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3) OR FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3876 markings, 9214 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-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 (((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND ((NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)) OR (NOT FIREABLE(loss_m_1) AND NOT FIREABLE(loss_m_2) AND NOT FIREABLE(loss_m_3))) AND (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_... (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 (((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND ((NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)) OR (NOT FIREABLE(loss_m_1) AND NOT FIREABLE(loss_m_2) AND NOT FIREABLE(loss_m_3))) AND (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_... (shortened)
lola: processed formula length: 978
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND ((NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)) OR (NOT FIREABLE(loss_m_1) AND NOT FIREABLE(loss_m_2) AND NOT FIREABLE(loss_m_3))) AND (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3) OR (FIREABLE(loss_a) AND (FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_reemit_1_3) OR FIREABLE(I_reemit_2_3))) OR (NOT FIREABLE(I_ask1_1_1) AND NOT FIREABLE(I_ask1_2_1) AND NOT FIREABLE(I_ask1_3_1) AND NOT FIREABLE(I_ask1_1_2) AND NOT FIREABLE(I_ask1_2_2) AND NOT FIREABLE(I_ask1_3_2) AND NOT FIREABLE(I_ask1_1_3) AND NOT FIREABLE(I_ask1_2_3) AND NOT FIREABLE(I_ask1_3_3))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4336 markings, 10383 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)) AND NOT FIREABLE(loss_a) AND (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_as... (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 (((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)) AND NOT FIREABLE(loss_a) AND (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_as... (shortened)
lola: processed formula length: 1031
lola: 1 rewrites
lola: closed formula file SafeBus-PT-03-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(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)) AND NOT FIREABLE(loss_a) AND (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3)) AND (FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3) OR ((FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3))) OR FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4175 markings, 10218 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR (NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3) AND NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)) OR (NOT FIREABLE(I_ask2_1_1) AND NOT FIREABLE(I_ask2_2_1) AND NOT FIREABLE(I_ask2_3_1) AND NOT FIREABLE(I_ask2_1_2) AND NOT FIREABLE(I_a... (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(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR (NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3) AND NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)) OR (NOT FIREABLE(I_ask2_1_1) AND NOT FIREABLE(I_ask2_2_1) AND NOT FIREABLE(I_ask2_3_1) AND NOT FIREABLE(I_ask2_1_2) AND NOT FIREABLE(I_a... (shortened)
lola: processed formula length: 1559
lola: 2 rewrites
lola: closed formula file SafeBus-PT-03-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(I_refused_1_1) AND NOT FIREABLE(I_refused_2_2) AND NOT FIREABLE(I_refused_3_3) AND (FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) AND (FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1_2_2) OR FIREABLE(C_refuse_3_1_2_2) OR FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(C_refuse_2_2_2_2) OR FIREABLE(C_refuse_3_2_2_2) OR FIREABLE(C_refuse_1_3_2_2) OR FIREABLE(C_refuse_2_3_2_2) OR FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(C_refuse_1_1_3_3) OR FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(C_refuse_3_1_3_3) OR FIREABLE(C_refuse_1_2_3_3) OR FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(C_refuse_2_3_3_3) OR FIREABLE(C_refuse_3_3_3_3)) AND NOT FIREABLE(I_refused_1_1) AND NOT FIREABLE(I_refused_2_2) AND NOT FIREABLE(I_refused_3_3))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3999 markings, 9607 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-3 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(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR ((FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3)) AND (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3))) OR (NO... (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(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR ((FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3)) AND (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3))) OR (NO... (shortened)
lola: processed formula length: 1989
lola: 2 rewrites
lola: closed formula file SafeBus-PT-03-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(I_refused_1_1) AND NOT FIREABLE(I_refused_2_2) AND NOT FIREABLE(I_refused_3_3) AND ((NOT FIREABLE(I_ask1_1_1) AND NOT FIREABLE(I_ask1_2_1) AND NOT FIREABLE(I_ask1_3_1) AND NOT FIREABLE(I_ask1_1_2) AND NOT FIREABLE(I_ask1_2_2) AND NOT FIREABLE(I_ask1_3_2) AND NOT FIREABLE(I_ask1_1_3) AND NOT FIREABLE(I_ask1_2_3) AND NOT FIREABLE(I_ask1_3_3)) OR (NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3))) AND (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3)) AND (FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)) AND (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) AND (FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1_2_2) OR FIREABLE(C_refuse_3_1_2_2) OR FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(C_refuse_2_2_2_2) OR FIREABLE(C_refuse_3_2_2_2) OR FIREABLE(C_refuse_1_3_2_2) OR FIREABLE(C_refuse_2_3_2_2) OR FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(C_refuse_1_1_3_3) OR FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(C_refuse_3_1_3_3) OR FIREABLE(C_refuse_1_2_3_3) OR FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(C_refuse_2_3_3_3) OR FIREABLE(C_refuse_3_3_3_3)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3965 markings, 9760 edges
lola: ========================================

FORMULA SafeBus-PT-03-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no yes yes no yes no no no no yes no no
lola:
preliminary result: no no no yes no yes yes no yes no no no no yes no no
lola: memory consumption: 14948 KB
lola: time consumption: 1 seconds

BK_STOP 1527026300119

--------------------
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="SafeBus-PT-03"
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/SafeBus-PT-03.tgz
mv SafeBus-PT-03 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 SafeBus-PT-03, 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 r148-smll-152685547200231"
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 ;