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

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

=== Now, execution of the tool begins

BK_START 1463766320808

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ SafeBus-PT-15
FORMULA SafeBus-COL-15-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-1 CANNOT_COMPUTE
FORMULA SafeBus-COL-15-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-11 CANNOT_COMPUTE
FORMULA SafeBus-COL-15-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-15-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: 5392/65536 symbol table entries, 362 collisions
lola: preprocessing...
lola: finding significant places
lola: 621 places, 4771 transitions, 541 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2148 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-15-ReachabilityCardinality.task
lola: read: AG ((!(!(1 <= PMC_1 + PMC_2 + PMC_3 + PMC_4 + PMC_5 + PMC_6 + PMC_7 + PMC_8 + PMC_9 + PMC_10 + PMC_11 + PMC_12 + PMC_13 + PMC_14 + PMC_15)) OR (loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10 + loop_em_11 + loop_em_12 + loop_em_13 + loop_em_14 + loop_em_15 <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8... (shortened)
lola: formula length: 27226
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-PMC_1 + -PMC_2 + -PMC_5 + -PMC_6 + -PMC_7 + -PMC_8 + -PMC_9 + -PMC_4 + -PMC_3 + -PMC_15 + -PMC_14 + -PMC_13 + -PMC_12 + -PMC_11 + -PMC_10 <= -1 OR (loop_em_15 + loop_em_14 + loop_em_13 + loop_em_12 + loop_em_11 + loop_em_10 + -Cpt1_14 + -Cpt1_15 + -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 + loop_em_9 + ... (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 2164 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-15-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-wait_ack_2_15 + FMC_9 + FMC_8 + FMC_7 + FMC_6 + FMC_5 + FMC_4 + FMC_3 + FMC_2 + FMC_1 + -wait_ack_13_15 + -wait_ack_13_10 + -wait_ack_13_11 + -wait_ack_13_12 + -wait_ack_13_14 + -wait_ack_3_15 + -wait_ack_3_14 + -wait_ack_3_13 + -wait_ack_3_12 + -wait_ack_3_11 + -wait_ack_3_10 + -wait_ack_8_10 + -wait_ack_8_11 + -wait_ack_8_12 + -wait_ack_8_13 + -wait_ack_8_14 + -wait_ack_8_15 + -wait_ack_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 2164 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 12 literals
lola: write sara problem file to SafeBus-COL-15-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-loop_em_15 + -loop_em_14 + -loop_em_13 + -loop_em_12 + -loop_em_11 + -loop_em_10 + -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 > -3 OR (Cpt1_14 + Cpt1_15 + 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 + -T_out > 0 OR ((-PMC_1 + -PMC_2 + -PMC_5 + -PM... (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 2164 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 SafeBus-COL-15-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Cpt1_14 + Cpt1_15 + -R_tout + 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 > 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 2164 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-15-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Cpt1_14 + -Cpt1_15 + R_tout + -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 > 0 OR (-RMC_9 + -RMC_8 + -RMC_7 + -RMC_6 + -RMC_5 + -RMC_4 + -RMC_3 + -RMC_2 + -RMC_1 + -RMC_15 + -RMC_14 + -RMC_13 + -RMC_12 + -RMC_11 + -RMC_10 + ACK <= 0 OR -FMCb <= -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 2164 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-15-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cable_used_15 + -cable_used_14 + -cable_used_13 + -cable_used_12 + -cable_used_11 + -cable_used_10 + -cable_used_9 + -cable_used_8 + -cable_used_7 + -cable_used_6 + -cable_used_5 + -cable_used_4 + -cable_used_3 + -cable_used_2 + -cable_used_1 <= -2 OR ((-listen_9 + -listen_8 + -listen_7 + -listen_6 + -listen_5 + -listen_4 + -listen_3 + -listen_2 + -listen_1 + -listen_15 + -listen_14 + -liste... (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 2164 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 16 literals
lola: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((msgl_10 + msgl_11 + msgl_12 + msgl_13 + msgl_14 + msgl_15 + -PMC_1 + -PMC_2 + -PMC_5 + -PMC_6 + -PMC_7 + -PMC_8 + msgl_1 + msgl_2 + msgl_3 + msgl_4 + msgl_5 + msgl_6 + msgl_7 + msgl_8 + msgl_9 + -PMC_9 + -PMC_4 + -PMC_3 + -PMC_15 + -PMC_14 + -PMC_13 + -PMC_12 + -PMC_11 + -PMC_10 <= 0 AND wait_msg_9 + wait_msg_8 + wait_msg_7 + wait_msg_6 + wait_msg_5 + wait_msg_4 + wait_msg_3 + wait_msg_2 + 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 2164 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-15-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-6.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 7 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((msgl_10 + msgl_11 + msgl_12 + msgl_13 + msgl_14 + msgl_15 + -AMC_12_15 + -AMC_12_14 + -AMC_12_13 + -AMC_12_12 + -AMC_12_11 + -AMC_12_10 + -AMC_3_15 + -AMC_10_9 + -AMC_11_9 + msgl_1 + msgl_2 + -AMC_9_15 + msgl_3 + msgl_4 + msgl_5 + msgl_6 + msgl_7 + msgl_8 + msgl_9 + -AMC_14_9 + -AMC_4_15 + -AMC_13_15 + -AMC_15_9 + -AMC_15_8 + -AMC_15_7 + -AMC_15_6 + -AMC_15_5 + -AMC_15_4 + -AMC_15_3 + -AMC_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 2164 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-15-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((loop_em_15 + loop_em_14 + loop_em_13 + loop_em_12 + loop_em_11 + loop_em_10 + -R_tout + 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 <= 0 AND msgl_10 + msgl_11 + msgl_12 + msgl_13 + msgl_14 + msgl_15 + -AMC_12_15 + -AMC_12_14 + -AMC_12_13 + -AMC_12_12 + -AMC_12_11 + -AMC_12_10 + -AMC_3_15 + -AMC_10_9 + -AMC_11_9 + msgl_1 + msgl_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 2164 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 10 literals
lola: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (R_tout + -ACK > 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 2164 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-15-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-FMC_9 + -FMC_8 + -FMC_7 + -FMC_6 + -FMC_5 + -FMC_4 + -FMC_3 + -FMC_2 + -FMC_1 + -FMC_15 + -FMC_14 + -FMC_13 + -FMC_12 + -FMC_11 + -FMC_10 > -3 AND Cpt1_14 + Cpt1_15 + 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 + -wait_cable_9 + -wait_cable_8 + -wait_cable_7 + -wait_cable_6 + -wait_cable_5 + -wait_cable_4 + -wait_cab... (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 2164 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-15-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-loop_em_15 + -loop_em_14 + -loop_em_13 + -loop_em_12 + -loop_em_11 + -loop_em_10 + -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 <= -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 2164 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-15-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-11.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 12 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-listen_9 + -listen_8 + -listen_7 + -listen_6 + -listen_5 + -listen_4 + -listen_3 + -listen_2 + -listen_1 + -listen_15 + -listen_14 + -listen_13 + -listen_12 + -listen_11 + -listen_10 > -2 AND (-Cpt2_9 + -Cpt2_8 + -Cpt2_7 + -Cpt2_6 + -Cpt2_5 + -Cpt2_4 + -Cpt2_3 + -Cpt2_2 + -Cpt2_1 + -Cpt2_15 + -Cpt2_14 + -Cpt2_13 + -Cpt2_12 + -Cpt2_11 + -Cpt2_10 > -2 AND -listen_9 + -listen_8 + -listen_7 + -l... (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 2164 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-15-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-12.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 13 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-ACK > -1 AND -T_out <= -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 2164 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-15-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AMC_12_15 + AMC_12_14 + AMC_12_13 + AMC_12_12 + AMC_12_11 + AMC_12_10 + AMC_3_15 + AMC_10_9 + AMC_11_9 + AMC_9_15 + AMC_14_9 + AMC_4_15 + AMC_13_15 + AMC_15_9 + AMC_15_8 + AMC_15_7 + AMC_15_6 + AMC_15_5 + AMC_15_4 + AMC_15_3 + AMC_15_2 + AMC_15_1 + AMC_13_14 + AMC_13_13 + AMC_13_12 + AMC_13_11 + AMC_13_10 + AMC_4_14 + AMC_4_13 + AMC_4_12 + AMC_4_11 + AMC_4_10 + AMC_14_8 + AMC_14_7 + AMC_14_6 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2164 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-15-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((listen_9 + listen_8 + listen_7 + listen_6 + listen_5 + listen_4 + listen_3 + listen_2 + listen_1 + -T_out + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10 <= 0 AND -PMC_1 + -PMC_2 + -PMC_5 + wait_ack_2_15 + -PMC_6 + -PMC_7 + -PMC_8 + wait_ack_13_15 + wait_ack_13_10 + wait_ack_13_11 + wait_ack_13_12 + wait_ack_13_14 + wait_ack_3_15 + wait_ack_3_14 + wait_ack_3_13 + 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 2164 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-15-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: no unknown no yes no no no yes no no no unknown no yes no yes

BK_STOP 1463767266218

--------------------
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-15"
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-15.tgz
mv SafeBus-PT-15 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-15, 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-146373288700214"
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 ;