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

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

=== Now, execution of the tool begins

BK_START 1463503761036

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ DatabaseWithMutex-PT-04
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-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: 268/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 140 places, 128 transitions, 112 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 176 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-COL-04-ReachabilityFireability.task
lola: read: AG (!((((((((((((((((((FIREABLE(Change_2_1) OR FIREABLE(Change_4_1)) OR FIREABLE(Change_3_3)) OR FIREABLE(Change_1_2)) OR FIREABLE(Change_2_2)) OR FIREABLE(Change_3_2)) OR FIREABLE(Change_4_4)) OR FIREABLE(Change_1_1)) OR FIREABLE(Change_4_2)) OR FIREABLE(Change_3_4)) OR FIREABLE(Change_2_4)) OR FIREABLE(Change_1_4)) OR FIREABLE(Change_1_3)) OR FIREABLE(Change_2_3)) OR FIREABLE(Change_3_1)) OR FIR... (shortened)
lola: formula length: 30919
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 (((! FIREABLE(Change_2_1) AND (! FIREABLE(Change_4_1) AND (! FIREABLE(Change_3_3) AND (! FIREABLE(Change_1_2) AND (! FIREABLE(Change_2_2) AND (! FIREABLE(Change_3_2) AND (! FIREABLE(Change_4_4) AND (! FIREABLE(Change_1_1) AND (! FIREABLE(Change_4_2) AND (! FIREABLE(Change_3_4) AND (! FIREABLE(Change_2_4) AND (! FIREABLE(Change_1_4) AND (! FIREABLE(Change_1_3) AND (! FIREABLE(Change_2_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 448 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Release_1_3) OR (FIREABLE(Release_4_4) OR (FIREABLE(Release_2_1) OR (FIREABLE(Release_3_1) OR (FIREABLE(Release_1_1) OR (FIREABLE(Release_3_3) OR (FIREABLE(Release_4_2) OR (FIREABLE(Release_2_3) OR (FIREABLE(Release_2_2) OR (FIREABLE(Release_1_4) OR (FIREABLE(Release_3_2) OR (FIREABLE(Release_4_3) OR (FIREABLE(Release_4_1) OR (FIREABLE(Release_3_4) OR (FIREABLE(Release_2_4) OR FIREAB... (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 448 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 64 literals
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 (((FIREABLE(Release_1_3) OR (FIREABLE(Release_4_4) OR (FIREABLE(Release_2_1) OR (FIREABLE(Release_3_1) OR (FIREABLE(Release_1_1) OR (FIREABLE(Release_3_3) OR (FIREABLE(Release_4_2) OR (FIREABLE(Release_2_3) OR (FIREABLE(Release_2_2) OR (FIREABLE(Release_1_4) OR (FIREABLE(Release_3_2) OR (FIREABLE(Release_4_3) OR (FIREABLE(Release_4_1) OR (FIREABLE(Release_3_4) OR (FIREABLE(Release_2_4) OR FIREA... (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 448 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 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Release_1_3) OR (FIREABLE(Release_4_4) OR (FIREABLE(Release_2_1) OR (FIREABLE(Release_3_1) OR (FIREABLE(Release_1_1) OR (FIREABLE(Release_3_3) OR (FIREABLE(Release_4_2) OR (FIREABLE(Release_2_3) OR (FIREABLE(Release_2_2) OR (FIREABLE(Release_1_4) OR (FIREABLE(Release_3_2) OR (FIREABLE(Release_4_3) OR (FIREABLE(Release_4_1) OR (FIREABLE(Release_3_4) OR (FIREABLE(Release_2_4) OR FIREAB... (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 448 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 64 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 (((FIREABLE(SendReply_1_4) OR (FIREABLE(SendReply_2_2) OR (FIREABLE(SendReply_3_2) OR (FIREABLE(SendReply_3_4) OR (FIREABLE(SendReply_4_3) OR (FIREABLE(SendReply_1_2) OR (FIREABLE(SendReply_2_4) OR (FIREABLE(SendReply_4_1) OR (FIREABLE(SendReply_2_3) OR (FIREABLE(SendReply_3_1) OR (FIREABLE(SendReply_3_3) OR (FIREABLE(SendReply_2_1) OR (FIREABLE(SendReply_4_4) OR (FIREABLE(SendReply_4_2) 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 448 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: Transformation into DNF: expect 560 literals
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(SendReply_1_4) OR (FIREABLE(SendReply_2_2) OR (FIREABLE(SendReply_3_2) OR (FIREABLE(SendReply_3_4) OR (FIREABLE(SendReply_4_3) OR (FIREABLE(SendReply_1_2) OR (FIREABLE(SendReply_2_4) OR (FIREABLE(SendReply_4_1) OR (FIREABLE(SendReply_2_3) OR (FIREABLE(SendReply_3_1) OR (FIREABLE(SendReply_3_3) OR (FIREABLE(SendReply_2_1) OR (FIREABLE(SendReply_4_4) OR (FIREABLE(SendReply_4_2) OR (FIR... (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 448 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 16 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(end_update_4_3) AND (! FIREABLE(end_update_1_2) AND (! FIREABLE(end_update_3_3) AND (! FIREABLE(end_update_3_1) AND (! FIREABLE(end_update_2_2) AND (! FIREABLE(end_update_1_4) AND (! FIREABLE(end_update_4_1) AND (! FIREABLE(end_update_2_4) AND (! FIREABLE(end_update_3_4) AND (! FIREABLE(end_update_4_2) AND (! FIREABLE(end_update_2_1) AND (! FIREABLE(end_update_3_2) AND (! 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 448 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 512 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(SendReply_1_4) AND (! FIREABLE(SendReply_2_2) AND (! FIREABLE(SendReply_3_2) AND (! FIREABLE(SendReply_3_4) AND (! FIREABLE(SendReply_4_3) AND (! FIREABLE(SendReply_1_2) AND (! FIREABLE(SendReply_2_4) AND (! FIREABLE(SendReply_4_1) AND (! FIREABLE(SendReply_2_3) AND (! FIREABLE(SendReply_3_1) AND (! FIREABLE(SendReply_3_3) AND (! FIREABLE(SendReply_2_1) AND (! FIREABLE(SendReply_4_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 448 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 16 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Update_3_1) AND (! FIREABLE(Update_2_3) AND (! FIREABLE(Update_1_3) AND (! FIREABLE(Update_4_2) AND (! FIREABLE(Update_3_4) AND (! FIREABLE(Update_3_2) AND (! FIREABLE(Update_4_4) AND (! FIREABLE(Update_2_2) AND (! FIREABLE(Update_1_4) AND (! FIREABLE(Update_1_2) AND (! FIREABLE(Update_2_4) AND (! FIREABLE(Update_4_1) AND (! FIREABLE(Update_1_1) AND (! FIREABLE(Update_3_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 448 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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Change_2_1) AND (! FIREABLE(Change_4_1) AND (! FIREABLE(Change_3_3) AND (! FIREABLE(Change_1_2) AND (! FIREABLE(Change_2_2) AND (! FIREABLE(Change_3_2) AND (! FIREABLE(Change_4_4) AND (! FIREABLE(Change_1_1) AND (! FIREABLE(Change_4_2) AND (! FIREABLE(Change_3_4) AND (! FIREABLE(Change_2_4) AND (! FIREABLE(Change_1_4) AND (! FIREABLE(Change_1_3) AND (! FIREABLE(Change_2_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 448 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 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(Change_2_1) OR (FIREABLE(Change_4_1) OR (FIREABLE(Change_3_3) OR (FIREABLE(Change_1_2) OR (FIREABLE(Change_2_2) OR (FIREABLE(Change_3_2) OR (FIREABLE(Change_4_4) OR (FIREABLE(Change_1_1) OR (FIREABLE(Change_4_2) OR (FIREABLE(Change_3_4) OR (FIREABLE(Change_2_4) OR (FIREABLE(Change_1_4) OR (FIREABLE(Change_1_3) OR (FIREABLE(Change_2_3) OR (FIREABLE(Change_3_1) OR FIREABLE(Change_4_3... (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 448 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 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(SendReply_1_4) AND (! FIREABLE(SendReply_2_2) AND (! FIREABLE(SendReply_3_2) AND (! FIREABLE(SendReply_3_4) AND (! FIREABLE(SendReply_4_3) AND (! FIREABLE(SendReply_1_2) AND (! FIREABLE(SendReply_2_4) AND (! FIREABLE(SendReply_4_1) AND (! FIREABLE(SendReply_2_3) AND (! FIREABLE(SendReply_3_1) AND (! FIREABLE(SendReply_3_3) AND (! FIREABLE(SendReply_2_1) AND (! FIREABLE(SendReply_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 448 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 285344 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 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Update_3_1) OR (FIREABLE(Update_2_3) OR (FIREABLE(Update_1_3) OR (FIREABLE(Update_4_2) OR (FIREABLE(Update_3_4) OR (FIREABLE(Update_3_2) OR (FIREABLE(Update_4_4) OR (FIREABLE(Update_2_2) OR (FIREABLE(Update_1_4) OR (FIREABLE(Update_1_2) OR (FIREABLE(Update_2_4) OR (FIREABLE(Update_4_1) OR (FIREABLE(Update_1_1) OR (FIREABLE(Update_3_3) OR (FIREABLE(Update_4_3) OR (FIREABLE(Update_2_1)... (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 448 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 1277034338 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 13 will run for 943 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Acquire_3_2) AND (! FIREABLE(Acquire_1_1) AND (! FIREABLE(Acquire_1_4) AND (! FIREABLE(Acquire_3_4) AND (! FIREABLE(Acquire_2_4) AND (! FIREABLE(Acquire_4_3) AND (! FIREABLE(Acquire_2_1) AND (! FIREABLE(Acquire_3_3) AND (! FIREABLE(Acquire_3_1) AND (! FIREABLE(Acquire_2_3) AND (! FIREABLE(Acquire_1_3) AND (! FIREABLE(Acquire_4_1) AND (! FIREABLE(Acquire_1_2) AND (! FIREABLE(Acquire... (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 448 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 2473901162368 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 14 will run for 1415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Update_3_1) OR (FIREABLE(Update_2_3) OR (FIREABLE(Update_1_3) OR (FIREABLE(Update_4_2) OR (FIREABLE(Update_3_4) OR (FIREABLE(Update_3_2) OR (FIREABLE(Update_4_4) OR (FIREABLE(Update_2_2) OR (FIREABLE(Update_1_4) OR (FIREABLE(Update_1_2) OR (FIREABLE(Update_2_4) OR (FIREABLE(Update_4_1) OR (FIREABLE(Update_1_1) OR (FIREABLE(Update_3_3) OR (FIREABLE(Update_4_3) OR FIREABLE(Update_2_1)... (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 448 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 2830 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(Start_2_2) AND (! FIREABLE(Start_3_1) AND (! FIREABLE(Start_1_1) AND (! FIREABLE(Start_4_3) AND (! FIREABLE(Start_1_4) AND (! FIREABLE(Start_2_4) AND (! FIREABLE(Start_3_4) AND (! FIREABLE(Start_1_2) AND (! FIREABLE(Start_4_2) AND (! FIREABLE(Start_3_2) AND (! FIREABLE(Start_4_4) AND (! FIREABLE(Start_1_3) AND (! FIREABLE(Start_2_1) AND (! FIREABLE(Start_2_3) AND (! FIREABLE(Star... (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 448 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: no yes yes yes yes yes no no no no no unknown no yes yes yes

BK_STOP 1463504471893

--------------------
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-04"
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-04.tgz
mv DatabaseWithMutex-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 DatabaseWithMutex-PT-04, 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-146347846400180"
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 ;