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 328K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 153K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SimpleLoadBal-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743000154
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527207357868

info: Time: 3600 - MCC
===========================================================================================
prep: translating SimpleLoadBal-PT-05 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 SimpleLoadBal-PT-05 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ SimpleLoadBal-PT-05 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 239/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 59
lola: finding significant places
lola: 59 places, 180 transitions, 40 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 301 transition conflict sets
lola: TASK
lola: reading formula from SimpleLoadBal-PT-05-ReachabilityFireability.task
lola: A (G ((FIREABLE(T-lb_idle_receive_notification_6) OR FIREABLE(T-lb_no_balance_14) OR NOT FIREABLE(T-lb_no_balance_8) OR (NOT FIREABLE(T-lb_balance_to_2_133) AND NOT FIREABLE(T-lb_route_to_2_64)) OR FIREABLE(T-lb_route_to_2_172) OR NOT FIREABLE(T-client_send_1)))) : E (F ((FIREABLE(T-lb_route_to_1_22) AND (FIREABLE(T-lb_balancing_receive_notification_10) OR FIREABLE(T-client_send_4)) AND FIREABLE(T-lb_balance_to_2_64) AND (FIREABLE(T-lb_route_to_1_116) OR (NOT FIREABLE(T-lb_route_to_1_52) AND NOT FIREABLE(T-lb_route_to_1_15)))))) : A (G ((FIREABLE(T-lb_receive_client_2) OR FIREABLE(T-lb_route_to_1_16) OR (FIREABLE(T-client_receive_4) AND FIREABLE(T-lb_no_balance_28)) OR NOT FIREABLE(T-lb_balance_to_2_132) OR NOT FIREABLE(T-lb_route_to_1_2) OR FIREABLE(T-lb_balancing_receive_notification_11)))) : E (F ((FIREABLE(T-lb_route_to_1_146) AND FIREABLE(T-lb_balance_to_1_85) AND (FIREABLE(T-lb_idle_receive_notification_3) OR (NOT FIREABLE(T-server_endloop_2) AND NOT FIREABLE(T-client_send_2)))))) : E (F ((NOT FIREABLE(T-lb_route_to_1_117) AND NOT FIREABLE(T-lb_route_to_2_100) AND FIREABLE(T-lb_route_to_2_136) AND FIREABLE(T-lb_idle_receive_notification_10) AND FIREABLE(T-lb_balance_to_1_119)))) : E (F ((((FIREABLE(T-lb_route_to_1_87) OR FIREABLE(T-lb_balance_to_2_98) OR FIREABLE(T-lb_balancing_receive_notification_9)) AND FIREABLE(T-lb_route_to_2_71)) OR (FIREABLE(T-lb_balance_to_2_135) AND (FIREABLE(T-lb_balancing_receive_notification_3) OR (FIREABLE(T-lb_balance_to_1_81) AND FIREABLE(T-lb_balance_to_2_170))))))) : E (F (FIREABLE(T-lb_balancing_receive_notification_5))) : A (G (((FIREABLE(T-lb_balancing_receive_notification_9) AND FIREABLE(T-lb_balance_to_1_12) AND FIREABLE(T-lb_balance_to_2_63) AND FIREABLE(T-lb_balancing_receive_notification_6) AND FIREABLE(T-lb_no_balance_35) AND FIREABLE(T-lb_balance_to_2_132)) OR (NOT FIREABLE(T-lb_route_to_2_21) AND NOT FIREABLE(T-lb_route_to_1_138))))) : A (G ((NOT FIREABLE(T-lb_balancing_receive_notification_6) OR NOT FIREABLE(T-lb_balance_to_2_166) OR (NOT FIREABLE(T-lb_route_to_1_95) AND NOT FIREABLE(T-client_receive_5)) OR NOT FIREABLE(T-lb_route_to_1_102)))) : E (F ((((NOT FIREABLE(T-lb_route_to_1_94) AND NOT FIREABLE(T-lb_route_to_1_137)) OR NOT FIREABLE(T-lb_balance_to_1_48)) AND FIREABLE(T-lb_route_to_1_58)))) : E (F (FIREABLE(T-lb_no_balance_36))) : E (F (FIREABLE(T-lb_balance_to_1_83))) : E (F ((FIREABLE(T-lb_idle_receive_notification_8) AND FIREABLE(T-lb_no_balance_35) AND FIREABLE(T-lb_receive_client_3)))) : E (F ((FIREABLE(T-lb_balance_to_2_132) AND FIREABLE(T-server_process_10) AND NOT FIREABLE(T-lb_no_balance_36)))) : E (F ((FIREABLE(T-lb_idle_receive_notification_2) AND FIREABLE(T-client_receive_5) AND (FIREABLE(T-lb_balance_to_1_85) OR FIREABLE(T-server_endloop_1) OR FIREABLE(T-lb_route_to_1_9)) AND (FIREABLE(T-lb_route_to_1_51) OR (FIREABLE(T-lb_route_to_1_94) AND FIREABLE(T-lb_balance_to_2_61) AND (FIREABLE(T-lb_route_to_1_131) OR FIREABLE(T-lb_route_to_1_117))))))) : A (G ((NOT FIREABLE(T-lb_route_to_2_179) OR NOT FIREABLE(T-lb_balancing_receive_notification_9) OR (FIREABLE(T-lb_route_to_1_59) AND FIREABLE(T-server_process_4) AND NOT FIREABLE(T-lb_no_balance_1)) OR (FIREABLE(T-lb_route_to_1_173) AND (FIREABLE(T-lb_route_to_1_138) OR FIREABLE(T-lb_no_balance_15)) AND (NOT FIREABLE(T-lb_balance_to_2_63) OR NOT FIREABLE(T-lb_balance_to_1_11))))))
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(T-lb_balancing_receive_notification_5)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(T-lb_balancing_receive_notification_5)))
lola: processed formula length: 55
lola: 1 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_balancing_receive_notification_5)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25774 markings, 40915 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(T-lb_no_balance_36)))
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(T-lb_no_balance_36)))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_no_balance_36)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-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 SimpleLoadBal-PT-05-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(T-lb_balance_to_1_83)))
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(T-lb_balance_to_1_83)))
lola: processed formula length: 38
lola: 1 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_balance_to_1_83)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 72)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 98157 markings, 284605 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-lb_idle_receive_notification_8) AND FIREABLE(T-lb_no_balance_35) AND FIREABLE(T-lb_receive_client_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(T-lb_idle_receive_notification_8) AND FIREABLE(T-lb_no_balance_35) AND FIREABLE(T-lb_receive_client_3))))
lola: processed formula length: 121
lola: 1 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_idle_receive_notification_8) AND FIREABLE(T-lb_no_balance_35) AND FIREABLE(T-lb_receive_client_3))
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-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: 92791 markings, 238451 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-lb_balance_to_2_132) AND FIREABLE(T-server_process_10) AND NOT FIREABLE(T-lb_no_balance_36))))
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(T-lb_balance_to_2_132) AND FIREABLE(T-server_process_10) AND NOT FIREABLE(T-lb_no_balance_36))))
lola: processed formula length: 112
lola: 1 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_balance_to_2_132) AND FIREABLE(T-server_process_10) AND NOT FIREABLE(T-lb_no_balance_36))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-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 reachable.
lola: 43599 markings, 76523 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(T-lb_route_to_1_94) AND NOT FIREABLE(T-lb_route_to_1_137)) OR NOT FIREABLE(T-lb_balance_to_1_48)) AND FIREABLE(T-lb_route_to_1_58))))
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(T-lb_route_to_1_94) AND NOT FIREABLE(T-lb_route_to_1_137)) OR NOT FIREABLE(T-lb_balance_to_1_48)) AND FIREABLE(T-lb_route_to_1_58))))
lola: processed formula length: 156
lola: 1 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_route_to_1_94) AND NOT FIREABLE(T-lb_route_to_1_137)) OR NOT FIREABLE(T-lb_balance_to_1_48)) AND FIREABLE(T-lb_route_to_1_58))
lola: state equation: Generated DNF with 27 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9468 markings, 11713 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T-lb_balancing_receive_notification_6) OR NOT FIREABLE(T-lb_balance_to_2_166) OR (NOT FIREABLE(T-lb_route_to_1_95) AND NOT FIREABLE(T-client_receive_5)) OR NOT FIREABLE(T-lb_route_to_1_102))))
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(T-lb_balancing_receive_notification_6) OR NOT FIREABLE(T-lb_balance_to_2_166) OR (NOT FIREABLE(T-lb_route_to_1_95) AND NOT FIREABLE(T-client_receive_5)) OR NOT FIREABLE(T-lb_route_to_1_102))))
lola: processed formula length: 215
lola: 2 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_balancing_receive_notification_6) AND FIREABLE(T-lb_balance_to_2_166) AND (FIREABLE(T-lb_route_to_1_95) OR FIREABLE(T-client_receive_5)) AND FIREABLE(T-lb_route_to_1_102))
lola: state equation: Generated DNF with 25 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-8 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(T-lb_route_to_1_117) AND NOT FIREABLE(T-lb_route_to_2_100) AND FIREABLE(T-lb_route_to_2_136) AND FIREABLE(T-lb_idle_receive_notification_10) AND FIREABLE(T-lb_balance_to_1_119))))
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(T-lb_route_to_1_117) AND NOT FIREABLE(T-lb_route_to_2_100) AND FIREABLE(T-lb_route_to_2_136) AND FIREABLE(T-lb_idle_receive_notification_10) AND FIREABLE(T-lb_balance_to_1_119))))
lola: processed formula length: 199
lola: 1 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_route_to_1_117) AND NOT FIREABLE(T-lb_route_to_2_100) AND FIREABLE(T-lb_route_to_2_136) AND FIREABLE(T-lb_idle_receive_notification_10) AND FIREABLE(T-lb_balance_to_1_119))
lola: state equation: Generated DNF with 24 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-7-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 SimpleLoadBal-PT-05-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-lb_route_to_1_146) AND FIREABLE(T-lb_balance_to_1_85) AND (FIREABLE(T-lb_idle_receive_notification_3) OR (NOT FIREABLE(T-server_endloop_2) AND NOT FIREABLE(T-client_send_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(T-lb_route_to_1_146) AND FIREABLE(T-lb_balance_to_1_85) AND (FIREABLE(T-lb_idle_receive_notification_3) OR (NOT FIREABLE(T-server_endloop_2) AND NOT FIREABLE(T-client_send_2))))))
lola: processed formula length: 196
lola: 1 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_route_to_1_146) AND FIREABLE(T-lb_balance_to_1_85) AND (FIREABLE(T-lb_idle_receive_notification_3) OR (NOT FIREABLE(T-server_endloop_2) AND NOT FIREABLE(T-client_send_2))))
lola: state equation: Generated DNF with 28 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T-lb_idle_receive_notification_6) OR FIREABLE(T-lb_no_balance_14) OR NOT FIREABLE(T-lb_no_balance_8) OR (NOT FIREABLE(T-lb_balance_to_2_133) AND NOT FIREABLE(T-lb_route_to_2_64)) OR FIREABLE(T-lb_route_to_2_172) OR NOT FIREABLE(T-client_send_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(T-lb_idle_receive_notification_6) OR FIREABLE(T-lb_no_balance_14) OR NOT FIREABLE(T-lb_no_balance_8) OR (NOT FIREABLE(T-lb_balance_to_2_133) AND NOT FIREABLE(T-lb_route_to_2_64)) OR FIREABLE(T-lb_route_to_2_172) OR NOT FIREABLE(T-client_send_1))))
lola: processed formula length: 268
lola: 2 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_idle_receive_notification_6) AND NOT FIREABLE(T-lb_no_balance_14) AND FIREABLE(T-lb_no_balance_8) AND (FIREABLE(T-lb_balance_to_2_133) OR FIREABLE(T-lb_route_to_2_64)) AND NOT FIREABLE(T-lb_route_to_2_172) AND FIREABLE(T-client_send_1))
lola: state equation: Generated DNF with 96 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-9-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: 105780 markings, 318253 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-lb_route_to_1_22) AND (FIREABLE(T-lb_balancing_receive_notification_10) OR FIREABLE(T-client_send_4)) AND FIREABLE(T-lb_balance_to_2_64) AND (FIREABLE(T-lb_route_to_1_116) OR (NOT FIREABLE(T-lb_route_to_1_52) AND NOT FIREABLE(T-lb_route_to_1_15))))))
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(T-lb_route_to_1_22) AND (FIREABLE(T-lb_balancing_receive_notification_10) OR FIREABLE(T-client_send_4)) AND FIREABLE(T-lb_balance_to_2_64) AND (FIREABLE(T-lb_route_to_1_116) OR (NOT FIREABLE(T-lb_route_to_1_52) AND NOT FIREABLE(T-lb_route_to_1_15))))))
lola: processed formula length: 270
lola: 1 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_route_to_1_22) AND (FIREABLE(T-lb_balancing_receive_notification_10) OR FIREABLE(T-client_send_4)) AND FIREABLE(T-lb_balance_to_2_64) AND (FIREABLE(T-lb_route_to_1_116) OR (NOT FIREABLE(T-lb_route_to_1_52) AND NOT FIREABLE(T-lb_route_to_1_15))))
lola: state equation: Generated DNF with 46 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-10-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: 112932 markings, 398105 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T-lb_receive_client_2) OR FIREABLE(T-lb_route_to_1_16) OR (FIREABLE(T-client_receive_4) AND FIREABLE(T-lb_no_balance_28)) OR NOT FIREABLE(T-lb_balance_to_2_132) OR NOT FIREABLE(T-lb_route_to_1_2) OR FIREABLE(T-lb_balancing_receive_notification_11))))
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(T-lb_receive_client_2) OR FIREABLE(T-lb_route_to_1_16) OR (FIREABLE(T-client_receive_4) AND FIREABLE(T-lb_no_balance_28)) OR NOT FIREABLE(T-lb_balance_to_2_132) OR NOT FIREABLE(T-lb_route_to_1_2) OR FIREABLE(T-lb_balancing_receive_notification_11))))
lola: processed formula length: 271
lola: 2 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_receive_client_2) AND NOT FIREABLE(T-lb_route_to_1_16) AND (NOT FIREABLE(T-client_receive_4) OR NOT FIREABLE(T-lb_no_balance_28)) AND FIREABLE(T-lb_balance_to_2_132) AND FIREABLE(T-lb_route_to_1_2) AND NOT FIREABLE(T-lb_balancing_receive_notification_11))
lola: state equation: Generated DNF with 264 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(T-lb_route_to_1_87) OR FIREABLE(T-lb_balance_to_2_98) OR FIREABLE(T-lb_balancing_receive_notification_9)) AND FIREABLE(T-lb_route_to_2_71)) OR (FIREABLE(T-lb_balance_to_2_135) AND (FIREABLE(T-lb_balancing_receive_notification_3) OR (FIREABLE(T-lb_balance_to_1_81) AND FIREABLE(T-lb_balance_to_2_170)))))))
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(T-lb_route_to_1_87) OR FIREABLE(T-lb_balance_to_2_98) OR FIREABLE(T-lb_balancing_receive_notification_9)) AND FIREABLE(T-lb_route_to_2_71)) OR (FIREABLE(T-lb_balance_to_2_135) AND (FIREABLE(T-lb_balancing_receive_notification_3) OR (FIREABLE(T-lb_balance_to_1_81) AND FIREABLE(T-lb_balance_to_2_170)))))))
lola: processed formula length: 327
lola: 1 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_route_to_1_87) OR FIREABLE(T-lb_balance_to_2_98) OR FIREABLE(T-lb_balancing_receive_notification_9)) AND FIREABLE(T-lb_route_to_2_71)) OR (FIREABLE(T-lb_balance_to_2_135) AND (FIREABLE(T-lb_balancing_receive_notification_3) OR (FIREABLE(T-lb_balance_to_1_81) AND FIREABLE(T-lb_balance_to_2_170)))))
lola: state equation: Generated DNF with 38 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-12-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: 108131 markings, 347595 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(T-lb_balancing_receive_notification_9) AND FIREABLE(T-lb_balance_to_1_12) AND FIREABLE(T-lb_balance_to_2_63) AND FIREABLE(T-lb_balancing_receive_notification_6) AND FIREABLE(T-lb_no_balance_35) AND FIREABLE(T-lb_balance_to_2_132)) OR (NOT FIREABLE(T-lb_route_to_2_21) AND NOT FIREABLE(T-lb_route_to_1_138)))))
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(T-lb_balancing_receive_notification_9) AND FIREABLE(T-lb_balance_to_1_12) AND FIREABLE(T-lb_balance_to_2_63) AND FIREABLE(T-lb_balancing_receive_notification_6) AND FIREABLE(T-lb_no_balance_35) AND FIREABLE(T-lb_balance_to_2_132)) OR (NOT FIREABLE(T-lb_route_to_2_21) AND NOT FIREABLE(T-lb_route_to_1_138)))))
lola: processed formula length: 327
lola: 2 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_balancing_receive_notification_9) OR NOT FIREABLE(T-lb_balance_to_1_12) OR NOT FIREABLE(T-lb_balance_to_2_63) OR NOT FIREABLE(T-lb_balancing_receive_notification_6) OR NOT FIREABLE(T-lb_no_balance_35) OR NOT FIREABLE(T-lb_balance_to_2_132)) AND (FIREABLE(T-lb_route_to_2_21) OR FIREABLE(T-lb_route_to_1_138)))
lola: state equation: Generated DNF with 152 literals and 38 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 246 markings, 287 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-lb_idle_receive_notification_2) AND FIREABLE(T-client_receive_5) AND (FIREABLE(T-lb_balance_to_1_85) OR FIREABLE(T-server_endloop_1) OR FIREABLE(T-lb_route_to_1_9)) AND (FIREABLE(T-lb_route_to_1_51) OR (FIREABLE(T-lb_route_to_1_94) AND FIREABLE(T-lb_balance_to_2_61) AND (FIREABLE(T-lb_route_to_1_131) OR FIREABLE(T-lb_route_to_1_117)))))))
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(T-lb_idle_receive_notification_2) AND FIREABLE(T-client_receive_5) AND (FIREABLE(T-lb_balance_to_1_85) OR FIREABLE(T-server_endloop_1) OR FIREABLE(T-lb_route_to_1_9)) AND (FIREABLE(T-lb_route_to_1_51) OR (FIREABLE(T-lb_route_to_1_94) AND FIREABLE(T-lb_balance_to_2_61) AND (FIREABLE(T-lb_route_to_1_131) OR FIREABLE(T-lb_route_to_1_117)))))))
lola: processed formula length: 362
lola: 1 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_idle_receive_notification_2) AND FIREABLE(T-client_receive_5) AND (FIREABLE(T-lb_balance_to_1_85) OR FIREABLE(T-server_endloop_1) OR FIREABLE(T-lb_route_to_1_9)) AND (FIREABLE(T-lb_route_to_1_51) OR (FIREABLE(T-lb_route_to_1_94) AND FIREABLE(T-lb_balance_to_2_61) AND (FIREABLE(T-lb_route_to_1_131) OR FIREABLE(T-lb_route_to_1_117)))))
lola: state equation: Generated DNF with 141 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-14-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: 90141 markings, 254799 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T-lb_route_to_2_179) OR NOT FIREABLE(T-lb_balancing_receive_notification_9) OR (FIREABLE(T-lb_route_to_1_59) AND FIREABLE(T-server_process_4) AND NOT FIREABLE(T-lb_no_balance_1)) OR (FIREABLE(T-lb_route_to_1_173) AND (FIREABLE(T-lb_route_to_1_138) OR FIREABLE(T-lb_no_balance_15)) AND (NOT FIREABLE(T-lb_balance_to_2_63) OR NOT FIREABLE(T-lb_balance_to_1_11))))))
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(T-lb_route_to_2_179) OR NOT FIREABLE(T-lb_balancing_receive_notification_9) OR (FIREABLE(T-lb_route_to_1_59) AND FIREABLE(T-server_process_4) AND NOT FIREABLE(T-lb_no_balance_1)) OR (FIREABLE(T-lb_route_to_1_173) AND (FIREABLE(T-lb_route_to_1_138) OR FIREABLE(T-lb_no_balance_15)) AND (NOT FIREABLE(T-lb_balance_to_2_63) OR NOT FIREABLE(T-lb_balance_to_1_11))))))
lola: processed formula length: 388
lola: 2 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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(T-lb_route_to_2_179) AND FIREABLE(T-lb_balancing_receive_notification_9) AND (NOT FIREABLE(T-lb_route_to_1_59) OR NOT FIREABLE(T-server_process_4) OR FIREABLE(T-lb_no_balance_1)) AND (NOT FIREABLE(T-lb_route_to_1_173) OR (NOT FIREABLE(T-lb_route_to_1_138) AND NOT FIREABLE(T-lb_no_balance_15)) OR (FIREABLE(T-lb_balance_to_2_63) AND FIREABLE(T-lb_balance_to_1_11))))
lola: state equation: Generated DNF with 260 literals and 25 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-ReachabilityFireability-15-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: 103676 markings, 311856 edges
lola:
FORMULA SimpleLoadBal-PT-05-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no yes no yes yes no no no yes no yes
lola:
preliminary result: yes no yes no no no yes no yes yes no no no yes no yes
========================================
lola: memory consumption: 14772 KB
lola: time consumption: 13 seconds

BK_STOP 1527207371222

--------------------
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="SimpleLoadBal-PT-05"
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/SimpleLoadBal-PT-05.tgz
mv SimpleLoadBal-PT-05 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 SimpleLoadBal-PT-05, 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 r172-smll-152708743000154"
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 ;