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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014kn-qhx2-146347846400187
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463506283984

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ DatabaseWithMutex-PT-10
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-10-ReachabilityCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-ReachabilityCardinality.task
lola: read: AG (MesBuffReply_2_4 + MesBuffReply_4_1 + MesBuffReply_2_9 + MesBuffReply_2_10 + MesBuffReply_1_2 + MesBuffReply_5_3 + MesBuffReply_8_6 + MesBuffReply_5_6 + MesBuffReply_3_6 + MesBuffReply_9_4 + MesBuffReply_4_7 + MesBuffReply_3_9 + MesBuffReply_6_5 + MesBuffReply_9_8 + MesBuffReply_1_4 + MesBuffReply_5_1 + MesBuffReply_2_8 + MesBuffReply_7_2 + MesBuffReply_9_2 + MesBuffReply_5_7 + MesBuffReply_6_... (shortened)
lola: formula length: 92589
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 (MesBuffReply_8_9 + MesBuffReply_6_10 + MesBuffReply_9_1 + MesBuffReply_9_2 + MesBuffReply_9_3 + MesBuffReply_9_4 + MesBuffReply_9_5 + MesBuffReply_9_6 + MesBuffReply_9_7 + MesBuffReply_5_10 + MesBuffReply_9_8 + MesBuffReply_9_9 + -all_active_3 + -all_active_7 + -all_active_9 + MesBuffReply_10_9 + MesBuffReply_10_8 + MesBuffReply_10_7 + MesBuffReply_10_6 + MesBuffReply_10_5 + MesBuffReply_10_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 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 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-10-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((Message_4_10 + -Mutex_9 + -Mutex_8 + -Mutex_7 + -Mutex_6 + -Mutex_5 + -Mutex_4 + -Mutex_3 + -Mutex_2 + -Mutex_1 + Message_5_10 + Message_10_9 + Message_10_8 + Message_10_7 + Message_10_6 + Message_10_5 + Message_10_4 + Message_10_3 + Message_10_2 + Message_10_1 + -Mutex_10 + Message_9_9 + Message_9_8 + Message_9_7 + Message_9_6 + Message_9_5 + Message_9_4 + Message_9_3 + Message_9_2 + Messag... (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 5 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: AG (updating_5_9 + updating_5_8 + updating_5_7 + updating_5_6 + updating_5_5 + updating_5_4 + updating_5_3 + updating_5_2 + updating_5_1 + updating_9_10 + updating_8_10 + updating_1_9 + updating_1_10 + updating_4_9 + updating_4_8 + updating_4_7 + updating_4_6 + updating_4_5 + updating_4_4 + updating_4_3 + updating_4_2 + updating_4_1 + -all_active_3 + -all_active_7 + -all_active_9 + updating_2_9 + ... (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: Transformation into DNF: expect 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-10-ReachabilityCardinality-2.sara
lola: calling and running sara
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 ((-updating_5_9 + -updating_5_8 + -updating_5_7 + -updating_5_6 + -updating_5_5 + -updating_5_4 + -updating_5_3 + -updating_5_2 + -updating_5_1 + -updating_9_10 + -updating_8_10 + -updating_1_9 + -updating_1_10 + -updating_4_9 + -updating_4_8 + -updating_4_7 + -updating_4_6 + -updating_4_5 + -updating_4_4 + -updating_4_3 + -updating_4_2 + -updating_4_1 + -updating_2_9 + -updating_3_9 + -updatin... (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 3 literals
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: EF ((((-Modify_2_10 + MesBuffReply_8_9 + MesBuffReply_6_10 + MesBuffReply_9_1 + MesBuffReply_9_2 + MesBuffReply_9_3 + MesBuffReply_9_4 + MesBuffReply_9_5 + MesBuffReply_9_6 + MesBuffReply_9_7 + MesBuffReply_5_10 + MesBuffReply_9_8 + MesBuffReply_9_9 + -Modify_10_10 + MesBuffReply_10_9 + MesBuffReply_10_8 + MesBuffReply_10_7 + MesBuffReply_10_6 + MesBuffReply_10_5 + MesBuffReply_10_4 + MesBuffReply... (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 6 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Mutex_9 + -Mutex_8 + -Mutex_7 + -Mutex_6 + -Mutex_5 + -Mutex_4 + -Mutex_3 + -Mutex_2 + -Mutex_1 + -Mutex_10 > -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-10-ReachabilityCardinality-5.sara
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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file DatabaseWithMutex-COL-10-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((MesBuffReply_8_9 + MesBuffReply_6_10 + -Acknowledge_7_9 + -Acknowledge_7_8 + -Acknowledge_7_7 + -Acknowledge_7_6 + -Acknowledge_7_5 + -Acknowledge_7_4 + -Acknowledge_7_3 + -Acknowledge_7_2 + -Acknowledge_7_1 + -Acknowledge_4_9 + MesBuffReply_9_1 + MesBuffReply_9_2 + MesBuffReply_9_3 + MesBuffReply_9_4 + MesBuffReply_9_5 + MesBuffReply_9_6 + MesBuffReply_9_7 + MesBuffReply_5_10 + -Acknowledge... (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 10 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Message_4_10 + Mutex_9 + Mutex_8 + Mutex_7 + Mutex_6 + Mutex_5 + Mutex_4 + Mutex_3 + Mutex_2 + Mutex_1 + -Message_5_10 + -Message_10_9 + -Message_10_8 + -Message_10_7 + -Message_10_6 + -Message_10_5 + -Message_10_4 + -Message_10_3 + -Message_10_2 + -Message_10_1 + Mutex_10 + -Message_9_9 + -Message_9_8 + -Message_9_7 + -Message_9_6 + -Message_9_5 + -Message_9_4 + -Message_9_3 + -Message_9_2 ... (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: Transformation into DNF: expect 2 literals
lola: write sara problem file to DatabaseWithMutex-COL-10-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file DatabaseWithMutex-COL-10-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((RecBuff_9_10 + RecBuff_2_9 + RecBuff_2_8 + RecBuff_2_7 + RecBuff_2_6 + RecBuff_2_5 + RecBuff_2_4 + RecBuff_2_3 + RecBuff_2_2 + RecBuff_2_1 + -Mutex_9 + -Mutex_8 + -Mutex_7 + -Mutex_6 + -Mutex_5 + -Mutex_4 + -Mutex_3 + -Mutex_2 + -Mutex_1 + RecBuff_8_10 + RecBuff_1_9 + RecBuff_1_8 + RecBuff_1_7 + RecBuff_1_6 + RecBuff_1_5 + RecBuff_1_4 + RecBuff_1_3 + RecBuff_1_2 + RecBuff_1_1 + RecBuff_3_10 +... (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: Transformation into DNF: expect 4 literals
lola: write sara problem file to DatabaseWithMutex-COL-10-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Modify_2_10 + -Modify_10_10 + -Modify_8_10 + -Modify_3_10 + -Modify_9_9 + -Modify_9_8 + -Modify_9_7 + -Modify_9_6 + -Modify_9_5 + -Modify_9_4 + -Modify_9_3 + -Modify_9_2 + -Modify_9_1 + -Modify_9_10 + -Modify_8_9 + -Modify_8_8 + -Modify_8_7 + -Modify_8_6 + -Modify_8_5 + -Modify_8_4 + -Modify_8_3 + -Modify_8_2 + -Modify_8_1 + -Modify_4_10 + -Modify_7_9 + -Modify_7_8 + -Modify_7_7 + -Modify_7_6... (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 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-10-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-WaitMutex_10_9 + -WaitMutex_6_9 + -WaitMutex_5_9 + -WaitMutex_4_9 + -WaitMutex_6_10 + -WaitMutex_4_8 + -WaitMutex_4_7 + -WaitMutex_4_6 + -WaitMutex_4_5 + -WaitMutex_4_4 + -WaitMutex_4_3 + -WaitMutex_4_2 + -WaitMutex_4_1 + -WaitMutex_5_1 + -WaitMutex_5_2 + -WaitMutex_5_3 + -WaitMutex_5_4 + -WaitMutex_5_5 + -WaitMutex_5_6 + -WaitMutex_5_7 + -WaitMutex_5_8 + -WaitMutex_6_1 + -WaitMutex_6_2 + -W... (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 4 literals
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: AG (((-MesBuffReply_8_9 + -MesBuffReply_6_10 + -MesBuffReply_9_1 + -MesBuffReply_9_2 + -MesBuffReply_9_3 + -MesBuffReply_9_4 + -MesBuffReply_9_5 + -MesBuffReply_9_6 + -MesBuffReply_9_7 + -MesBuffReply_5_10 + -MesBuffReply_9_8 + -MesBuffReply_9_9 + -MesBuffReply_10_9 + -MesBuffReply_10_8 + -MesBuffReply_10_7 + -MesBuffReply_10_6 + -MesBuffReply_10_5 + -MesBuffReply_10_4 + -MesBuffReply_10_3 + -MesB... (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: Transformation into DNF: expect 12 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Active_1_9 + -Active_1_8 + -Active_1_7 + -Active_1_6 + -Active_1_5 + -Active_1_4 + -Active_1_3 + -Active_1_2 + -Active_1_1 + updating_5_9 + updating_5_8 + updating_5_7 + updating_5_6 + updating_5_5 + updating_5_4 + updating_5_3 + updating_5_2 + updating_5_1 + updating_9_10 + updating_8_10 + updating_1_9 + updating_1_10 + updating_4_9 + updating_4_8 + updating_4_7 + updating_4_6 + updating_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 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 10 literals
lola: write sara problem file to DatabaseWithMutex-COL-10-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file DatabaseWithMutex-COL-10-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Mutex_9 + -Mutex_8 + -Mutex_7 + -Mutex_6 + -Mutex_5 + -Mutex_4 + -Mutex_3 + -Mutex_2 + -Mutex_1 + -Mutex_10 > -2 OR (-Active_1_9 + -Active_1_8 + -Active_1_7 + -Active_1_6 + -Active_1_5 + -Active_1_4 + -Active_1_3 + -Active_1_2 + -Active_1_1 + -Active_10_10 + -Active_10_9 + -Active_5_10 + -Active_10_8 + -Active_10_7 + -Active_10_6 + -Active_10_5 + -Active_10_4 + -Active_10_3 + -Active_10_2 + ... (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: Transformation into DNF: expect 3 literals
lola: SUBRESULT
lola: result: no
lola: write sara problem file to DatabaseWithMutex-COL-10-ReachabilityCardinality-14.sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Modify_2_10 + all_passive_6 + all_passive_10 + -Modify_10_10 + -Modify_8_10 + -Modify_3_10 + -Modify_9_9 + -Modify_9_8 + -Modify_9_7 + -Modify_9_6 + -Modify_9_5 + -Modify_9_4 + -Modify_9_3 + -Modify_9_2 + -Modify_9_1 + -Modify_9_10 + -Modify_8_9 + -Modify_8_8 + -Modify_8_7 + -Modify_8_6 + -Modify_8_5 + -Modify_8_4 + -Modify_8_3 + -Modify_8_2 + -Modify_8_1 + -Modify_4_10 + -Modify_7_9 + -Modif... (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 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-10-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: no yes no yes yes yes yes yes yes no yes yes no yes no yes
lola: ========================================

BK_STOP 1463506291237

--------------------
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="ReachabilityCardinality"
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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r014kn-qhx2-146347846400187"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;