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

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

=== Now, execution of the tool begins

BK_START 1463509069289

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ DatabaseWithMutex-PT-20
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-20-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: 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-ReachabilityCardinality.task
lola: read: EF ((!(!(1 <= Acknowledge_16_13 + Acknowledge_8_1 + Acknowledge_11_13 + Acknowledge_5_14 + Acknowledge_2_13 + Acknowledge_4_19 + Acknowledge_15_19 + Acknowledge_18_15 + Acknowledge_7_18 + Acknowledge_19_14 + Acknowledge_7_5 + Acknowledge_11_17 + Acknowledge_3_1 + Acknowledge_5_5 + Acknowledge_18_4 + Acknowledge_8_7 + Acknowledge_12_20 + Acknowledge_12_5 + Acknowledge_5_10 + Acknowledge_4_15 + Ackn... (shortened)
lola: formula length: 352907
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 215 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Acknowledge_19_19 + -Acknowledge_19_18 + -Acknowledge_19_17 + -Acknowledge_19_16 + -Acknowledge_19_15 + -Acknowledge_19_14 + -Acknowledge_19_13 + -Acknowledge_19_12 + -Acknowledge_19_11 + -Acknowledge_19_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_3... (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: Transformation into DNF: expect 3 literals
lola: write sara problem file to DatabaseWithMutex-COL-20-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Active_15_20 + -Active_15_19 + -Active_15_18 + -Active_15_17 + -Active_15_16 + -Active_15_15 + -Active_15_14 + -Active_15_13 + -Active_15_12 + -Active_15_11 + -Active_15_10 + -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_13_9 + -Active_13_8 + -Active_13_7 + -Active_13_6 + -Active_13_5 + -Active_13_4 + -Act... (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: Transformation into DNF: expect 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-20-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Modify_2_20 + -Modify_2_19 + -Modify_2_18 + -Modify_2_17 + -Modify_2_16 + -Modify_2_15 + -Modify_2_14 + -Modify_2_13 + -Modify_2_12 + -Modify_2_11 + -Modify_2_10 + -Modify_14_9 + -Modify_19_9 + -Modify_15_20 + -Modify_8_20 + -Modify_18_9 + -Modify_18_1 + -Modify_18_2 + -Modify_18_3 + -Modify_18_4 + -Modify_18_5 + -Modify_18_6 + -Modify_18_7 + -Modify_18_8 + -Modify_8_10 + -Modify_8_11 + -Mod... (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: Transformation into DNF: expect 4 literals
lola: write sara problem file to DatabaseWithMutex-COL-20-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file DatabaseWithMutex-COL-20-ReachabilityCardinality-2.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 3 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Active_15_20 + -Active_15_19 + -Active_15_18 + -Active_15_17 + -Active_15_16 + -Active_15_15 + -Active_15_14 + -Active_15_13 + -Active_15_12 + -Active_15_11 + -Active_15_10 + -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_13_9 + -Active_13_8 + -Active_13_7 + -Active_13_6 + -Active_13_5 + -Active_13_4 + -Ac... (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: Transformation into DNF: expect 2 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Message_12_10 + -Message_12_11 + -Message_12_12 + -Message_12_13 + -Message_12_14 + -Message_12_15 + -Message_4_20 + -Message_4_19 + -Message_4_18 + -Message_4_17 + -Message_4_16 + -Message_4_15 + -Message_4_14 + -Message_4_13 + -Message_4_12 + -Message_4_11 + -Message_4_10 + -Message_14_9 + -Message_14_8 + -Message_14_7 + -Message_14_6 + -Message_14_5 + -Message_14_4 + -Message_14_3 + -Mess... (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: Transformation into DNF: expect 6 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Active_15_20 + -Active_15_19 + -Active_15_18 + -Active_15_17 + -Active_15_16 + -Active_15_15 + -Active_15_14 + -Active_15_13 + -Active_15_12 + -Active_15_11 + -Active_15_10 + -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_13_9 + -Active_13_8 + -Active_13_7 + -Active_13_6 + -Active_13_5 + -Active_13_4 + -Act... (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: Transformation into DNF: expect 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-20-ReachabilityCardinality-5.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((RecBuff_19_20 + -Message_12_10 + -Message_12_11 + -Message_12_12 + -Message_12_13 + -Message_12_14 + -Message_12_15 + -Message_4_20 + -Message_4_19 + -Message_4_18 + -Message_4_17 + -Message_4_16 + -Message_4_15 + -Message_4_14 + -Message_4_13 + -Message_4_12 + -Message_4_11 + -Message_4_10 + -Message_14_9 + -Message_14_8 + -Message_14_7 + -Message_14_6 + -Message_14_5 + -Message_14_4 + -Mess... (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: Transformation into DNF: expect 2 literals
lola: write sara problem file to DatabaseWithMutex-COL-20-ReachabilityCardinality-6.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Modify_2_20 + -Modify_2_19 + -Modify_2_18 + -Modify_2_17 + -Modify_2_16 + -Modify_2_15 + -Modify_2_14 + -Modify_2_13 + -Modify_2_12 + -Modify_2_11 + -Modify_2_10 + -Modify_14_9 + -Modify_19_9 + -Modify_15_20 + -Modify_8_20 + -Modify_18_9 + -Modify_18_1 + -Modify_18_2 + -Modify_18_3 + -Modify_18_4 + -Modify_18_5 + -Modify_18_6 + -Modify_18_7 + -Modify_18_8 + -Modify_8_10 + -Modify_8_11 + -Mod... (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: Transformation into DNF: expect 2 literals
lola: write sara problem file to DatabaseWithMutex-COL-20-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-all_active_3 + -all_active_7 + -all_active_9 + -all_active_8 + -all_active_6 + -all_active_5 + -all_active_4 + -all_active_2 + -all_active_1 + -all_active_20 + -all_active_19 + -all_active_18 + -all_active_17 + -all_active_16 + -all_active_15 + -all_active_14 + -all_active_13 + -all_active_12 + -all_active_11 + -all_active_10 <= -2 OR (-Active_15_20 + -Active_15_19 + -Active_15_18 + -Active_... (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: Transformation into DNF: expect 15 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((all_passive_6 + all_passive_10 + all_passive_11 + all_passive_12 + all_passive_13 + all_passive_16 + -Message_12_10 + -Message_12_11 + -Message_12_12 + -Message_12_13 + -Message_12_14 + -Message_12_15 + -Message_4_20 + -Message_4_19 + -Message_4_18 + -Message_4_17 + -Message_4_16 + -Message_4_15 + -Message_4_14 + -Message_4_13 + -Message_4_12 + -Message_4_11 + -Message_4_10 + -Message_14_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 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 10 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Active_15_20 + Active_15_19 + Active_15_18 + Active_15_17 + Active_15_16 + Active_15_15 + Active_15_14 + Active_15_13 + Active_15_12 + Active_15_11 + Active_15_10 + 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_13_9 + Active_13_8 + Active_13_7 + Active_13_6 + Active_13_5 + Active_13_4 + Active_13_3 + Active_13_2 + Ac... (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: Transformation into DNF: expect 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-20-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (all_passive_6 + all_passive_10 + all_passive_11 + all_passive_12 + all_passive_13 + all_passive_16 + -MesBuffReply_7_20 + -MesBuffReply_5_20 + -MesBuffReply_5_19 + -MesBuffReply_5_18 + -MesBuffReply_5_17 + -MesBuffReply_5_16 + -MesBuffReply_5_15 + -MesBuffReply_5_14 + -MesBuffReply_5_13 + -MesBuffReply_5_12 + -MesBuffReply_5_11 + -MesBuffReply_5_10 + -MesBuffReply_11_9 + -MesBuffReply_11_8 + -... (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: Transformation into DNF: expect 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-20-ReachabilityCardinality-11.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 858 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_20 + -updating_15_20 + -updating_17_9 + -updating_18_9 + -updating_20_9 + -updating_20_8 + -updating_20_7 + -updating_20_6 + -updating_20_5 + -updating_20_4 + -updating_20_3 + -updating_20_2 + -updating_20_1 + -updating_1_20 + -updating_... (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: Transformation into DNF: expect 8 literals
lola: write sara problem file to DatabaseWithMutex-COL-20-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: calling and running sara
lola: ========================================
lola: subprocess 13 will run for 1144 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_20 + -Mutex_19 + -Mutex_18 + -Mutex_17 + -Mutex_16 + -Mutex_15 + -Mutex_14 + -Mutex_13 + -Mutex_12 + -Mutex_11 + -Mutex_10 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file DatabaseWithMutex-COL-20-ReachabilityCardinality-12.sara.
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: Transformation into DNF: expect 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-20-ReachabilityCardinality-13.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1716 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-all_passive_6 + -all_passive_10 + -all_passive_11 + -all_passive_12 + -all_passive_13 + -all_passive_16 + -all_passive_20 + -all_passive_19 + -all_passive_18 + -all_passive_17 + -all_passive_15 + -all_passive_14 + -all_passive_9 + -all_passive_8 + -all_passive_7 + -all_passive_5 + -all_passive_4 + -all_passive_3 + -all_passive_2 + -all_passive_1 <= -3 AND (updating_5_9 + updating_5_8 + updat... (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 3432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Acknowledge_19_19 + -Acknowledge_19_18 + -Acknowledge_19_17 + -Acknowledge_19_16 + -Acknowledge_19_15 + -Acknowledge_19_14 + -Acknowledge_19_13 + -Acknowledge_19_12 + -Acknowledge_19_11 + -Acknowledge_19_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_3_... (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: Transformation into DNF: expect 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-20-ReachabilityCardinality-15.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: yes yes yes yes no no yes no no no no yes yes no yes yes

BK_STOP 1463509177820

--------------------
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="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-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 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-146347846400196"
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 ;