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 PermAdmissibility-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363811200322
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463705160759

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PermAdmissibility-PT-05
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-8 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-05-ReachabilityCardinality.task
lola: read: EF (((!(2 <= c8) OR (out8_1 + out8_0 + out8_3 + out8_2 + out8_6 + out8_7 + out8_4 + out8_5 <= aux8_7 + aux8_3 + aux8_6 + aux8_2 AND 3 <= out7_1 + out7_0 + out7_3 + out7_2 + out7_5 + out7_4 + out7_7 + out7_6)) AND (3 <= c11 AND in2_2 + in2_3 <= aux12_6 + aux12_5 + aux12_4 + aux12_3 + aux12_2 + aux12_1 + aux12_0 + aux12_7))) : AG (!(2 <= aux16_0 + aux16_1 + aux16_2 + aux16_3 + aux16_4 + aux16_5 + au... (shortened)
lola: formula length: 2926
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 (((-c8 > -2 OR (out8_7 + -aux8_7 + out8_0 + out8_1 + out8_2 + -aux8_6 + -aux8_3 + -aux8_2 + out8_3 + out8_4 + out8_5 + out8_6 <= 0 AND -out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 <= -3)) AND (-c11 <= -3 AND in2_3 + in2_2 + -aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 <= 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 544 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 7 literals
lola: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality.sara
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 (-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 > -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 544 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 PermAdmissibility-COL-05-ReachabilityCardinality.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 (((in2_3 + in2_2 + -aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 > 0 AND -c18 > -1) OR (-in3_5 + -in3_4 > -2 OR -aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 + c5 > 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 544 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: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-2.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-c17 <= -3 AND c8 + -c13 <= 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 544 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 PermAdmissibility-COL-05-ReachabilityCardinality-3.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-aux13_7 + -aux13_6 + -aux13_5 + -aux13_4 + -aux13_3 + -aux13_2 + -aux13_1 + -aux13_0 + out1_7 + out1_6 + out1_5 + out1_4 + out1_3 + out1_2 + out1_1 + out1_0 <= 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 544 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 PermAdmissibility-COL-05-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-c7 <= -1 AND (-aux11_7 + out6_7 + out6_6 + out6_5 + out6_4 + out6_3 + out6_2 + out6_1 + out6_0 + -aux11_6 + -aux11_5 + -aux11_4 + -aux11_3 + -aux11_2 + -aux11_1 + -aux11_0 <= 0 AND ((-out8_7 + -out8_0 + -out8_1 + -out8_2 + -out8_3 + -out8_4 + -out8_5 + -out8_6 <= -3 OR -c11 <= -3) AND c19 + -c13 <= 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 544 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 PermAdmissibility-COL-05-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-out1_7 + -out1_6 + -out1_5 + -out1_4 + -out1_3 + -out1_2 + -out1_1 + -out1_0 <= -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 544 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 PermAdmissibility-COL-05-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 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((in2_3 + in2_2 + -aux9_7 + -aux9_5 + -aux9_0 + -aux9_1 + -aux9_2 + -aux9_3 + -aux9_4 + -aux9_6 <= 0 AND in3_5 + in3_4 + -c7 <= 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 544 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 PermAdmissibility-COL-05-ReachabilityCardinality-7.sara
lola: lola: SUBRESULT
calling and running sara
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 + c18 <= 0 AND (-out1_7 + -out1_6 + -out1_5 + -out1_4 + -out1_3 + -out1_2 + -out1_1 + -out1_0 <= -3 AND -c110 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 PermAdmissibility-COL-05-ReachabilityCardinality-8.sara
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-7.sara.
lola: calling and running sara
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 <= -2 AND (-aux12_7 + out8_7 + out8_0 + out8_1 + out8_2 + out8_3 + out8_4 + out8_5 + out8_6 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 <= 0 AND (in2_3 + in2_2 + -c19 > 0 AND -aux14_7 + -aux14_6 + -aux14_5 + -aux14_4 + -aux14_3 + -aux14_2 + -aux14_1 + -aux14_0 <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 PermAdmissibility-COL-05-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((aux7_7 + -aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 + aux7_6 + aux7_3 + aux7_2 <= 0 OR (-c9 + c5 <= 0 OR (in3_5 + in3_4 + -in2_3 + -in2_2 <= 0 OR (-c17 + c14 <= 0 OR (-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + aux6_5 + aux6_4 + aux6_1 + aux6_0 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 <= 0 OR -c110 > -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 544 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: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-10.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 11 will run for 619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-in2_3 + -in2_2 <= -1 OR -c15 <= -1) AND -in3_5 + -in3_4 <= -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 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-11.sara
lola: lola: ========================================subprocess 12 will run for 774 seconds at most (--localtimelimit=0)

lola: lola: ========================================
calling and running sara
lola: ...considering subproblem: AG (((-aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 > -3 OR -c6 > -1) AND -aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 + c14 <= 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 544 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
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-11.sara.
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1017 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 <= -2)
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 544 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: SUBRESULT
lola: result: yes
lola: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-13.sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-c17 > -3 OR (c20 + -c18 > 0 OR -aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 + c18 > 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 544 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 PermAdmissibility-COL-05-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3052 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((aux10_7 + -out8_7 + -out8_0 + -out8_1 + -out8_2 + -out8_3 + -out8_4 + -out8_5 + -out8_6 + aux10_6 + aux10_5 + aux10_4 + aux10_3 + aux10_2 + aux10_1 + aux10_0 > 0 AND (-aux11_7 + -aux11_6 + -aux11_5 + -aux11_4 + -aux11_3 + -aux11_2 + -aux11_1 + -aux11_0 > -1 AND (c9 + -c13 > 0 AND -c20 + c15 > 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 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: yes no no yes no yes yes yes unknown yes yes no no yes no yes

BK_STOP 1463705648610

--------------------
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="PermAdmissibility-PT-05"
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/PermAdmissibility-PT-05.tgz
mv PermAdmissibility-PT-05 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 PermAdmissibility-PT-05, 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 r074kn-smll-146363811200322"
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 ;