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-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122kn-qhx2-146373367800070
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463737288108

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ SimpleLoadBal-PT-10
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-10-ReachabilityCardinality-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: 709/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 104 places, 605 transitions, 75 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 991 transition conflict sets
lola: TASK
lola: reading formula from SimpleLoadBal-COL-10-ReachabilityCardinality.task
lola: read: EF ((P-server_notification_1 + P-server_notification_2 <= P-server_notification_1 + P-server_notification_2 AND !((P-server_waiting_1 + P-server_waiting_2 <= P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_1_2 + P-lb_load_1_3 + P-lb_load_1_4 + P-lb_load_1_5 + P-lb_load_1_6 + P-lb_load_1_7 + P-lb_load_1_8 + P-lb_load_1_9 + P-lb_load_1_10 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_2_3 + P... (shortened)
lola: formula length: 8743
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 (-P-lb_load_2_9 + -P-lb_load_1_10 + -P-lb_load_2_8 + -P-lb_load_2_7 + -P-lb_load_2_6 + -P-lb_load_2_5 + -P-lb_load_2_4 + -P-lb_load_2_3 + -P-lb_load_2_2 + -P-lb_load_2_1 + -P-lb_load_2_0 + -P-lb_load_1_9 + -P-lb_load_1_8 + -P-lb_load_1_7 + -P-lb_load_1_6 + -P-lb_load_1_5 + -P-lb_load_1_4 + -P-lb_load_1_3 + -P-lb_load_1_2 + -P-lb_load_1_1 + -P-lb_load_1_0 + P-server_waiting_2 + P-server_waiting_... (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 12 bytes per marking, with 21 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 1 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P-server_notification_ack_2 + P-server_notification_ack_1 + -P-client_idle_10 + -P-client_idle_9 + -P-client_idle_8 + -P-client_idle_7 + -P-client_idle_6 + -P-client_idle_5 + -P-client_idle_4 + -P-client_idle_3 + -P-client_idle_2 + -P-client_idle_1 <= 0 OR (P-client_ack_10 + -P-lb_balancing_1 + P-client_ack_9 + P-client_ack_8 + P-client_ack_7 + P-client_ack_6 + P-client_ack_5 + P-client_ack_4... (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 12 bytes per marking, with 21 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 3 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-P-server_notification_ack_2 + -P-server_notification_ack_1 + P-lb_idle_1 <= 0 AND -P-server_notification_ack_2 + -P-server_notification_ack_1 <= -2) OR ((-P-server_notification_2 + -P-server_notification_1 <= -3 AND P-lb_load_2_9 + P-lb_load_1_10 + P-lb_load_2_8 + P-lb_load_2_7 + P-lb_load_2_6 + P-lb_load_2_5 + P-lb_load_2_4 + P-lb_load_2_3 + P-lb_load_2_2 + P-lb_load_2_1 + P-lb_load_2_0 + ... (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 12 bytes per marking, with 21 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 5 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-2.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-P-client_ack_10 + P-server_notification_2 + P-server_notification_1 + -P-client_ack_9 + -P-client_ack_8 + -P-client_ack_7 + -P-client_ack_6 + -P-client_ack_5 + -P-client_ack_4 + -P-client_ack_3 + -P-client_ack_2 + -P-client_ack_1 <= 0 AND P-lb_idle_1 + -P-client_idle_10 + -P-client_idle_9 + -P-client_idle_8 + -P-client_idle_7 + -P-client_idle_6 + -P-client_idle_5 + -P-client_idle_4 + -P-cli... (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 12 bytes per marking, with 21 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 10 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P-client_ack_10 + -P-lb_idle_1 + P-client_ack_9 + P-client_ack_8 + P-client_ack_7 + P-client_ack_6 + P-client_ack_5 + P-client_ack_4 + P-client_ack_3 + P-client_ack_2 + P-client_ack_1 > 0 OR (-P-server_waiting_2 + -P-server_waiting_1 > -3 OR (-P-lb_balancing_1 > -1 AND -P-server_idle_2 + -P-server_idle_1 + P-client_request_10 + P-client_request_7 + P-client_request_6 + P-client_request_5 + P-... (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 12 bytes per marking, with 21 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 6 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-10-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-P-lb_balancing_1 + P-client_idle_10 + P-client_idle_9 + P-client_idle_8 + P-client_idle_7 + P-client_idle_6 + P-client_idle_5 + P-client_idle_4 + P-client_idle_3 + P-client_idle_2 + P-client_idle_1 > 0 OR -P-server_notification_ack_2 + -P-server_notification_ack_1 > -1) AND -P-server_notification_ack_2 + -P-server_notification_ack_1 > -3))
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 12 bytes per marking, with 21 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 3 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-server_idle_2 + -P-server_idle_1 + P-client_idle_10 + P-client_idle_9 + P-client_idle_8 + P-client_idle_7 + P-client_idle_6 + P-client_idle_5 + P-client_idle_4 + P-client_idle_3 + P-client_idle_2 + P-client_idle_1 <= 0 OR -P-lb_balancing_1 <= -2))
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 12 bytes per marking, with 21 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 2 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-6.sara
lola: lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P-server_notification_ack_2 + P-server_notification_ack_1 + -P-client_waiting_10 + -P-client_waiting_1 + -P-client_waiting_2 + -P-client_waiting_3 + -P-client_waiting_4 + -P-client_waiting_5 + -P-client_waiting_6 + -P-client_waiting_7 + -P-client_waiting_8 + -P-client_waiting_9 <= 0 OR -P-server_idle_2 + -P-server_idle_1 > -1))
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 12 bytes per marking, with 21 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 2 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-10-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 153)
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-lb_routing_1_10 + -P-lb_routing_1_9 + -P-lb_routing_1_8 + -P-lb_routing_1_7 + -P-lb_routing_1_6 + -P-lb_routing_1_5 + -P-lb_routing_1_4 + -P-lb_routing_1_3 + -P-lb_routing_1_2 + -P-lb_routing_1_1 > -2 OR (P-server_idle_2 + P-server_idle_1 + -P-client_waiting_10 + -P-client_waiting_1 + -P-client_waiting_2 + -P-client_waiting_3 + -P-client_waiting_4 + -P-client_waiting_5 + -P-client_waiting_... (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 12 bytes per marking, with 21 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 3 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-10-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-client_idle_10 + -P-client_idle_9 + -P-client_idle_8 + -P-client_idle_7 + -P-client_idle_6 + -P-client_idle_5 + -P-client_idle_4 + -P-client_idle_3 + -P-client_idle_2 + -P-client_idle_1 > -3 AND -P-server_idle_2 + -P-server_idle_1 + P-lb_idle_1 <= 0))
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 12 bytes per marking, with 21 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 2 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-P-client_request_10 + -P-client_request_7 + -P-client_request_6 + -P-client_request_5 + -P-client_request_4 + -P-client_request_3 + -P-client_request_2 + -P-client_request_1 + -P-client_request_8 + -P-client_request_9 <= -2 OR (P-server_waiting_2 + P-server_waiting_1 + -P-server_notification_2 + -P-server_notification_1 <= 0 AND -P-server_processed_2 + -P-server_processed_1 <= -1)) AND (P-c... (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 12 bytes per marking, with 21 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 7 literals
lola: SUBRESULT
lola: result: yes
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-10.sara
lola: The predicate is reachable.
lola: ========================================
lola: calling and running sara
lola: subprocess 11 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-lb_balancing_1 > -1 OR (-P-client_waiting_10 + -P-client_waiting_1 + -P-client_waiting_2 + -P-client_waiting_3 + -P-client_waiting_4 + -P-client_waiting_5 + -P-client_waiting_6 + -P-client_waiting_7 + -P-client_waiting_8 + -P-client_waiting_9 > -2 OR (-P-lb_balancing_1 > -1 AND -P-server_idle_2 + -P-server_idle_1 > -3))))
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 12 bytes per marking, with 21 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)
sara: lola: try reading problem file SimpleLoadBal-COL-10-ReachabilityCardinality-10.sara.
RUNNING
lola: Transformation into DNF: expect 6 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-P-lb_idle_1 + P-lb_balancing_1 > 0 OR P-server_notification_ack_2 + P-server_notification_ack_1 + -P-lb_load_2_9 + -P-lb_load_1_10 + -P-lb_load_2_8 + -P-lb_load_2_7 + -P-lb_load_2_6 + -P-lb_load_2_5 + -P-lb_load_2_4 + -P-lb_load_2_3 + -P-lb_load_2_2 + -P-lb_load_2_1 + -P-lb_load_2_0 + -P-lb_load_1_9 + -P-lb_load_1_8 + -P-lb_load_1_7 + -P-lb_load_1_6 + -P-lb_load_1_5 + -P-lb_load_1_4 + -P-lb... (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 12 bytes per marking, with 21 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 4 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-10-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-client_ack_10 + -P-client_ack_9 + -P-client_ack_8 + -P-client_ack_7 + -P-client_ack_6 + -P-client_ack_5 + -P-client_ack_4 + -P-client_ack_3 + -P-client_ack_2 + -P-client_ack_1 <= -2 AND -P-server_processed_2 + -P-server_processed_1 > -2))
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 12 bytes per marking, with 21 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 2 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-13.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-lb_balancing_1 <= -1 AND P-client_request_10 + P-client_request_7 + P-client_request_6 + P-client_request_5 + P-client_request_4 + P-client_request_3 + P-client_request_2 + P-client_request_1 + P-client_request_8 + P-client_request_9 + -P-lb_idle_1 > 0))
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 12 bytes per marking, with 21 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 2 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-14.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-lb_balancing_1 <= -1)
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 12 bytes per marking, with 21 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 1 literals
lola: write sara problem file to SimpleLoadBal-COL-10-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: unknown no yes no unknown no yes no yes yes yes no unknown yes yes yes
lola: ========================================

BK_STOP 1463738598333

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