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

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

=== Now, execution of the tool begins

BK_START 1463506682911

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ DatabaseWithMutex-PT-10
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-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: 1630/65536 symbol table entries, 31 collisions
lola: preprocessing...
lola: finding significant places
lola: 830 places, 800 transitions, 700 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1040 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-COL-10-ReachabilityFireability.task
lola: read: EF ((!((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(Change_7_2) OR FIREABLE(Change_10_2)) OR FIREABLE(Change_3_10)) OR FIREABLE(Change_10_3)) OR FIREABLE(Change_5_7)) OR FIREABLE(Change_6_1)) OR FIREABLE(Change_4_5)) OR FIREABLE(Change_1_4)) OR FIREABLE(Change_3_5)) OR FIREABLE(Change_9_9)) OR FIREABLE(Change_2_7)) OR FIREABLE(Change... (shortened)
lola: formula length: 160417
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(Change_7_2) AND (! FIREABLE(Change_10_2) AND (! FIREABLE(Change_3_10) AND (! FIREABLE(Change_10_3) AND (! FIREABLE(Change_5_7) AND (! FIREABLE(Change_6_1) AND (! FIREABLE(Change_4_5) AND (! FIREABLE(Change_1_4) AND (! FIREABLE(Change_3_5) AND (! FIREABLE(Change_9_9) AND (! FIREABLE(Change_2_7) AND (! FIREABLE(Change_4_4) AND (! FIREABLE(Change_1_8) AND (! FIREABLE(Change_2_2) AN... (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 2800 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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(Update_6_3) AND (! FIREABLE(Update_1_3) AND (! FIREABLE(Update_5_4) AND (! FIREABLE(Update_2_2) AND (! FIREABLE(Update_8_7) AND (! FIREABLE(Update_9_5) AND (! FIREABLE(Update_4_6) AND (! FIREABLE(Update_3_7) AND (! FIREABLE(Update_10_4) AND (! FIREABLE(Update_1_10) AND (! FIREABLE(Update_4_1) AND (! FIREABLE(Update_7_8) AND (! FIREABLE(Update_6_10) AND (! FIREABLE(Update_2_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 2800 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: AG ((FIREABLE(Start_3_8) OR (FIREABLE(Start_4_4) OR (FIREABLE(Start_5_5) OR (FIREABLE(Start_7_2) OR (FIREABLE(Start_1_1) OR (FIREABLE(Start_2_7) OR (FIREABLE(Start_5_10) OR (FIREABLE(Start_6_1) OR (FIREABLE(Start_5_6) OR (FIREABLE(Start_9_9) OR (FIREABLE(Start_2_10) OR (FIREABLE(Start_3_6) OR (FIREABLE(Start_8_6) OR (FIREABLE(Start_2_8) OR (FIREABLE(Start_6_2) OR (FIREABLE(Start_8_8) 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 2800 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(Acquire_7_6) AND (! FIREABLE(Acquire_5_6) AND (! FIREABLE(Acquire_8_5) AND (! FIREABLE(Acquire_8_10) AND (! FIREABLE(Acquire_2_7) AND (! FIREABLE(Acquire_7_2) AND (! FIREABLE(Acquire_6_1) AND (! FIREABLE(Acquire_8_3) AND (! FIREABLE(Acquire_5_5) AND (! FIREABLE(Acquire_3_3) AND (! FIREABLE(Acquire_5_9) AND (! FIREABLE(Acquire_1_4) AND (! FIREABLE(Acquire_8_7) AND (! FIREABLE(Acqu... (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 2800 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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Acquire_7_6) OR (FIREABLE(Acquire_5_6) OR (FIREABLE(Acquire_8_5) OR (FIREABLE(Acquire_8_10) OR (FIREABLE(Acquire_2_7) OR (FIREABLE(Acquire_7_2) OR (FIREABLE(Acquire_6_1) OR (FIREABLE(Acquire_8_3) OR (FIREABLE(Acquire_5_5) OR (FIREABLE(Acquire_3_3) OR (FIREABLE(Acquire_5_9) OR (FIREABLE(Acquire_1_4) OR (FIREABLE(Acquire_8_7) OR (FIREABLE(Acquire_10_2) OR (FIREABLE(Acquire_4_4) OR (FIR... (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 2800 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Update_6_3) AND (! FIREABLE(Update_1_3) AND (! FIREABLE(Update_5_4) AND (! FIREABLE(Update_2_2) AND (! FIREABLE(Update_8_7) AND (! FIREABLE(Update_9_5) AND (! FIREABLE(Update_4_6) AND (! FIREABLE(Update_3_7) AND (! FIREABLE(Update_10_4) AND (! FIREABLE(Update_1_10) AND (! FIREABLE(Update_4_1) AND (! FIREABLE(Update_7_8) AND (! FIREABLE(Update_6_10) AND (! FIREABLE(Update_2_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 2800 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 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Release_6_4) AND (! FIREABLE(Release_4_5) AND (! FIREABLE(Release_8_8) AND (! FIREABLE(Release_9_6) AND (! FIREABLE(Release_1_4) AND (! FIREABLE(Release_7_1) AND (! FIREABLE(Release_10_5) AND (! FIREABLE(Release_3_8) AND (! FIREABLE(Release_5_5) AND (! FIREABLE(Release_2_3) AND (! FIREABLE(Release_8_6) AND (! FIREABLE(Release_2_10) AND (! FIREABLE(Release_2_8) AND (! FIREABLE(Rele... (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 2800 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 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Start_3_8) AND (! FIREABLE(Start_4_4) AND (! FIREABLE(Start_5_5) AND (! FIREABLE(Start_7_2) AND (! FIREABLE(Start_1_1) AND (! FIREABLE(Start_2_7) AND (! FIREABLE(Start_5_10) AND (! FIREABLE(Start_6_1) AND (! FIREABLE(Start_5_6) AND (! FIREABLE(Start_9_9) AND (! FIREABLE(Start_2_10) AND (! FIREABLE(Start_3_6) AND (! FIREABLE(Start_8_6) AND (! FIREABLE(Start_2_8) 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 2800 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 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Update_6_3) OR (FIREABLE(Update_1_3) OR (FIREABLE(Update_5_4) OR (FIREABLE(Update_2_2) OR (FIREABLE(Update_8_7) OR (FIREABLE(Update_9_5) OR (FIREABLE(Update_4_6) OR (FIREABLE(Update_3_7) OR (FIREABLE(Update_10_4) OR (FIREABLE(Update_1_10) OR (FIREABLE(Update_4_1) OR (FIREABLE(Update_7_8) OR (FIREABLE(Update_6_10) OR (FIREABLE(Update_2_9) OR (FIREABLE(Update_2_4) OR (FIREABLE(Update_9... (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 2800 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 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(SendReply_9_2) OR (FIREABLE(SendReply_5_10) OR (FIREABLE(SendReply_5_1) OR (FIREABLE(SendReply_4_3) OR (FIREABLE(SendReply_7_9) OR (FIREABLE(SendReply_10_8) OR (FIREABLE(SendReply_3_4) OR (FIREABLE(SendReply_8_4) OR (FIREABLE(SendReply_9_8) OR (FIREABLE(SendReply_7_7) OR (FIREABLE(SendReply_2_6) OR (FIREABLE(SendReply_6_8) OR (FIREABLE(SendReply_10_10) OR (FIREABLE(SendReply_8_5) 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 2800 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 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(Start_3_8) OR (FIREABLE(Start_4_4) OR (FIREABLE(Start_5_5) OR (FIREABLE(Start_7_2) OR (FIREABLE(Start_1_1) OR (FIREABLE(Start_2_7) OR (FIREABLE(Start_5_10) OR (FIREABLE(Start_6_1) OR (FIREABLE(Start_5_6) OR (FIREABLE(Start_9_9) OR (FIREABLE(Start_2_10) OR (FIREABLE(Start_3_6) OR (FIREABLE(Start_8_6) OR (FIREABLE(Start_2_8) OR (FIREABLE(Start_6_2) OR (FIREABLE(Start_8_8) OR (FIREABL... (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 2800 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 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(SendReply_9_2) AND (! FIREABLE(SendReply_5_10) AND (! FIREABLE(SendReply_5_1) AND (! FIREABLE(SendReply_4_3) AND (! FIREABLE(SendReply_7_9) AND (! FIREABLE(SendReply_10_8) AND (! FIREABLE(SendReply_3_4) AND (! FIREABLE(SendReply_8_4) AND (! FIREABLE(SendReply_9_8) AND (! FIREABLE(SendReply_7_7) AND (! FIREABLE(SendReply_2_6) AND (! FIREABLE(SendReply_6_8) AND (! FIREABLE(SendRepl... (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 2800 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 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Update_6_3) AND (! FIREABLE(Update_1_3) AND (! FIREABLE(Update_5_4) AND (! FIREABLE(Update_2_2) AND (! FIREABLE(Update_8_7) AND (! FIREABLE(Update_9_5) AND (! FIREABLE(Update_4_6) AND (! FIREABLE(Update_3_7) AND (! FIREABLE(Update_10_4) AND (! FIREABLE(Update_1_10) AND (! FIREABLE(Update_4_1) AND (! FIREABLE(Update_7_8) AND (! FIREABLE(Update_6_10) AND (! FIREABLE(Update_2_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 2800 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 16554675731956117818633293475298657131183735241950331789274775552 literals
lola: DNF formula is too big, sara cannot be used
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 991 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(SendReply_9_2) AND (! FIREABLE(SendReply_5_10) AND (! FIREABLE(SendReply_5_1) AND (! FIREABLE(SendReply_4_3) AND (! FIREABLE(SendReply_7_9) AND (! FIREABLE(SendReply_10_8) AND (! FIREABLE(SendReply_3_4) AND (! FIREABLE(SendReply_8_4) AND (! FIREABLE(SendReply_9_8) AND (! FIREABLE(SendReply_7_7) AND (! FIREABLE(SendReply_2_6) AND (! FIREABLE(SendReply_6_8) AND (! FIREABLE(SendReply... (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 2800 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 14 will run for 1487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Start_3_8) AND (! FIREABLE(Start_4_4) AND (! FIREABLE(Start_5_5) AND (! FIREABLE(Start_7_2) AND (! FIREABLE(Start_1_1) AND (! FIREABLE(Start_2_7) AND (! FIREABLE(Start_5_10) AND (! FIREABLE(Start_6_1) AND (! FIREABLE(Start_5_6) AND (! FIREABLE(Start_9_9) AND (! FIREABLE(Start_2_10) AND (! FIREABLE(Start_3_6) AND (! FIREABLE(Start_8_6) AND (! FIREABLE(Start_2_8) 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 2800 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 2975 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(SendMsg_1_10) OR (FIREABLE(SendMsg_4_5) OR (FIREABLE(SendMsg_1_7) OR (FIREABLE(SendMsg_5_1) OR (FIREABLE(SendMsg_3_4) OR (FIREABLE(SendMsg_9_1) OR (FIREABLE(SendMsg_7_5) OR (FIREABLE(SendMsg_7_8) OR (FIREABLE(SendMsg_7_4) OR (FIREABLE(SendMsg_5_10) OR (FIREABLE(SendMsg_6_2) OR (FIREABLE(SendMsg_5_6) OR (FIREABLE(SendMsg_2_9) OR (FIREABLE(SendMsg_2_7) OR (FIREABLE(SendMsg_8_7) OR (FIR... (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 2800 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: RESULT
lola: summary: yes yes no yes no yes no yes yes yes no yes unknown no yes no

BK_STOP 1463507249082

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