About the Execution of LoLa for SimpleLoadBal-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
115.580 | 298.00 | 80.00 | 0.00 | TFTTTTFFTFFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...........
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is SimpleLoadBal-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122kn-qhx2-146373367700048
=====================================================================
--------------------
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-02-CTLCardinality-0
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-1
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-10
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-11
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-12
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-13
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-14
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-15
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-2
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-3
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-4
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-5
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-6
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-7
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-8
FORMULA_NAME SimpleLoadBal-COL-02-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463734167881
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ SimpleLoadBal-PT-02
FORMULA SimpleLoadBal-COL-02-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-02-CTLCardinality-15 FALSE 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: 77/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 32 places, 45 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 79 transition conflict sets
lola: TASK
lola: reading formula from SimpleLoadBal-COL-02-CTLCardinality.task
lola: read: 2 <= P-client_idle_1 + P-client_idle_2 : !(!(AX (!(1 <= P-client_idle_1 + P-client_idle_2)))) : AG (EX (!(3 <= P-client_ack_1 + P-client_ack_2))) : (1 <= P-server_notification_ack_1 + P-server_notification_ack_2 AND AF (!(!(1 <= P-lb_idle_1)))) : !(AF (P-client_ack_1 + P-client_ack_2 <= P-server_notification_1 + P-server_notification_2)) : AG (!(!((3 <= P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_1_... (shortened)
lola: formula length: 2998
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-client_idle_2 + -P-client_idle_1 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-P-client_idle_2 + -P-client_idle_1 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-P-client_idle_2 + -P-client_idle_1 > -1)
lola: processed formula length: 44
lola: 794 rewrites
lola: formula mentions 2 of 32 places; total mentions: 2
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX (-P-client_ack_2 + -P-client_ack_1 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX(-P-client_ack_2 + -P-client_ack_1 > -3))))
lola: processed formula length: 58
lola: 795 rewrites
lola: formula mentions 2 of 32 places; total mentions: 2
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-P-server_notification_ack_2 + -P-server_notification_ack_1 <= -1 AND AF (-P-lb_idle_1 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-server_notification_ack_2 + -P-server_notification_ack_1 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-P-server_notification_2 + -P-server_notification_1 + P-client_ack_2 + P-client_ack_1 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-P-server_notification_2 + -P-server_notification_1 + P-client_ack_2 + P-client_ack_1 > 0)))
lola: processed formula length: 105
lola: 794 rewrites
lola: formula mentions 4 of 32 places; total mentions: 4
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-lb_load_1_2 + -P-lb_load_2_2 + -P-lb_load_2_1 + -P-lb_load_2_0 + -P-lb_load_1_1 + -P-lb_load_1_0 <= -3 AND P-lb_load_1_2 + P-lb_load_2_2 + P-lb_load_2_1 + P-lb_load_2_0 + -P-lb_routing_1_1 + -P-lb_routing_1_2 + P-lb_load_1_1 + P-lb_load_1_0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-lb_load_1_2 + -P-lb_load_2_2 + -P-lb_load_2_1 + -P-lb_load_2_0 + -P-lb_load_1_1 + -P-lb_load_1_0 + P-client_ack_2 + P-client_ack_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (-P-server_notification_2 + -P-server_notification_1 > -3) OR AG (EX (P-lb_balancing_1 + -P-lb_routing_1_1 + -P-lb_routing_1_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-P-server_notification_2 + -P-server_notification_1 > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-P-server_notification_2 + -P-server_notification_1 > -3)
lola: processed formula length: 60
lola: 794 rewrites
lola: formula mentions 2 of 32 places; total mentions: 2
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX (P-server_waiting_2 + P-server_waiting_1 + -P-client_ack_2 + -P-client_ack_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX(P-server_waiting_2 + P-server_waiting_1 + -P-client_ack_2 + -P-client_ack_1 <= 0))))
lola: processed formula length: 100
lola: 795 rewrites
lola: formula mentions 4 of 32 places; total mentions: 4
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX ((-P-lb_load_1_2 + -P-lb_load_2_2 + -P-lb_load_2_1 + -P-lb_load_2_0 + -P-lb_load_1_1 + -P-lb_load_1_0 + P-server_processed_2 + P-server_processed_1 <= 0 OR (P-lb_idle_1 + -P-server_notification_2 + -P-server_notification_1 <= 0 OR -P-server_processed_2 + -P-server_processed_1 <= -1))) AND ((-P-server_waiting_2 + -P-server_waiting_1 <= -1 AND -P-server_waiting_2 + -P-server_waiting_1 + P-client... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-P-lb_load_1_2 + -P-lb_load_2_2 + -P-lb_load_2_1 + -P-lb_load_2_0 + -P-lb_load_1_1 + -P-lb_load_1_0 + P-server_processed_2 + P-server_processed_1 <= 0 OR (P-lb_idle_1 + -P-server_notification_2 + -P-server_notification_1 <= 0 OR -P-server_processed_2 + -P-server_processed_1 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((-P-lb_load_1_2 + -P-lb_load_2_2 + -P-lb_load_2_1 + -P-lb_load_2_0 + -P-lb_load_1_1 + -P-lb_load_1_0 + P-server_processed_2 + P-server_processed_1 <= 0 OR (P-lb_idle_1 + -P-server_notification_2 + -P-server_notification_1 <= 0 OR -P-server_processed_2 + -P-server_processed_1 <= -1)))
lola: processed formula length: 287
lola: 794 rewrites
lola: formula mentions 11 of 32 places; total mentions: 13
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-P-server_waiting_2 + -P-server_waiting_1 <= -1 AND -P-server_waiting_2 + -P-server_waiting_1 + P-client_idle_2 + P-client_idle_1 > 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-lb_load_1_2 + -P-lb_load_2_2 + -P-lb_load_2_1 + -P-lb_load_2_0 + -P-lb_load_1_1 + -P-lb_load_1_0 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-P-lb_load_1_2 + -P-lb_load_2_2 + -P-lb_load_2_1 + -P-lb_load_2_0 + -P-lb_load_1_1 + -P-lb_load_1_0 <= -2) OR AG ((-P-client_ack_2 + -P-client_ack_1 > -1 OR -P-server_waiting_2 + -P-server_waiting_1 > -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-lb_load_1_2 + -P-lb_load_2_2 + -P-lb_load_2_1 + -P-lb_load_2_0 + -P-lb_load_1_1 + -P-lb_load_1_0 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX (P-server_notification_2 + P-server_notification_1 + -P-client_idle_2 + -P-client_idle_1 <= 0) OR EF (EG (-P-lb_idle_1 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (P-server_notification_2 + P-server_notification_1 + -P-client_idle_2 + -P-client_idle_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(P-server_notification_2 + P-server_notification_1 + -P-client_idle_2 + -P-client_idle_1 <= 0)
lola: processed formula length: 96
lola: 794 rewrites
lola: formula mentions 4 of 32 places; total mentions: 4
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-server_idle_2 + -P-server_idle_1 + P-lb_balancing_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-P-server_processed_2 + -P-server_processed_1 <= -2 OR (-P-lb_balancing_1 + P-client_request_2 + P-client_request_1 > 0 AND P-server_idle_2 + P-server_idle_1 + -P-server_notification_2 + -P-server_notification_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AG (-P-client_ack_2 + -P-client_ack_1 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !(-P-client_ack_2 + -P-client_ack_1 > -2))))))
lola: processed formula length: 70
lola: 795 rewrites
lola: formula mentions 2 of 32 places; total mentions: 2
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: RESULT
lola: summary: yes no yes no no no yes no yes no yes yes yes yes no no
BK_STOP 1463734168179
--------------------
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-02"
export BK_EXAMINATION="CTLCardinality"
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-02.tgz
mv SimpleLoadBal-PT-02 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-02, examination is CTLCardinality"
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-146373367700048"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
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 ;