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

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

=== Now, execution of the tool begins

BK_START 1463704611095

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ Philosophers-PT-000050
FORMULA Philosophers-COL-000050-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-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: 500/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 250 places, 250 transitions, 150 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 350 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000050-ReachabilityCardinality.task
lola: read: EF ((((Catch1_3 + Catch1_2 + Catch1_5 + Catch1_4 + Catch1_1 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_37 + Catch1_36 + Catch1_35 + Catch1_34 + Catch1_33 + Catch1_32 + Catch1_31 + Catch1_30 + Catch1_29 + Catch1_28 + Catch1_27 + Catch1_26 + Catch1... (shortened)
lola: formula length: 32713
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_50 + -Think_49 + -Think_48 + -Think_47 + -Think_46 + -Think_45 + -Think_44 + -Think_43 + -Think_42 + -Think_41 + -Think_40 + -Think_39 + -Think_38 + -Think_37 + -Think_36 + -Think_35 + -Think_34 + -Think_33 + -Think_32 + -Think_31 + -Think_30 + -Think_29 + -Think_28 + -Think_27 + -Think_2... (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 20 bytes per marking, with 10 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 1 will run for 236 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_50 + -Think_49 + -Think_48 + -Think_47 + -Think_46 + -Think_45 + -Think_44 + -Think_43 + -Think_42 + -Think_41 + -Think_40 + -Think_39 + -Think_38 + -Think_37 + -Think_36 + -Think_35 + -Think_34 + -Think_33 + -Think_32 + -Think_31 + -Think_30 + -Think_29 + -Think_28 + -Think_27 + -Think_... (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 20 bytes per marking, with 10 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-000050-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Fork_50 + -Fork_49 + -Fork_48 + -Fork_47 + -Fork_46 + -Fork_45 + -Fork_44 + -Fork_43 + -Fork_42 + -Fork_41 + -Fork_40 + -Fork_39 + -Fork_38 + -Fork_37 + -Fork_36 + -Fork_35 + -Fork_34 + -Fork_33 + -Fork_32 + -Fork_31 + -Fork_30 + -Fork_29 + -Fork_28 + -Fork_27 + -Fork_26 + -Fork_25 + -Fork_24 + -Fork_23 + -Fork_22 + -Fork_21 + -Fork_20 + -Fork_19 + -Fork_18 + -Fork_17 + -Fork_16 + -Fork_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 20 bytes per marking, with 10 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-000050-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: AG (-Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_50 + -Catch1_49 + -Catch1_48 + -Catch1_47 + -Catch1_46 + -Catch1_45 + -Catch1_44 + -Catch1_43 + -Catch1_42 + -Catch1_41 + -Catch1_40 + -Catch1_39 + -Catch1_38 + -Catch1_37 + -Catch1_36 + -Catch1_35 + -Catch1_34 + -Catch1_33 + -Catch1_32 + -Catch1_31 + -Catch1_30 + -Catch1_29 + -C... (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 20 bytes per marking, with 10 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-000050-ReachabilityCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Fork_50 + Fork_49 + Fork_48 + Fork_47 + Fork_46 + Fork_45 + Fork_44 + Fork_43 + Fork_42 + Fork_41 + Fork_40 + Fork_39 + Fork_38 + Fork_37 + Fork_36 + Fork_35 + Fork_34 + Fork_33 + Fork_32 + Fork_31 + Fork_30 + Fork_29 + Fork_28 + Fork_27 + Fork_26 + Fork_25 + Fork_24 + Fork_23 + Fork_22 + Fork_21 + Fork_20 + Fork_19 + Fork_18 + Fork_17 + Fork_16 + Fork_15 + Fork_14 + Fork_13 + Fork_12 + Fork_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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-000050-ReachabilityCardinality-4.sara
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: AG (-Catch2_50 + -Catch2_49 + -Catch2_48 + -Catch2_47 + -Catch2_46 + -Catch2_45 + -Catch2_44 + -Catch2_43 + -Catch2_42 + -Catch2_41 + -Catch2_40 + -Catch2_39 + -Catch2_38 + -Catch2_37 + -Catch2_36 + -Catch2_35 + -Catch2_34 + -Catch2_33 + -Catch2_32 + -Catch2_31 + -Catch2_30 + -Catch2_29 + -Catch2_28 + -Catch2_27 + -Catch2_26 + -Catch2_25 + -Catch2_24 + -Catch2_23 + -Catch2_22 + -Catch2_21 + -Catch... (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 20 bytes per marking, with 10 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-000050-ReachabilityCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + Fork_50 + Fork_49 + Fork_48 + Fork_47 + Fork_46 + Fork_45 + Fork_44 + Fork_43 + Fork_42 + Fork_41 + Fork_40 + Fork_39 + Fork_38 + Fork_37 + Fork_36 + Fork_35 + Fork_34 + Fork_33 + Fork_32 + Fork_31 + Fork_30 + Fork_29 + Fork_28 + Fork_27 + Fork_26 + Fork_25 + Fork_24 + Fork_23 + Fork_22 + Fork_21 + Fork_20 + Fork_... (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 20 bytes per marking, with 10 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Fork_50 + -Fork_49 + -Fork_48 + -Fork_47 + -Fork_46 + -Fork_45 + -Fork_44 + -Fork_43 + -Fork_42 + -Fork_41 + -Fork_40 + -Fork_39 + -Fork_38 + -Fork_37 + -Fork_36 + -Fork_35 + -Fork_34 + -Fork_33 + -Fork_32 + -Fork_31 + -Fork_30 + -Fork_29 + -Fork_28 + -Fork_27 + -Fork_26 + -Fork_25 + -Fork_24 + -Fork_23 + -Fork_22 + -Fork_21 + -Fork_20 + -Fork_19 + -Fork_18 + -Fork_17 + -Fork_16 + -Fork_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 20 bytes per marking, with 10 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 Philosophers-COL-000050-ReachabilityCardinality-7.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + -Fork_50 + -Fork_49 + -Fork_48 + -Fork_47 + -Fork_46 + -Fork_45 + -Fork_44 + -Fork_43 + -Fork_42 + -Fork_41 + -Fork_40 + -Fork_39 + -Fork_38 + -Fork_37 + -Fork_36 + -Fork_35 + -Fork_34 + -Fork_33 + -Fork_32 + -Fork_31 + -Fork_30 + -Fork_29 + -Fork_28 + -Fork_27 + -Fork_26 + -Fork_25 + -Fork_24 + -Fork_23 + -Fork_22 + -Fo... (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 20 bytes per marking, with 10 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 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 Philosophers-COL-000050-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 590 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_50 + -Catch1_49 + -Catch1_48 + -Catch1_47 + -Catch1_46 + -Catch1_45 + -Catch1_44 + -Catch1_43 + -Catch1_42 + -Catch1_41 + -Catch1_40 + -Catch1_39 + -Catch1_38 + -Catch1_37 + -Catch1_36 + -Catch1_35 + -Catch1_34 + -Catch1_33 + -Catch1_32 + -Catch1_31 + -Catch1_30 + -Catch1_29 + -... (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 20 bytes per marking, with 10 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-000050-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file Philosophers-COL-000050-ReachabilityCardinality-10.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 11 will run for 708 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_50 + -Think_49 + -Think_48 + -Think_47 + -Think_46 + -Think_45 + -Think_44 + -Think_43 + -Think_42 + -Think_41 + -Think_40 + -Think_39 + -Think_38 + -Think_37 + -Think_36 + -Think_35 + -Think_34 + -Think_33 + -Think_32 + -Think_31 + -Think_30 + -Think_29 + -Think_28 + -Think_27 + -Think_... (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 20 bytes per marking, with 10 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: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Fork_50 + -Fork_49 + -Fork_48 + -Fork_47 + -Fork_46 + -Fork_45 + -Fork_44 + -Fork_43 + -Fork_42 + -Fork_41 + -Fork_40 + -Fork_39 + -Fork_38 + -Fork_37 + -Fork_36 + -Fork_35 + -Fork_34 + -Fork_33 + -Fork_32 + -Fork_31 + -Fork_30 + -Fork_29 + -Fork_28 + -Fork_27 + -Fork_26 + -Fork_25 + -Fork_24 + -Fork_23 + -Fork_22 + -Fork_21 + -Fork_20 + -Fork_19 + -Fork_18 + -Fork_17 + -Fork_16 + -Fork_15 + ... (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 20 bytes per marking, with 10 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-000050-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000050-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Catch2_50 + Catch2_49 + Catch2_48 + Catch2_47 + Catch2_46 + Catch2_45 + Catch2_44 + Catch2_43 + Catch2_42 + Catch2_41 + Catch2_40 + Catch2_39 + Catch2_38 + Catch2_37 + Catch2_36 + Catch2_35 + Catch2_34 + Catch2_33 + Catch2_32 + Catch2_31 + Catch2_30 + Catch2_29 + Catch2_28 + Catch2_27 + Catch2_26 + Catch2_25 + Catch2_24 + Catch2_23 + Catch2_22 + Catch2_21 + Catch2_20 + Catch2_19 + Catch2_18 + ... (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 20 bytes per marking, with 10 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-Fork_50 + -Fork_49 + -Fork_48 + -Fork_47 + -Fork_46 + -Fork_45 + -Fork_44 + -Fork_43 + -Fork_42 + -Fork_41 + -Fork_40 + -Fork_39 + -Fork_38 + -Fork_37 + -Fork_36 + -Fork_35 + -Fork_34 + -Fork_33 + -Fork_32 + -Fork_31 + -Fork_30 + -Fork_29 + -Fork_28 + -Fork_27 + -Fork_26 + -Fork_25 + -Fork_24 + -Fork_23 + -Fork_22 + -Fork_21 + -Fork_20 + -Fork_19 + -Fork_18 + -Fork_17 + -Fork_16 + -Fork_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 20 bytes per marking, with 10 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: RESULT
lola: summary: yes no no no yes no yes no yes yes no no yes no yes no

BK_STOP 1463704612812

--------------------
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-000050"
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-000050.tgz
mv Philosophers-PT-000050 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-000050, 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-146369088500349"
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 ;