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-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662600522
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463506329394

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ CSRepetitions-PT-05
FORMULA CSRepetitions-COL-05-ReachabilityFireability-0 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-05-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-05-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-05-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-05-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-05-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-05-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-05-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-05-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-05-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-05-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-05-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-05-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-05-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-05-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-05-ReachabilityFireability-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: 531/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 206 places, 325 transitions, 176 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 501 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-COL-05-ReachabilityFireability.task
lola: read: EF ((!((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(Read_Request_18_4) OR FIREABLE(Read_Request_20_1)) OR FIREABLE(Read_Request_16_3)) OR FIREABLE(Read_Request_12_5)) OR FIREABLE(Read_Request_23_2)) OR FIREABLE(Read_Request_9_4)) OR FIREABLE(Read_Request_12_2)) OR FIREABLE(Read_Request_3_5)) OR FIREABLE(Read_R... (shortened)
lola: formula length: 141489
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(Read_Request_18_4) AND (! FIREABLE(Read_Request_20_1) AND (! FIREABLE(Read_Request_16_3) AND (! FIREABLE(Read_Request_12_5) AND (! FIREABLE(Read_Request_23_2) AND (! FIREABLE(Read_Request_9_4) AND (! FIREABLE(Read_Request_12_2) AND (! FIREABLE(Read_Request_3_5) AND (! FIREABLE(Read_Request_20_5) AND (! FIREABLE(Read_Request_2_1) AND (! FIREABLE(Read_Request_3_2) AND (! FIREABLE(Rea... (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 704 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 411528987495009954251018665862794680729600 literals
lola: DNF formula is too big, sara cannot be used
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 (((! FIREABLE(Read_Request_18_4) AND (! FIREABLE(Read_Request_20_1) AND (! FIREABLE(Read_Request_16_3) AND (! FIREABLE(Read_Request_12_5) AND (! FIREABLE(Read_Request_23_2) AND (! FIREABLE(Read_Request_9_4) AND (! FIREABLE(Read_Request_12_2) AND (! FIREABLE(Read_Request_3_5) AND (! FIREABLE(Read_Request_20_5) AND (! FIREABLE(Read_Request_2_1) AND (! FIREABLE(Read_Request_3_2) AND (! FIREABLE(Re... (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 704 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 16777297000 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_19) OR (FIREABLE(Prepare_Request_25) OR (FIREABLE(Prepare_Request_11) OR (FIREABLE(Prepare_Request_13) OR (FIREABLE(Prepare_Request_12) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_17) OR (FIREABLE(Prepare_Request_20) OR (FIREABLE(Prepare_Request_18) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (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 704 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 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_19) OR (FIREABLE(Prepare_Request_25) OR (FIREABLE(Prepare_Request_11) OR (FIREABLE(Prepare_Request_13) OR (FIREABLE(Prepare_Request_12) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_17) OR (FIREABLE(Prepare_Request_20) OR (FIREABLE(Prepare_Request_18) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (FI... (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 704 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 25 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Prepare_Request_5) AND (! FIREABLE(Prepare_Request_19) AND (! FIREABLE(Prepare_Request_25) AND (! FIREABLE(Prepare_Request_11) AND (! FIREABLE(Prepare_Request_13) AND (! FIREABLE(Prepare_Request_12) AND (! FIREABLE(Prepare_Request_10) AND (! FIREABLE(Prepare_Request_17) AND (! FIREABLE(Prepare_Request_20) AND (! FIREABLE(Prepare_Request_18) AND (! FIREABLE(Prepare_Request_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 704 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 364740162043380836296642143076588958110449664 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_19) OR (FIREABLE(Prepare_Request_25) OR (FIREABLE(Prepare_Request_11) OR (FIREABLE(Prepare_Request_13) OR (FIREABLE(Prepare_Request_12) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_17) OR (FIREABLE(Prepare_Request_20) OR (FIREABLE(Prepare_Request_18) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (... (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 704 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_19) OR (FIREABLE(Prepare_Request_25) OR (FIREABLE(Prepare_Request_11) OR (FIREABLE(Prepare_Request_13) OR (FIREABLE(Prepare_Request_12) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_17) OR (FIREABLE(Prepare_Request_20) OR (FIREABLE(Prepare_Request_18) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (FI... (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 704 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Prepare_Request_5) AND (! FIREABLE(Prepare_Request_19) AND (! FIREABLE(Prepare_Request_25) AND (! FIREABLE(Prepare_Request_11) AND (! FIREABLE(Prepare_Request_13) AND (! FIREABLE(Prepare_Request_12) AND (! FIREABLE(Prepare_Request_10) AND (! FIREABLE(Prepare_Request_17) AND (! FIREABLE(Prepare_Request_20) AND (! FIREABLE(Prepare_Request_18) AND (! FIREABLE(Prepare_Request_9) AND (!... (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 704 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: Transformation into DNF: expect 170141183460469212842221372237303250944 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 8 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(Lose_Request_12) AND (! FIREABLE(Lose_Request_20) AND (! FIREABLE(Lose_Request_1) AND (! FIREABLE(Lose_Request_13) AND (! FIREABLE(Lose_Request_6) AND (! FIREABLE(Lose_Request_2) AND (! FIREABLE(Lose_Request_14) AND (! FIREABLE(Lose_Request_5) AND (! FIREABLE(Lose_Request_19) AND (! FIREABLE(Lose_Request_18) AND (! FIREABLE(Lose_Request_15) AND (! FIREABLE(Lose_Request_8) AND (! ... (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 704 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 9 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(Send_Request_1) OR (FIREABLE(Send_Request_24) OR (FIREABLE(Send_Request_22) OR (FIREABLE(Send_Request_8) OR (FIREABLE(Send_Request_15) OR (FIREABLE(Send_Request_14) OR (FIREABLE(Send_Request_13) OR (FIREABLE(Send_Request_20) OR (FIREABLE(Send_Request_2) OR (FIREABLE(Send_Request_12) OR (FIREABLE(Send_Request_21) OR (FIREABLE(Send_Request_3) OR (FIREABLE(Send_Request_4) OR (FIREABLE... (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 704 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_19) OR (FIREABLE(Prepare_Request_25) OR (FIREABLE(Prepare_Request_11) OR (FIREABLE(Prepare_Request_13) OR (FIREABLE(Prepare_Request_12) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_17) OR (FIREABLE(Prepare_Request_20) OR (FIREABLE(Prepare_Request_18) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (FI... (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 704 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 25 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Send_Answer_20_2) OR (FIREABLE(Send_Answer_17_4) OR (FIREABLE(Send_Answer_1_2) OR (FIREABLE(Send_Answer_11_2) OR (FIREABLE(Send_Answer_5_3) OR (FIREABLE(Send_Answer_14_3) OR (FIREABLE(Send_Answer_18_5) OR (FIREABLE(Send_Answer_9_5) OR (FIREABLE(Send_Answer_2_1) OR (FIREABLE(Send_Answer_4_3) OR (FIREABLE(Send_Answer_25_4) OR (FIREABLE(Send_Answer_7_4) OR (FIREABLE(Send_Answer_8_1) OR... (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 704 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 419430406250 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_19) OR (FIREABLE(Prepare_Request_25) OR (FIREABLE(Prepare_Request_11) OR (FIREABLE(Prepare_Request_13) OR (FIREABLE(Prepare_Request_12) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_17) OR (FIREABLE(Prepare_Request_20) OR (FIREABLE(Prepare_Request_18) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (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 704 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 846250 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Send_Request_1) AND (! FIREABLE(Send_Request_24) AND (! FIREABLE(Send_Request_22) AND (! FIREABLE(Send_Request_8) AND (! FIREABLE(Send_Request_15) AND (! FIREABLE(Send_Request_14) AND (! FIREABLE(Send_Request_13) AND (! FIREABLE(Send_Request_20) AND (! FIREABLE(Send_Request_2) AND (! FIREABLE(Send_Request_12) AND (! FIREABLE(Send_Request_21) AND (! FIREABLE(Send_Request_3) 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 704 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 2371421987580235229961885189711539979510809095765178699692213720323607615894701749089337344 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_19) OR (FIREABLE(Prepare_Request_25) OR (FIREABLE(Prepare_Request_11) OR (FIREABLE(Prepare_Request_13) OR (FIREABLE(Prepare_Request_12) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_17) OR (FIREABLE(Prepare_Request_20) OR (FIREABLE(Prepare_Request_18) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (FI... (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 704 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: no
lola: The predicate is not invariant.
lola: Transformation into DNF: expect 170141183460469212842221372237303250944 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 15 will run for 1135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Lose_Request_12) AND (! FIREABLE(Lose_Request_20) AND (! FIREABLE(Lose_Request_1) AND (! FIREABLE(Lose_Request_13) AND (! FIREABLE(Lose_Request_6) AND (! FIREABLE(Lose_Request_2) AND (! FIREABLE(Lose_Request_14) AND (! FIREABLE(Lose_Request_5) AND (! FIREABLE(Lose_Request_19) AND (! FIREABLE(Lose_Request_18) AND (! FIREABLE(Lose_Request_15) AND (! FIREABLE(Lose_Request_8) AND (! 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 704 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: no
lola: The predicate is not invariant.
lola: RESULT
lola: summary: unknown unknown yes no unknown no no yes yes no no unknown unknown unknown no no
lola: ========================================

BK_STOP 1463508735750

--------------------
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-05"
export BK_EXAMINATION="ReachabilityFireability"
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-05.tgz
mv CSRepetitions-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 CSRepetitions-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 r002kn-ebro-146347662600522"
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 ;