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 SafeBus-PT-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110kn-smll-146373288700223
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463775655340

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ SafeBus-PT-20
FORMULA SafeBus-COL-20-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-20-ReachabilityCardinality-1 CANNOT_COMPUTE
FORMULA SafeBus-COL-20-ReachabilityCardinality-2 CANNOT_COMPUTE
FORMULA SafeBus-COL-20-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-20-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-20-ReachabilityCardinality-5 CANNOT_COMPUTE
FORMULA SafeBus-COL-20-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-20-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-20-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-20-ReachabilityCardinality-9 CANNOT_COMPUTE
FORMULA SafeBus-COL-20-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-20-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-20-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA SafeBus-COL-20-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA SafeBus-COL-20-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-20-ReachabilityCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 11487/65536 symbol table entries, 994 collisions
lola: preprocessing...
lola: finding significant places
lola: 1026 places, 10461 transitions, 921 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3763 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-20-ReachabilityCardinality.task
lola: read: EF (2 <= R_tout) : EF (3 <= FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9 + FMC_10 + FMC_11 + FMC_12 + FMC_13 + FMC_14 + FMC_15 + FMC_16 + FMC_17 + FMC_18 + FMC_19 + FMC_20) : EF (!((!(wait_ack_2_1 + wait_ack_3_1 + wait_ack_4_1 + wait_ack_5_1 + wait_ack_6_1 + wait_ack_7_1 + wait_ack_8_1 + wait_ack_9_1 + wait_ack_10_1 + wait_ack_11_1 + wait_ack_12_1 + wait_ack_13_1 + wait_ac... (shortened)
lola: formula length: 48606
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-R_tout <= -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 3684 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 SafeBus-COL-20-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-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 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-FMC_9 + -FMC_8 + -FMC_7 + -FMC_6 + -FMC_5 + -FMC_4 + -FMC_3 + -FMC_2 + -FMC_1 + -FMC_20 + -FMC_19 + -FMC_18 + -FMC_17 + -FMC_16 + -FMC_15 + -FMC_14 + -FMC_13 + -FMC_12 + -FMC_11 + -FMC_10 <= -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 3684 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 SafeBus-COL-20-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality.sara.
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 2 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-PMC_1 + -PMC_2 + -PMC_5 + -PMC_6 + -PMC_7 + -PMC_8 + wait_ack_2_20 + wait_ack_18_20 + wait_ack_19_9 + wait_ack_19_5 + wait_ack_19_4 + wait_ack_19_3 + wait_ack_19_2 + wait_ack_19_1 + wait_ack_19_6 + wait_ack_19_7 + wait_ack_19_8 + wait_ack_18_10 + wait_ack_8_20 + wait_ack_8_19 + wait_ack_8_18 + wait_ack_8_17 + wait_ack_8_16 + wait_ack_8_15 + wait_ack_8_14 + wait_ack_8_13 + wait_ack_8_12 + wai... (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 3684 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 SafeBus-COL-20-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-2.sara.
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 3 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-listen_9 + -listen_8 + -listen_7 + -listen_6 + -listen_5 + -listen_4 + -listen_3 + -listen_2 + -listen_1 + -listen_20 + -listen_19 + -listen_18 + -listen_17 + -listen_16 + -listen_15 + -listen_14 + -listen_13 + -listen_12 + -listen_11 + -listen_10 <= -1 OR (-wait_cable_9 + -wait_cable_8 + -wait_cable_7 + -wait_cable_6 + -wait_cable_5 + -wait_cable_4 + -wait_cable_3 + -wait_cable_2 + -wait_ca... (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 3684 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 SafeBus-COL-20-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Cpt1_19 + Cpt1_20 + Cpt1_18 + Cpt1_17 + Cpt1_16 + Cpt1_15 + Cpt1_14 + Cpt1_13 + Cpt1_12 + Cpt1_11 + Cpt1_10 + Cpt1_9 + Cpt1_8 + Cpt1_7 + Cpt1_6 + Cpt1_5 + Cpt1_4 + Cpt1_3 + Cpt1_2 + Cpt1_1 + -S_tout > 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 3684 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 SafeBus-COL-20-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cable_free <= -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 3684 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 SafeBus-COL-20-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-5.sara.
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 6 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-RMC_9 + -RMC_8 + -RMC_7 + -RMC_6 + -RMC_5 + -RMC_4 + -RMC_3 + -RMC_2 + -RMC_1 + -RMC_20 + -RMC_19 + -RMC_18 + -RMC_17 + -RMC_16 + -RMC_15 + -RMC_14 + -RMC_13 + -RMC_12 + -RMC_11 + -RMC_10 <= -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 3684 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 SafeBus-COL-20-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-R_tout > -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 3684 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 SafeBus-COL-20-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-7.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 8 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-AMC_12_20 + -AMC_12_19 + -AMC_12_18 + -AMC_12_17 + -AMC_12_16 + -AMC_12_15 + -AMC_12_14 + -AMC_12_13 + -AMC_12_12 + -AMC_12_11 + -AMC_12_10 + -AMC_3_20 + -AMC_10_9 + -AMC_11_9 + -AMC_19_20 + wait_ack_2_20 + -AMC_20_20 + -AMC_17_9 + -AMC_17_8 + -AMC_17_7 + -AMC_17_6 + -AMC_17_5 + -AMC_17_4 + -AMC_17_3 + -AMC_17_2 + -AMC_17_1 + wait_ack_18_20 + -AMC_14_9 + -AMC_4_20 + -AMC_13_20 + -AMC_15_9 +... (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 3684 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 SafeBus-COL-20-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-wait_ack_2_20 + -wait_ack_18_20 + -wait_ack_19_9 + -wait_ack_19_5 + -wait_ack_19_4 + -wait_ack_19_3 + -wait_ack_19_2 + -wait_ack_19_1 + -wait_ack_19_6 + -wait_ack_19_7 + -wait_ack_19_8 + -wait_ack_18_10 + -wait_ack_8_20 + -wait_ack_8_19 + -wait_ack_8_18 + -wait_ack_8_17 + -wait_ack_8_16 + -wait_ack_8_15 + -wait_ack_8_14 + -wait_ack_8_13 + -wait_ack_8_12 + -wait_ack_8_11 + -wait_ack_8_10 + -wa... (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 3684 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 SafeBus-COL-20-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-9.sara.
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 10 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-loop_em_20 + -loop_em_19 + -loop_em_18 + -loop_em_17 + -loop_em_16 + -loop_em_15 + -loop_em_14 + -loop_em_13 + -loop_em_12 + -loop_em_11 + -loop_em_10 + wait_msg_9 + wait_msg_8 + wait_msg_7 + wait_msg_6 + wait_msg_5 + wait_msg_4 + wait_msg_3 + wait_msg_2 + wait_msg_1 + -loop_em_9 + -loop_em_8 + -loop_em_7 + -loop_em_6 + -loop_em_5 + -loop_em_4 + -loop_em_3 + -loop_em_2 + -loop_em_1 + wait_m... (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 3684 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 SafeBus-COL-20-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-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 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((msgl_10 + msgl_11 + msgl_12 + msgl_13 + msgl_14 + msgl_15 + msgl_16 + msgl_17 + msgl_18 + msgl_19 + msgl_20 + msgl_1 + msgl_2 + msgl_3 + msgl_4 + msgl_5 + msgl_6 + msgl_7 + msgl_8 + msgl_9 + -Cpt1_19 + -Cpt1_20 + -Cpt1_18 + -Cpt1_17 + -Cpt1_16 + -Cpt1_15 + -Cpt1_14 + -Cpt1_13 + -Cpt1_12 + -Cpt1_11 + -Cpt1_10 + -Cpt1_9 + -Cpt1_8 + -Cpt1_7 + -Cpt1_6 + -Cpt1_5 + -Cpt1_4 + -Cpt1_3 + -Cpt1_2 + -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 3684 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: Transformation into DNF: expect 38 literals
lola: ========================================
lola: subprocess 12 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Cpt2_9 + FMCb + -Cpt2_8 + -Cpt2_7 + -Cpt2_6 + -Cpt2_5 + -Cpt2_4 + -Cpt2_3 + -Cpt2_2 + -Cpt2_1 + -Cpt2_20 + -Cpt2_19 + -Cpt2_18 + -Cpt2_17 + -Cpt2_16 + -Cpt2_15 + -Cpt2_14 + -Cpt2_13 + -Cpt2_12 + -Cpt2_11 + -Cpt2_10 <= 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 3684 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 SafeBus-COL-20-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-12.sara.
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 13 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-R_tout > -3 OR (-wait_cable_9 + -wait_cable_8 + -wait_cable_7 + -wait_cable_6 + -wait_cable_5 + -wait_cable_4 + -wait_cable_3 + -wait_cable_2 + -wait_cable_1 + -wait_cable_20 + -wait_cable_19 + -wait_cable_18 + -wait_cable_17 + -wait_cable_16 + -wait_cable_15 + -wait_cable_14 + -wait_cable_13 + -wait_cable_12 + -wait_cable_11 + -wait_cable_10 > -1 OR -FMC_9 + -FMC_8 + -FMC_7 + -FMC_6 + -FMC_... (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 3684 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 SafeBus-COL-20-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-13.sara.
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 14 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Cpt1_19 + -Cpt1_20 + cable_used_10 + cable_used_11 + cable_used_12 + cable_used_13 + cable_used_14 + cable_used_15 + cable_used_16 + cable_used_17 + cable_used_19 + cable_used_20 + cable_used_18 + -Cpt1_18 + -Cpt1_17 + -Cpt1_16 + -Cpt1_15 + -Cpt1_14 + -Cpt1_13 + -Cpt1_12 + -Cpt1_11 + -Cpt1_10 + -Cpt1_9 + -Cpt1_8 + -Cpt1_7 + -Cpt1_6 + -Cpt1_5 + -Cpt1_4 + -Cpt1_3 + -Cpt1_2 + -Cpt1_1 + cable_us... (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 3684 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 17 literals
lola: write sara problem file to SafeBus-COL-20-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-14.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 15 will run for 986 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-RMC_9 + -RMC_8 + -RMC_7 + -RMC_6 + -RMC_5 + -RMC_4 + -RMC_3 + -RMC_2 + -RMC_1 + -RMC_20 + -RMC_19 + -RMC_18 + -RMC_17 + -RMC_16 + -RMC_15 + -RMC_14 + -RMC_13 + -RMC_12 + -RMC_11 + -RMC_10 <= -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 3684 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 SafeBus-COL-20-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-20-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: no unknown unknown no no unknown yes yes yes unknown no yes unknown unknown yes yes

BK_STOP 1463778209948

--------------------
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="SafeBus-PT-20"
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/SafeBus-PT-20.tgz
mv SafeBus-PT-20 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is SafeBus-PT-20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r110kn-smll-146373288700223"
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 ;