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 Philosophers-PT-000020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088400340
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463703771800

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ Philosophers-PT-000020
FORMULA Philosophers-COL-000020-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000020-ReachabilityCardinality-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: 200/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 100 places, 100 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 140 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000020-ReachabilityCardinality.task
lola: read: EF (!(Fork_1 + Fork_3 + Fork_2 + Fork_5 + Fork_4 + Fork_7 + Fork_6 + Fork_9 + Fork_8 + Fork_12 + Fork_13 + Fork_10 + Fork_11 + Fork_16 + Fork_17 + Fork_14 + Fork_15 + Fork_20 + Fork_18 + Fork_19 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 + Think_10 + Think_11 + Think_12 + Think_13 + Think_15 + Think_14 + Think_17 + Think_16 + Think_19 + Think_18 + Th... (shortened)
lola: formula length: 18894
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 (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + -Think_12 + -Think_11 + -Think_10 + Fork_20 + Fork_19 + Fork_18 + Fork_17 + Fork_16 + Fork_15 + Fork_14 + Fork_13 + Fork_12 + Fork_11 + Fork_10 + Fork_9 + Fork_8 + Fork_7 + Fork_6 + Fork_5 + Fork_4 + F... (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 8 bytes per marking, with 4 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 Philosophers-COL-000020-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file Philosophers-COL-000020-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + -Think_12 + -Think_11 + -Think_10 + Fork_20 + Fork_19 + Fork_18 + Fork_17 + Fork_16 + Fork_15 + Fork_14 + Fork_13 + Fork_12 + Fork_11 + Fork_10 + Fork_9 + Fork_8 + Fork_7 + Fork_6 + Fork_5 + Fork_4 + F... (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 8 bytes per marking, with 4 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 Philosophers-COL-000020-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file Philosophers-COL-000020-ReachabilityCardinality.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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_20 + -Eat_19 + -Eat_18 + -Eat_17 + -Eat_16 + -Eat_15 + -Eat_14 + -Eat_13 + -Eat_12 + -Eat_11 + -Eat_10 <= -1 AND -Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + ... (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 8 bytes per marking, with 4 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 20 literals
lola: write sara problem file to Philosophers-COL-000020-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file Philosophers-COL-000020-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 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_20 + -Catch1_19 + -Catch1_18 + -Catch1_17 + -Catch1_16 + -Catch1_15 + -Catch1_14 + -Catch1_13 + -Catch1_12 + -Catch1_11 + -Catch1_10 <= -3 AND (Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + Think_20 + Think_19 + Think_18 + Think_17 + T... (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 8 bytes per marking, with 4 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 Philosophers-COL-000020-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file Philosophers-COL-000020-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_20 + -Eat_19 + -Eat_18 + -Eat_17 + -Eat_16 + -Eat_15 + -Eat_14 + -Eat_13 + -Eat_12 + -Eat_11 + -Eat_10 <= -2 AND -Catch2_20 + -Catch2_19 + -Catch2_18 + -Catch2_17 + -Catch2_16 + -Catch2_15 + -Catch2_14 + -Catch2_13 + -Catch2_12 + -Catch2_11 + -Catch2_10 + -Catch2_9 + -Catch2_8 + -Catch2_7 + -Catch2_6 + -Cat... (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 8 bytes per marking, with 4 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 Philosophers-COL-000020-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: calling and running sara
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Fork_20 + Fork_19 + Fork_18 + Fork_17 + Fork_16 + Fork_15 + Fork_14 + Fork_13 + Fork_12 + Fork_11 + Fork_10 + -Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + Fork_9 + Fork_8 + Fork_7 + Fork_6 + Fork_5 + Fork_4 + Fork_3 + Fork_2 + Fork_1 + -Catch1_20 + -Catch1_19 + -Catch1_18 + -Catch1_17 + -Catch1_16 + -Catch1_15 + -Catch1_14 + -Catch... (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 8 bytes per marking, with 4 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: sara: try reading problem file Philosophers-COL-000020-ReachabilityCardinality-4.sara.Transformation into DNF: expect 1 literals

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 ((-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_20 + -Eat_19 + -Eat_18 + -Eat_17 + -Eat_16 + -Eat_15 + -Eat_14 + -Eat_13 + -Eat_12 + -Eat_11 + -Eat_10 + Catch1_9 + Catch1_8 + Catch1_7 + Catch1_6 + Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 + Catch1_20 + Catch1_19 + Catch1_18 + Catch1_17 + Catch1_16 + Catch1_15 + Catch1_14 + Catch1_13 + Catch1_12... (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 8 bytes per marking, with 4 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: 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 ((-Fork_20 + -Fork_19 + -Fork_18 + -Fork_17 + -Fork_16 + -Fork_15 + -Fork_14 + -Fork_13 + -Fork_12 + -Fork_11 + -Fork_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -3 AND ((-Catch2_20 + -Catch2_19 + -Catch2_18 + -Catch2_17 + -Catch2_16 + -Catch2_15 + -Catch2_14 + -Catch2_13 + -Catch2_12 + -Catch2_11 + -Catch2_10 + -Catch2_9 + -Catch2_8 + -Catch2... (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 8 bytes per marking, with 4 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 Philosophers-COL-000020-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file Philosophers-COL-000020-ReachabilityCardinality-7.sara.

sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Fork_20 + -Fork_19 + -Fork_18 + -Fork_17 + -Fork_16 + -Fork_15 + -Fork_14 + -Fork_13 + -Fork_12 + -Fork_11 + -Fork_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -3 AND ((-Catch2_20 + -Catch2_19 + -Catch2_18 + -Catch2_17 + -Catch2_16 + -Catch2_15 + -Catch2_14 + -Catch2_13 + -Catch2_12 + -Catch2_11 + -Catch2_10 + -Catch2_9 + -Catch2_8 + -Catch2... (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 8 bytes per marking, with 4 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 19 literals
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + -Think_12 + -Think_11 + -Think_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat... (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 8 bytes per marking, with 4 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 Philosophers-COL-000020-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file Philosophers-COL-000020-ReachabilityCardinality-9.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 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + Think_20 + Think_19 + Think_18 + Think_17 + Think_16 + Think_15 + Think_14 + Think_13 + Think_12 + Think_11 + Think_10 + -Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_20 + -Catch1_19 + -Catch1_18 + -Catch1_17 + -Catch1_16 + -Catch1_15 +... (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 8 bytes per marking, with 4 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to Philosophers-COL-000020-ReachabilityCardinality-10.sara
lola: ========================================
lola: calling and running sara
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Catch2_20 + -Catch2_19 + -Catch2_18 + -Catch2_17 + -Catch2_16 + -Catch2_15 + -Catch2_14 + -Catch2_13 + -Catch2_12 + -Catch2_11 + -Catch2_10 + -Catch2_9 + -Catch2_8 + -Catch2_7 + -Catch2_6 + -Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 <= -1 AND (-Fork_20 + -Fork_19 + -Fork_18 + -Fork_17 + -Fork_16 + -Fork_15 + -Fork_14 + -Fork_13 + -Fork_12 + -Fork_11 + -Fork_10 + -Fork_9 + -For... (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 8 bytes per marking, with 4 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 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + -Think_12 + -Think_11 + -Think_10 > -1)
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 8 bytes per marking, with 4 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
sara: try reading problem file Philosophers-COL-000020-ReachabilityCardinality-10.sara.
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Fork_20 + -Fork_19 + -Fork_18 + -Fork_17 + -Fork_16 + -Fork_15 + -Fork_14 + -Fork_13 + -Fork_12 + -Fork_11 + -Fork_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 > -3 OR (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think... (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 8 bytes per marking, with 4 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 Philosophers-COL-000020-ReachabilityCardinality-13.sara
lola: calling and running saralola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Catch2_20 + -Catch2_19 + -Catch2_18 + -Catch2_17 + -Catch2_16 + -Catch2_15 + -Catch2_14 + -Catch2_13 + -Catch2_12 + -Catch2_11 + -Catch2_10 + Fork_20 + Fork_19 + Fork_18 + Fork_17 + Fork_16 + Fork_15 + Fork_14 + Fork_13 + Fork_12 + Fork_11 + Fork_10 + -Catch2_9 + -Catch2_8 + -Catch2_7 + -Catch2_6 + -Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 + Fork_9 + Fork_8 + Fork_7 + Fork_6 ... (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 8 bytes per marking, with 4 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 9 literals
lola: write sara problem file to Philosophers-COL-000020-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file Philosophers-COL-000020-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

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 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + Think_20 + Think_19 + Think_18 + Think_17 + Think_16 + Think_15 + Think_14 + Think_13 + Think_12 + Think_11 + Think_10 + -Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_20 + -Eat_19 + -Eat_18 + -Eat_17 + -Eat_16 + -Eat_15 + -Eat_14 + -Eat_13 + -Eat_12 + -Eat_11 + -... (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 8 bytes per marking, with 4 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 7 literals
lola: write sara problem file to Philosophers-COL-000020-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file Philosophers-COL-000020-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola: summary: no yes yes no no yes no no yes yes no yes yes yes yes no

BK_STOP 1463703773093

--------------------
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="Philosophers-PT-000020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 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 Philosophers-PT-000020, 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 r086kn-ebro-146369088400340"
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 ;