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)
...........
=====================================================================
Generated by BenchKit 2-2979
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 r122kn-qhx2-146373367700063
=====================================================================

--------------------
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-COL-05-ReachabilityFireability-0
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-1
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-10
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-11
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-12
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-13
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-14
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-15
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-2
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-3
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-4
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-5
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-6
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-7
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-8
FORMULA_NAME SimpleLoadBal-COL-05-ReachabilityFireability-9

=== Now, execution of the tool begins

BK_START 1463734233257

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ SimpleLoadBal-PT-05
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-05-ReachabilityFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 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: 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-COL-05-ReachabilityFireability.task
lola: read: EF ((((!((FIREABLE(T-server_endloop_1) OR FIREABLE(T-server_endloop_2))) AND ((((((((((FIREABLE(T-lb_balancing_receive_notification_2) OR FIREABLE(T-lb_balancing_receive_notification_3)) OR FIREABLE(T-lb_balancing_receive_notification_4)) OR FIREABLE(T-lb_balancing_receive_notification_5)) OR FIREABLE(T-lb_balancing_receive_notification_6)) OR FIREABLE(T-lb_balancing_receive_notification_8)) OR FI... (shortened)
lola: formula length: 32654
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T-server_endloop_1) AND (! FIREABLE(T-server_endloop_2) AND ((FIREABLE(T-lb_balancing_receive_notification_2) OR (FIREABLE(T-lb_balancing_receive_notification_3) OR (FIREABLE(T-lb_balancing_receive_notification_4) OR (FIREABLE(T-lb_balancing_receive_notification_5) OR (FIREABLE(T-lb_balancing_receive_notification_6) OR (FIREABLE(T-lb_balancing_receive_notification_8) OR (FIREABLE(T... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 22328 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T-lb_receive_client_1) AND (! FIREABLE(T-lb_receive_client_2) AND (! FIREABLE(T-lb_receive_client_3) AND (! FIREABLE(T-lb_receive_client_4) AND (! FIREABLE(T-lb_receive_client_5) AND (! FIREABLE(T-server_process_1) AND (! FIREABLE(T-server_process_2) AND (! FIREABLE(T-server_process_3) AND (! FIREABLE(T-server_process_4) AND (! FIREABLE(T-server_process_5) AND (! FIREABLE(T-server_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4227858320 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T-client_send_1) AND (! FIREABLE(T-client_send_2) AND (! FIREABLE(T-client_send_3) AND (! FIREABLE(T-client_send_4) AND (! FIREABLE(T-client_send_5) AND ((FIREABLE(T-lb_receive_client_1) OR (FIREABLE(T-lb_receive_client_2) OR (FIREABLE(T-lb_receive_client_3) OR (FIREABLE(T-lb_receive_client_4) OR FIREABLE(T-lb_receive_client_5))))) AND (FIREABLE(T-lb_balancing_receive_notification_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 320 literals
lola: write sara problem file to SimpleLoadBal-COL-05-ReachabilityFireability-2.sara
lola: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-05-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-lb_balance_to_1_11) OR (FIREABLE(T-lb_balance_to_1_12) OR (FIREABLE(T-lb_balance_to_1_13) OR (FIREABLE(T-lb_balance_to_1_14) OR (FIREABLE(T-lb_balance_to_1_15) OR (FIREABLE(T-lb_balance_to_1_46) OR (FIREABLE(T-lb_balance_to_1_47) OR (FIREABLE(T-lb_balance_to_1_48) OR (FIREABLE(T-lb_balance_to_1_49) OR (FIREABLE(T-lb_balance_to_1_50) OR (FIREABLE(T-lb_balance_to_1_81) OR (FIREABLE(T... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 80 literals
lola: write sara problem file to SimpleLoadBal-COL-05-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-05-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-lb_balance_to_2_61) OR (FIREABLE(T-lb_balance_to_2_62) OR (FIREABLE(T-lb_balance_to_2_63) OR (FIREABLE(T-lb_balance_to_2_64) OR (FIREABLE(T-lb_balance_to_2_65) OR (FIREABLE(T-lb_balance_to_2_96) OR (FIREABLE(T-lb_balance_to_2_97) OR (FIREABLE(T-lb_balance_to_2_98) OR (FIREABLE(T-lb_balance_to_2_99) OR (FIREABLE(T-lb_balance_to_2_100) OR (FIREABLE(T-lb_balance_to_2_131) OR (FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 80 literals
lola: write sara problem file to SimpleLoadBal-COL-05-ReachabilityFireability-4.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-server_endloop_1) AND ! FIREABLE(T-server_endloop_2)) OR (! FIREABLE(T-server_notify_1) AND ! FIREABLE(T-server_notify_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 12 literals
lola: write sara problem file to SimpleLoadBal-COL-05-ReachabilityFireability-5.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(T-lb_route_to_1_1) OR (FIREABLE(T-lb_route_to_1_2) OR (FIREABLE(T-lb_route_to_1_8) OR (FIREABLE(T-lb_route_to_1_9) OR (FIREABLE(T-lb_route_to_1_15) OR (FIREABLE(T-lb_route_to_1_16) OR (FIREABLE(T-lb_route_to_1_22) OR (FIREABLE(T-lb_route_to_1_23) OR (FIREABLE(T-lb_route_to_1_29) OR (FIREABLE(T-lb_route_to_1_30) OR (FIREABLE(T-lb_route_to_1_37) OR (FIREABLE(T-lb_route_to_1_38) OR (F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-lb_balancing_receive_notification_2) OR (FIREABLE(T-lb_balancing_receive_notification_3) OR (FIREABLE(T-lb_balancing_receive_notification_4) OR (FIREABLE(T-lb_balancing_receive_notification_5) OR (FIREABLE(T-lb_balancing_receive_notification_6) OR (FIREABLE(T-lb_balancing_receive_notification_8) OR (FIREABLE(T-lb_balancing_receive_notification_9) OR (FIREABLE(T-lb_balancing_receive... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 30 literals
lola: write sara problem file to SimpleLoadBal-COL-05-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((((! FIREABLE(T-lb_route_to_1_1) AND (! FIREABLE(T-lb_route_to_1_2) AND (! FIREABLE(T-lb_route_to_1_8) AND (! FIREABLE(T-lb_route_to_1_9) AND (! FIREABLE(T-lb_route_to_1_15) AND (! FIREABLE(T-lb_route_to_1_16) AND (! FIREABLE(T-lb_route_to_1_22) AND (! FIREABLE(T-lb_route_to_1_23) AND (! FIREABLE(T-lb_route_to_1_29) AND (! FIREABLE(T-lb_route_to_1_30) AND (! FIREABLE(T-lb_route_to_1_37) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 9073483564363970834238860853276782052245504 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-server_process_1) AND (! FIREABLE(T-server_process_2) AND (! FIREABLE(T-server_process_3) AND (! FIREABLE(T-server_process_4) AND (! FIREABLE(T-server_process_5) AND (! FIREABLE(T-server_process_6) AND (! FIREABLE(T-server_process_7) AND (! FIREABLE(T-server_process_8) AND (! FIREABLE(T-server_process_9) AND ! FIREABLE(T-server_process_10)))))))))) OR ((! FIREABLE(T-lb_idle_rece... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 36943590746485904 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(T-lb_receive_client_1) OR (FIREABLE(T-lb_receive_client_2) OR (FIREABLE(T-lb_receive_client_3) OR (FIREABLE(T-lb_receive_client_4) OR (FIREABLE(T-lb_receive_client_5) OR (! FIREABLE(T-client_receive_1) AND (! FIREABLE(T-client_receive_2) AND (! FIREABLE(T-client_receive_3) AND (! FIREABLE(T-client_receive_4) AND ! FIREABLE(T-client_receive_5)))))))))) AND (FIREABLE(T-lb_balancing_r... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 5558176 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-server_notify_1) AND ! FIREABLE(T-server_notify_2)) OR ((! FIREABLE(T-server_process_1) AND (! FIREABLE(T-server_process_2) AND (! FIREABLE(T-server_process_3) AND (! FIREABLE(T-server_process_4) AND (! FIREABLE(T-server_process_5) AND (! FIREABLE(T-server_process_6) AND (! FIREABLE(T-server_process_7) AND (! FIREABLE(T-server_process_8) AND (! FIREABLE(T-server_process_9) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3878 literals
lola: write sara problem file to SimpleLoadBal-COL-05-ReachabilityFireability-11.sara
lola: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-05-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-lb_idle_receive_notification_2) AND (! FIREABLE(T-lb_idle_receive_notification_3) AND (! FIREABLE(T-lb_idle_receive_notification_4) AND (! FIREABLE(T-lb_idle_receive_notification_5) AND (! FIREABLE(T-lb_idle_receive_notification_6) AND (! FIREABLE(T-lb_idle_receive_notification_8) AND (! FIREABLE(T-lb_idle_receive_notification_9) AND (! FIREABLE(T-lb_idle_receive_notification_10... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(T-client_send_1) AND (! FIREABLE(T-client_send_2) AND (! FIREABLE(T-client_send_3) AND (! FIREABLE(T-client_send_4) AND ! FIREABLE(T-client_send_5))))) OR (! FIREABLE(T-server_notify_1) AND ! FIREABLE(T-server_notify_2))) AND (((! FIREABLE(T-lb_idle_receive_notification_2) AND (! FIREABLE(T-lb_idle_receive_notification_3) AND (! FIREABLE(T-lb_idle_receive_notification_4) AND (! F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 24779480 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-lb_idle_receive_notification_2) OR (FIREABLE(T-lb_idle_receive_notification_3) OR (FIREABLE(T-lb_idle_receive_notification_4) OR (FIREABLE(T-lb_idle_receive_notification_5) OR (FIREABLE(T-lb_idle_receive_notification_6) OR (FIREABLE(T-lb_idle_receive_notification_8) OR (FIREABLE(T-lb_idle_receive_notification_9) OR (FIREABLE(T-lb_idle_receive_notification_10) OR (FIREABLE(T-lb_idl... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1500 literals
lola: write sara problem file to SimpleLoadBal-COL-05-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-05-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-server_process_1) OR (FIREABLE(T-server_process_2) OR (FIREABLE(T-server_process_3) OR (FIREABLE(T-server_process_4) OR (FIREABLE(T-server_process_5) OR (FIREABLE(T-server_process_6) OR (FIREABLE(T-server_process_7) OR (FIREABLE(T-server_process_8) OR (FIREABLE(T-server_process_9) OR FIREABLE(T-server_process_10)))))))))) AND (FIREABLE(T-lb_balancing_receive_notification_2) OR (FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 500 literals
lola: write sara problem file to SimpleLoadBal-COL-05-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: yes yes no yes yes no no yes yes no no no no no no yes
lola: ========================================

BK_STOP 1463734239261

--------------------
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="/home/fko/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

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
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 r122kn-qhx2-146373367700063"
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 ;