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 DatabaseWithMutex-PT-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014kn-qhx2-146347846400198
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463509221224

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ DatabaseWithMutex-PT-20
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 6460/65536 symbol table entries, 161 collisions
lola: preprocessing...
lola: finding significant places
lola: 3260 places, 3200 transitions, 2800 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4080 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-COL-20-ReachabilityFireability.task
lola: read: EF ((!(!((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((... (shortened)
lola: formula length: 741952
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Release_19_11) OR (FIREABLE(Release_11_5) OR (FIREABLE(Release_9_11) OR (FIREABLE(Release_11_15) OR (FIREABLE(Release_13_1) OR (FIREABLE(Release_4_20) OR (FIREABLE(Release_11_4) OR (FIREABLE(Release_5_18) OR (FIREABLE(Release_12_4) OR (FIREABLE(Release_13_5) OR (FIREABLE(Release_7_5) OR (FIREABLE(Release_14_5) OR (FIREABLE(Release_15_2) OR (FIREABLE(Release_16_13) OR (FIREABLE(Relea... (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 11200 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 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Release_19_11) OR (FIREABLE(Release_11_5) OR (FIREABLE(Release_9_11) OR (FIREABLE(Release_11_15) OR (FIREABLE(Release_13_1) OR (FIREABLE(Release_4_20) OR (FIREABLE(Release_11_4) OR (FIREABLE(Release_5_18) OR (FIREABLE(Release_12_4) OR (FIREABLE(Release_13_5) OR (FIREABLE(Release_7_5) OR (FIREABLE(Release_14_5) OR (FIREABLE(Release_15_2) OR (FIREABLE(Release_16_13) OR (FIREABLE(Releas... (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 11200 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 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Update_1_6) OR (FIREABLE(Update_12_3) OR (FIREABLE(Update_9_15) OR (FIREABLE(Update_18_18) OR (FIREABLE(Update_3_13) OR (FIREABLE(Update_11_8) OR (FIREABLE(Update_10_9) OR (FIREABLE(Update_18_17) OR (FIREABLE(Update_13_17) OR (FIREABLE(Update_17_7) OR (FIREABLE(Update_16_15) OR (FIREABLE(Update_19_9) OR (FIREABLE(Update_7_18) OR (FIREABLE(Update_6_6) OR (FIREABLE(Update_6_4) OR (FIRE... (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 11200 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 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Start_2_15) OR (FIREABLE(Start_17_14) OR (FIREABLE(Start_5_11) OR (FIREABLE(Start_8_19) OR (FIREABLE(Start_1_19) OR (FIREABLE(Start_5_10) OR (FIREABLE(Start_5_14) OR (FIREABLE(Start_1_5) OR (FIREABLE(Start_7_7) OR (FIREABLE(Start_18_16) OR (FIREABLE(Start_19_11) OR (FIREABLE(Start_6_12) OR (FIREABLE(Start_20_1) OR (FIREABLE(Start_3_2) OR (FIREABLE(Start_4_17) OR (FIREABLE(Start_20_8)... (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 11200 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 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(SendReply_12_6) OR (FIREABLE(SendReply_3_12) OR (FIREABLE(SendReply_17_8) OR (FIREABLE(SendReply_8_19) OR (FIREABLE(SendReply_1_15) OR (FIREABLE(SendReply_3_2) OR (FIREABLE(SendReply_7_9) OR (FIREABLE(SendReply_16_19) OR (FIREABLE(SendReply_13_5) OR (FIREABLE(SendReply_11_18) OR (FIREABLE(SendReply_4_16) OR (FIREABLE(SendReply_9_13) OR (FIREABLE(SendReply_1_18) OR (FIREABLE(SendReply... (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 11200 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 5 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Start_2_15) OR (FIREABLE(Start_17_14) OR (FIREABLE(Start_5_11) OR (FIREABLE(Start_8_19) OR (FIREABLE(Start_1_19) OR (FIREABLE(Start_5_10) OR (FIREABLE(Start_5_14) OR (FIREABLE(Start_1_5) OR (FIREABLE(Start_7_7) OR (FIREABLE(Start_18_16) OR (FIREABLE(Start_19_11) OR (FIREABLE(Start_6_12) OR (FIREABLE(Start_20_1) OR (FIREABLE(Start_3_2) OR (FIREABLE(Start_4_17) OR (FIREABLE(Start_20_8)... (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 11200 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 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Start_2_15) OR (FIREABLE(Start_17_14) OR (FIREABLE(Start_5_11) OR (FIREABLE(Start_8_19) OR (FIREABLE(Start_1_19) OR (FIREABLE(Start_5_10) OR (FIREABLE(Start_5_14) OR (FIREABLE(Start_1_5) OR (FIREABLE(Start_7_7) OR (FIREABLE(Start_18_16) OR (FIREABLE(Start_19_11) OR (FIREABLE(Start_6_12) OR (FIREABLE(Start_20_1) OR (FIREABLE(Start_3_2) OR (FIREABLE(Start_4_17) OR (FIREABLE(Start_20_8)... (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 11200 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 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(SendReply_12_6) OR (FIREABLE(SendReply_3_12) OR (FIREABLE(SendReply_17_8) OR (FIREABLE(SendReply_8_19) OR (FIREABLE(SendReply_1_15) OR (FIREABLE(SendReply_3_2) OR (FIREABLE(SendReply_7_9) OR (FIREABLE(SendReply_16_19) OR (FIREABLE(SendReply_13_5) OR (FIREABLE(SendReply_11_18) OR (FIREABLE(SendReply_4_16) OR (FIREABLE(SendReply_9_13) OR (FIREABLE(SendReply_1_18) OR (FIREABLE(SendRep... (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 11200 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 8 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Change_13_20) OR (FIREABLE(Change_12_12) OR (FIREABLE(Change_17_6) OR (FIREABLE(Change_6_14) OR (FIREABLE(Change_17_18) OR (FIREABLE(Change_17_10) OR (FIREABLE(Change_18_10) OR (FIREABLE(Change_18_6) OR (FIREABLE(Change_5_8) OR (FIREABLE(Change_15_4) OR (FIREABLE(Change_13_9) OR (FIREABLE(Change_1_15) OR (FIREABLE(Change_4_11) OR (FIREABLE(Change_1_3) OR (FIREABLE(Change_3_9) OR (FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 11200 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 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Update_1_6) OR (FIREABLE(Update_12_3) OR (FIREABLE(Update_9_15) OR (FIREABLE(Update_18_18) OR (FIREABLE(Update_3_13) OR (FIREABLE(Update_11_8) OR (FIREABLE(Update_10_9) OR (FIREABLE(Update_18_17) OR (FIREABLE(Update_13_17) OR (FIREABLE(Update_17_7) OR (FIREABLE(Update_16_15) OR (FIREABLE(Update_19_9) OR (FIREABLE(Update_7_18) OR (FIREABLE(Update_6_6) OR (FIREABLE(Update_6_4) OR (FIRE... (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 11200 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 10 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(Change_13_20) OR (FIREABLE(Change_12_12) OR (FIREABLE(Change_17_6) OR (FIREABLE(Change_6_14) OR (FIREABLE(Change_17_18) OR (FIREABLE(Change_17_10) OR (FIREABLE(Change_18_10) OR (FIREABLE(Change_18_6) OR (FIREABLE(Change_5_8) OR (FIREABLE(Change_15_4) OR (FIREABLE(Change_13_9) OR (FIREABLE(Change_1_15) OR (FIREABLE(Change_4_11) OR (FIREABLE(Change_1_3) OR (FIREABLE(Change_3_9) 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 11200 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 11 will run for 693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(SendMsg_10_7) AND (! FIREABLE(SendMsg_15_18) AND (! FIREABLE(SendMsg_11_20) AND (! FIREABLE(SendMsg_19_9) AND (! FIREABLE(SendMsg_8_13) AND (! FIREABLE(SendMsg_10_15) AND (! FIREABLE(SendMsg_3_6) AND (! FIREABLE(SendMsg_17_5) AND (! FIREABLE(SendMsg_18_1) AND (! FIREABLE(SendMsg_8_5) AND (! FIREABLE(SendMsg_6_10) AND (! FIREABLE(SendMsg_18_10) AND (! FIREABLE(SendMsg_15_20) 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 11200 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 12 will run for 866 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Acquire_10_15) OR (FIREABLE(Acquire_6_5) OR (FIREABLE(Acquire_5_13) OR (FIREABLE(Acquire_19_5) OR (FIREABLE(Acquire_20_20) OR (FIREABLE(Acquire_6_17) OR (FIREABLE(Acquire_20_14) OR (FIREABLE(Acquire_4_12) OR (FIREABLE(Acquire_2_3) OR (FIREABLE(Acquire_18_11) OR (FIREABLE(Acquire_12_13) OR (FIREABLE(Acquire_20_3) OR (FIREABLE(Acquire_1_18) OR (FIREABLE(Acquire_10_9) OR (FIREABLE(Acqui... (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 11200 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 13 will run for 1155 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(SendMsg_10_7) OR (FIREABLE(SendMsg_15_18) OR (FIREABLE(SendMsg_11_20) OR (FIREABLE(SendMsg_19_9) OR (FIREABLE(SendMsg_8_13) OR (FIREABLE(SendMsg_10_15) OR (FIREABLE(SendMsg_3_6) OR (FIREABLE(SendMsg_17_5) OR (FIREABLE(SendMsg_18_1) OR (FIREABLE(SendMsg_8_5) OR (FIREABLE(SendMsg_6_10) OR (FIREABLE(SendMsg_18_10) OR (FIREABLE(SendMsg_15_20) OR (FIREABLE(SendMsg_5_8) OR (FIREABLE(SendMs... (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 11200 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 400 literals
lola: ========================================
lola: subprocess 14 will run for 1732 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(SendMsg_10_7) OR (FIREABLE(SendMsg_15_18) OR (FIREABLE(SendMsg_11_20) OR (FIREABLE(SendMsg_19_9) OR (FIREABLE(SendMsg_8_13) OR (FIREABLE(SendMsg_10_15) OR (FIREABLE(SendMsg_3_6) OR (FIREABLE(SendMsg_17_5) OR (FIREABLE(SendMsg_18_1) OR (FIREABLE(SendMsg_8_5) OR (FIREABLE(SendMsg_6_10) OR (FIREABLE(SendMsg_18_10) OR (FIREABLE(SendMsg_15_20) OR (FIREABLE(SendMsg_5_8) OR (FIREABLE(SendM... (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 11200 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 15 will run for 3464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Update_1_6) OR (FIREABLE(Update_12_3) OR (FIREABLE(Update_9_15) OR (FIREABLE(Update_18_18) OR (FIREABLE(Update_3_13) OR (FIREABLE(Update_11_8) OR (FIREABLE(Update_10_9) OR (FIREABLE(Update_18_17) OR (FIREABLE(Update_13_17) OR (FIREABLE(Update_17_7) OR (FIREABLE(Update_16_15) OR (FIREABLE(Update_19_9) OR (FIREABLE(Update_7_18) OR (FIREABLE(Update_6_6) OR (FIREABLE(Update_6_4) OR (FIRE... (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 11200 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: RESULT
lola: summary: yes no yes no yes no no yes yes yes yes no no yes yes yes

BK_STOP 1463509297295

--------------------
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="DatabaseWithMutex-PT-20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/fko/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-20.tgz
mv DatabaseWithMutex-PT-20 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 DatabaseWithMutex-PT-20, 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 r014kn-qhx2-146347846400198"
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 ;