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 DrinkVendingMachine-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038kn-smll-146351480400079
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463519570531

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ DrinkVendingMachine-PT-10
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-10-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: 111280/65536 symbol table entries, 66439 collisions
lola: preprocessing...
lola: finding significant places
lola: 120 places, 111160 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48320 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-COL-10-ReachabilityCardinality.task
lola: read: AG (2 <= theProducts_2 + theProducts_3 + theProducts_1 + theProducts_6 + theProducts_7 + theProducts_4 + theProducts_5 + theProducts_10 + theProducts_8 + theProducts_9) : AG ((((optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9 + optionSlots_10 <= optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_... (shortened)
lola: formula length: 12992
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-theProducts_10 + -theProducts_9 + -theProducts_8 + -theProducts_7 + -theProducts_6 + -theProducts_5 + -theProducts_4 + -theProducts_3 + -theProducts_2 + -theProducts_1 <= -2)
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 DrinkVendingMachine-COL-10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-wait_9 + -wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 + -wait_40 + -wait_39 + -wait_38 + -wait_37 + -wait_36 + -wait_35 + -wait_34 + -wait_33 + -wait_32 + -wait_31 + -wait_30 + -wait_29 + -wait_28 + -wait_27 + -wait_26 + -wait_25 + -wait_24 + -wait_23 + -wait_22 + -wait_21 + -wait_20 + -wait_19 + -wait_18 + -wait_17 + -wait_16 + -wait_15 + -wait_14 + -wait_1... (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 3 literals
lola: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-theOptions_9 + -theOptions_8 + -theOptions_7 + -theOptions_6 + -theOptions_5 + -theOptions_4 + -theOptions_3 + -theOptions_2 + -theOptions_1 + -theOptions_10 <= -2 AND -theOptions_9 + -theOptions_8 + -theOptions_7 + -theOptions_6 + -theOptions_5 + -theOptions_4 + -theOptions_3 + -theOptions_2 + -theOptions_1 + -theOptions_10 + optionSlots_9 + optionSlots_8 + optionSlots_7 + optionSlots_6 + o... (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 2 literals
lola: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 266 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 DrinkVendingMachine-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 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-optionSlots_9 + -optionSlots_8 + -optionSlots_7 + -optionSlots_6 + -optionSlots_5 + -optionSlots_4 + -optionSlots_3 + -optionSlots_2 + -optionSlots_1 + -optionSlots_10 <= -1 OR -theProducts_10 + optionSlots_9 + optionSlots_8 + optionSlots_7 + optionSlots_6 + optionSlots_5 + optionSlots_4 + optionSlots_3 + optionSlots_2 + optionSlots_1 + optionSlots_10 + -theProducts_9 + -theProducts_8 + -the... (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 2 literals
lola: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-4.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-theProducts_10 + optionSlots_9 + optionSlots_8 + optionSlots_7 + optionSlots_6 + optionSlots_5 + optionSlots_4 + optionSlots_3 + optionSlots_2 + optionSlots_1 + optionSlots_10 + -theProducts_9 + -theProducts_8 + -theProducts_7 + -theProducts_6 + -theProducts_5 + -theProducts_4 + -theProducts_3 + -theProducts_2 + -theProducts_1 <= 0)
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 DrinkVendingMachine-COL-10-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((theProducts_10 + -optionSlots_9 + -optionSlots_8 + -optionSlots_7 + -optionSlots_6 + -optionSlots_5 + -optionSlots_4 + -optionSlots_3 + -optionSlots_2 + -optionSlots_1 + -optionSlots_10 + theProducts_9 + theProducts_8 + theProducts_7 + theProducts_6 + theProducts_5 + theProducts_4 + theProducts_3 + theProducts_2 + theProducts_1 > 0 OR -productSlots_1 + -productSlots_2 + -productSlots_3 + -pr... (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 4 literals
lola: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (wait_9 + wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -productSlots_1 + -productSlots_2 + -productSlots_3 + -productSlots_4 + -productSlots_5 + -productSlots_6 + -productSlots_7 + -productSlots_8 + -productSlots_9 + -productSlots_10 + wait_40 + wait_39 + wait_38 + wait_37 + wait_36 + wait_35 + wait_34 + wait_33 + wait_32 + wait_31 + wait_30 + wait_29 + wait_28 + wait... (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 DrinkVendingMachine-COL-10-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-theOptions_9 + -theOptions_8 + -theOptions_7 + -theOptions_6 + -theOptions_5 + -theOptions_4 + -theOptions_3 + -theOptions_2 + -theOptions_1 + -theOptions_10 <= -3)
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 DrinkVendingMachine-COL-10-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-theOptions_9 + -theOptions_8 + -theOptions_7 + -theOptions_6 + -theOptions_5 + -theOptions_4 + -theOptions_3 + -theOptions_2 + -theOptions_1 + -theOptions_10 <= -3 OR -theOptions_9 + -theOptions_8 + -theOptions_7 + -theOptions_6 + -theOptions_5 + -theOptions_4 + -theOptions_3 + -theOptions_2 + -theOptions_1 + -theOptions_10 <= -1))
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 2 literals
lola: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-wait_9 + -wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 + -wait_40 + -wait_39 + -wait_38 + -wait_37 + -wait_36 + -wait_35 + -wait_34 + -wait_33 + -wait_32 + -wait_31 + -wait_30 + -wait_29 + -wait_28 + -wait_27 + -wait_26 + -wait_25 + -wait_24 + -wait_23 + -wait_22 + -wait_21 + -wait_20 + -wait_19 + -wait_18 + -wait_17 + -wait_16 + -wait_15 + -wait_14 + -wait_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 1 literals
lola: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-ready_40 + -ready_39 + -ready_38 + -ready_37 + -ready_36 + -ready_35 + -ready_34 + -ready_33 + -ready_32 + -ready_31 + -ready_30 + -ready_29 + -ready_28 + -ready_27 + -ready_26 + -ready_25 + -ready_24 + -ready_23 + -ready_22 + -ready_21 + -ready_20 + -ready_19 + -ready_18 + -ready_17 + -ready_16 + -ready_15 + -ready_14 + -ready_13 + -ready_12 + -ready_11 + -ready_10 + -ready_1 + -ready_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 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 11 literals
lola: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-productSlots_1 + -productSlots_2 + -productSlots_3 + -productSlots_4 + -productSlots_5 + -productSlots_6 + -productSlots_7 + -productSlots_8 + -productSlots_9 + theProducts_10 + -productSlots_10 + theProducts_9 + theProducts_8 + theProducts_7 + theProducts_6 + theProducts_5 + theProducts_4 + theProducts_3 + theProducts_2 + theProducts_1 <= 0)
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 DrinkVendingMachine-COL-10-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1021 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-wait_9 + -wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 + ready_40 + ready_39 + ready_38 + ready_37 + ready_36 + ready_35 + ready_34 + ready_33 + ready_32 + ready_31 + ready_30 + ready_29 + ready_28 + ready_27 + ready_26 + ready_25 + ready_24 + ready_23 + ready_22 + ready_21 + ready_20 + ready_19 + ready_18 + ready_17 + ready_16 + ready_15 + ready_14 + ready_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 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: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-ready_40 + -ready_39 + -ready_38 + -ready_37 + -ready_36 + -ready_35 + -ready_34 + -ready_33 + -ready_32 + -ready_31 + -ready_30 + -ready_29 + -ready_28 + -ready_27 + -ready_26 + -ready_25 + -ready_24 + -ready_23 + -ready_22 + -ready_21 + -ready_20 + -ready_19 + -ready_18 + -ready_17 + -ready_16 + -ready_15 + -ready_14 + -ready_13 + -ready_12 + -ready_11 + -ready_10 + -ready_1 + -ready_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 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 2 literals
lola: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3038 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((wait_9 + wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -ready_40 + -ready_39 + -ready_38 + -ready_37 + -ready_36 + -ready_35 + -ready_34 + -ready_33 + -ready_32 + -ready_31 + -ready_30 + -ready_29 + -ready_28 + -ready_27 + -ready_26 + -ready_25 + -ready_24 + -ready_23 + -ready_22 + -ready_21 + -ready_20 + -ready_19 + -ready_18 + -ready_17 + -ready_16 + -ready_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 6 literals
lola: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: no no no yes unknown no yes yes no no no no yes yes no no

BK_STOP 1463520084239

--------------------
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="DrinkVendingMachine-PT-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/DrinkVendingMachine-PT-10.tgz
mv DrinkVendingMachine-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 DrinkVendingMachine-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 r038kn-smll-146351480400079"
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 ;