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 CSRepetitions-PT-04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662600511
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463505303081

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ CSRepetitions-PT-04
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-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: 293/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 117 places, 176 transitions, 97 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 273 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-COL-04-ReachabilityCardinality.task
lola: read: AG (2 <= Server_Waiting_4 + Server_Waiting_2 + Server_Waiting_1 + Server_Waiting_3) : EF ((((Client_Sending_8 + Client_Sending_2 + Client_Sending_9 + Client_Sending_16 + Client_Sending_10 + Client_Sending_1 + Client_Sending_4 + Client_Sending_11 + Client_Sending_15 + Client_Sending_14 + Client_Sending_3 + Client_Sending_12 + Client_Sending_13 + Client_Sending_5 + Client_Sending_6 + Client_Sending_... (shortened)
lola: formula length: 32320
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Server_Waiting_1 + -Server_Waiting_2 + -Server_Waiting_3 + -Server_Waiting_4 <= -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 388 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 + -RequestBuffer_16 + -RequestBuffer_15 + -RequestBuffer_14 + -RequestBuffer_13 + -RequestBuffer_12 + -RequestBuffer_11 + -RequestBuffer_10 + -RequestBuffer_9 + -RequestBuffer_8 + -RequestBuffer_7 + -RequestBuffer_6 + -Reques... (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 388 bytes per marking, with 0 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: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Server_Anwering_3_4 + -Server_Anwering_3_3 + -Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_1 + -Server_Anwering_1_2 + -Server_Anwering_1_3 + -Server_Anwering_1_4 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + -Server_Anwering_2_3 + -Server_Anwering_2_4 + -Server_Anwering_16_4 + -Server_Anwering_16_3 + -Server_Anwering_16_2 + -Server_Anwering_16_1 + -Server_Anwering_15_4 + ... (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 388 bytes per marking, with 0 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-RequestBuffer_16 + -RequestBuffer_15 + -RequestBuffer_14 + -RequestBuffer_13 + -RequestBuffer_12 + -RequestBuffer_11 + -RequestBuffer_10 + -RequestBuffer_9 + -RequestBuffer_8 + -RequestBuffer_7 + -RequestBuffer_6 + -RequestBuffer_5 + -RequestBuffer_4 + -RequestBuffer_3 + -RequestBuffer_2 + -RequestBuffer_1 + RequestBufferSlots <= 0 AND (-Server_Anwering_3_4 + -Server_Anwering_3_3 + -Server_A... (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 388 bytes per marking, with 0 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 9 literals
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 (-RequestBuffer_16 + -RequestBuffer_15 + -RequestBuffer_14 + -RequestBuffer_13 + -RequestBuffer_12 + -RequestBuffer_11 + -RequestBuffer_10 + -RequestBuffer_9 + -RequestBuffer_8 + -RequestBuffer_7 + -RequestBuffer_6 + -RequestBuffer_5 + -RequestBuffer_4 + -RequestBuffer_3 + -RequestBuffer_2 + -RequestBuffer_1 <= -3)
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 388 bytes per marking, with 0 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 CSRepetitions-COL-04-ReachabilityCardinality-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 (Client_Waiting_10 + Client_Waiting_11 + Client_Waiting_12 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + -RequestBufferSlots + Client_Waiting_9 + Client_Waiting_8 + Client_Waiting_7 + Client_Waiting_6 + Client_Waiting_5 + Client_Waiting_4 + Client_Waiting_3 + Client_Waiting_2 + Client_Waiting_1 > 0)
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 388 bytes per marking, with 0 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: 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CSRepetitions-COL-04-ReachabilityCardinality.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: EF (((-Server_Anwering_3_4 + -Server_Anwering_3_3 + -Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_1 + -Server_Anwering_1_2 + -Server_Anwering_1_3 + -Server_Anwering_1_4 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + -Server_Anwering_2_3 + -Server_Anwering_2_4 + -Server_Anwering_16_4 + -Server_Anwering_16_3 + -Server_Anwering_16_2 + -Server_Anwering_16_1 + -Server_Anwering_15_4 ... (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 388 bytes per marking, with 0 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 18 literals
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 ((-RequestBufferSlots <= -2 OR (-RequestBuffer_16 + -RequestBuffer_15 + -RequestBuffer_14 + -RequestBuffer_13 + -RequestBuffer_12 + -RequestBuffer_11 + -RequestBuffer_10 + -RequestBuffer_9 + -RequestBuffer_8 + -RequestBuffer_7 + -RequestBuffer_6 + -RequestBuffer_5 + -RequestBuffer_4 + -RequestBuffer_3 + -RequestBuffer_2 + -RequestBuffer_1 + RequestBufferSlots <= 0 OR -Client_Sending_1 + -Client... (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 388 bytes per marking, with 0 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 CSRepetitions-COL-04-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file CSRepetitions-COL-04-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-RequestBufferSlots > -1 AND (-Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + -Client_Sending_5 + -Client_Sending_6 + -Client_Sending_7 + -Client_Sending_8 + -Client_Sending_9 + -Client_Sending_16 + -Client_Sending_15 + -Client_Sending_14 + -Client_Sending_13 + -Client_Sending_12 + -Client_Sending_11 + -Client_Sending_10 > -2 AND -Server_Anwering_3_4 + -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 388 bytes per marking, with 0 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Server_Waiting_1 + -Server_Waiting_2 + -Server_Waiting_3 + -Server_Waiting_4 <= -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 388 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Client_Waiting_10 + Client_Waiting_11 + Client_Waiting_12 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + -RequestBufferSlots + Client_Waiting_9 + Client_Waiting_8 + Client_Waiting_7 + Client_Waiting_6 + Client_Waiting_5 + Client_Waiting_4 + Client_Waiting_3 + Client_Waiting_2 + Client_Waiting_1 > 0)
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 388 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-Client_Waiting_10 + -Client_Waiting_11 + -Client_Waiting_12 + -Client_Waiting_16 + -Client_Waiting_15 + -Client_Waiting_14 + -Client_Waiting_13 + -Client_Waiting_9 + -Client_Waiting_8 + -Client_Waiting_7 + -Client_Waiting_6 + -Client_Waiting_5 + -Client_Waiting_4 + -Client_Waiting_3 + -Client_Waiting_2 + -Client_Waiting_1 <= -2 OR -Server_Anwering_3_4 + -Server_Anwering_3_3 + -Server_Anwer... (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 388 bytes per marking, with 0 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: Transformation into DNF: expect 7 literals
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 + Server_Waiting_4 + -RequestBuffer_16 + -RequestBuffer_15 + -RequestBuffer_14 + -RequestBuffer_13 + -RequestBuffer_12 + -RequestBuffer_11 + -RequestBuffer_10 + -RequestBuffer_9 + -RequestBuffer_8 + -RequestBuffer_7 + -RequestBuffer_6 + -RequestBuffer_5 + -RequestBuffer_4 + -RequestBuffer_3 + -RequestBuffer_2 + -RequestBuffer_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 388 bytes per marking, with 0 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Client_Waiting_10 + Client_Waiting_11 + Client_Waiting_12 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + -RequestBufferSlots + Client_Waiting_9 + Client_Waiting_8 + Client_Waiting_7 + Client_Waiting_6 + Client_Waiting_5 + Client_Waiting_4 + Client_Waiting_3 + Client_Waiting_2 + Client_Waiting_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 388 bytes per marking, with 0 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 CSRepetitions-COL-04-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 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((Client_Waiting_10 + Client_Waiting_11 + Client_Waiting_12 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + -RequestBuffer_16 + -RequestBuffer_15 + -RequestBuffer_14 + -RequestBuffer_13 + -RequestBuffer_12 + -RequestBuffer_11 + -RequestBuffer_10 + -RequestBuffer_9 + -RequestBuffer_8 + -RequestBuffer_7 + -RequestBuffer_6 + -RequestBuffer_5 + -RequestBuffer_4 + -... (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 388 bytes per marking, with 0 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 CSRepetitions-COL-04-ReachabilityCardinality-15.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: no yes yes yes yes no yes yes no yes no no no yes yes yes

BK_STOP 1463505304510

--------------------
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="CSRepetitions-PT-04"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/CSRepetitions-PT-04.tgz
mv CSRepetitions-PT-04 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 CSRepetitions-PT-04, 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 r002kn-ebro-146347662600511"
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 ;