fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r002kn-ebro-146347662400315
Last Updated
June 30, 2016

About the Execution of LoLa for BridgeAndVehicles-PT-V20P20N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1295.970 2624545.00 2987663.00 410.10 FFF?TFTTTFFT?FTF normal

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 BridgeAndVehicles-PT-V20P20N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662400315
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1463489287045

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ BridgeAndVehicles-PT-V20P20N20
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-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: 1046/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 78 places, 968 transitions, 71 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1133 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability.task
lola: read: AG (!((FIREABLE(altern_cpt_1_20) OR FIREABLE(altern_cpt_2_20)))) : AG (((!(!((FIREABLE(altern_cpt_1_20) OR FIREABLE(altern_cpt_2_20)))) OR !(!((((((((((((((((((((FIREABLE(autorisation_A_1_1) OR FIREABLE(autorisation_A_1_2)) OR FIREABLE(autorisation_A_1_3)) OR FIREABLE(autorisation_A_1_4)) OR FIREABLE(autorisation_A_1_5)) OR FIREABLE(autorisation_A_1_6)) OR FIREABLE(autorisation_A_1_7)) OR FIREABLE... (shortened)
lola: formula length: 148528
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(altern_cpt_1_20) AND ! FIREABLE(altern_cpt_2_20)))
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 284 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 BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability.sara
lola: calling and running sara
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: AG ((FIREABLE(altern_cpt_1_20) OR (FIREABLE(altern_cpt_2_20) OR (FIREABLE(autorisation_A_1_1) OR (FIREABLE(autorisation_A_1_2) OR (FIREABLE(autorisation_A_1_3) OR (FIREABLE(autorisation_A_1_4) OR (FIREABLE(autorisation_A_1_5) OR (FIREABLE(autorisation_A_1_6) OR (FIREABLE(autorisation_A_1_7) OR (FIREABLE(autorisation_A_1_8) OR (FIREABLE(autorisation_A_1_9) OR (FIREABLE(autorisation_A_1_10) OR (FIRE... (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 284 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 774768895255490330624 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(basculement_1) AND (! FIREABLE(basculement_2) AND ((! FIREABLE(enregistrement_A_0) AND (! FIREABLE(enregistrement_A_1) AND (! FIREABLE(enregistrement_A_2) AND (! FIREABLE(enregistrement_A_3) AND (! FIREABLE(enregistrement_A_4) AND (! FIREABLE(enregistrement_A_5) AND (! FIREABLE(enregistrement_A_6) AND (! FIREABLE(enregistrement_A_7) AND (! FIREABLE(enregistrement_A_8) AND (! FIREAB... (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 284 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 reachable.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(enregistrement_A_0) OR (FIREABLE(enregistrement_A_1) OR (FIREABLE(enregistrement_A_2) OR (FIREABLE(enregistrement_A_3) OR (FIREABLE(enregistrement_A_4) OR (FIREABLE(enregistrement_A_5) OR (FIREABLE(enregistrement_A_6) OR (FIREABLE(enregistrement_A_7) OR (FIREABLE(enregistrement_A_8) OR (FIREABLE(enregistrement_A_9) OR (FIREABLE(enregistrement_A_10) OR (FIREABLE(enregistrement_A_11) ... (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 284 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(enregistrement_B_0) OR (FIREABLE(enregistrement_B_1) OR (FIREABLE(enregistrement_B_2) OR (FIREABLE(enregistrement_B_3) OR (FIREABLE(enregistrement_B_4) OR (FIREABLE(enregistrement_B_5) OR (FIREABLE(enregistrement_B_6) OR (FIREABLE(enregistrement_B_7) OR (FIREABLE(enregistrement_B_8) OR (FIREABLE(enregistrement_B_9) OR (FIREABLE(enregistrement_B_10) OR (FIREABLE(enregistrement_B_11) 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 284 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 8388562 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(enregistrement_A_0) OR (FIREABLE(enregistrement_A_1) OR (FIREABLE(enregistrement_A_2) OR (FIREABLE(enregistrement_A_3) OR (FIREABLE(enregistrement_A_4) OR (FIREABLE(enregistrement_A_5) OR (FIREABLE(enregistrement_A_6) OR (FIREABLE(enregistrement_A_7) OR (FIREABLE(enregistrement_A_8) OR (FIREABLE(enregistrement_A_9) OR (FIREABLE(enregistrement_A_10) OR (FIREABLE(enregistrement_A_11) ... (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 284 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 1642269306301028383681641773388096003407315871128260059421988064101455666706013553739659662740449724605377468932725905664505919628042379647535371264557638015113566899655198879266061811351205510916192008976229472251416515912481071922675010458973077338324992 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(autorisation_A_1_1) AND (! FIREABLE(autorisation_A_1_2) AND (! FIREABLE(autorisation_A_1_3) AND (! FIREABLE(autorisation_A_1_4) AND (! FIREABLE(autorisation_A_1_5) AND (! FIREABLE(autorisation_A_1_6) AND (! FIREABLE(autorisation_A_1_7) AND (! FIREABLE(autorisation_A_1_8) AND (! FIREABLE(autorisation_A_1_9) AND (! FIREABLE(autorisation_A_1_10) AND (! FIREABLE(autorisation_A_1_11) A... (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 284 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 82080 literals
lola: write sara problem file to BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-6.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 7 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(enregistrement_B_0) OR (FIREABLE(enregistrement_B_1) OR (FIREABLE(enregistrement_B_2) OR (FIREABLE(enregistrement_B_3) OR (FIREABLE(enregistrement_B_4) OR (FIREABLE(enregistrement_B_5) OR (FIREABLE(enregistrement_B_6) OR (FIREABLE(enregistrement_B_7) OR (FIREABLE(enregistrement_B_8) OR (FIREABLE(enregistrement_B_9) OR (FIREABLE(enregistrement_B_10) OR (FIREABLE(enregistrement_B_11) 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 284 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 8388562 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(timeout_B_2_0_1_0) OR (FIREABLE(timeout_B_2_1_1_0) OR (FIREABLE(timeout_B_2_2_1_0) OR (FIREABLE(timeout_B_2_3_1_0) OR (FIREABLE(timeout_B_2_4_1_0) OR (FIREABLE(timeout_B_2_5_1_0) OR (FIREABLE(timeout_B_2_6_1_0) OR (FIREABLE(timeout_B_2_7_1_0) OR (FIREABLE(timeout_B_2_8_1_0) OR (FIREABLE(timeout_B_2_9_1_0) OR (FIREABLE(timeout_B_2_10_1_0) OR (FIREABLE(timeout_B_2_11_1_0) OR (FIREABLE... (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 284 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 reachable.
lola: ========================================
lola: subprocess 9 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(enregistrement_A_0) OR (FIREABLE(enregistrement_A_1) OR (FIREABLE(enregistrement_A_2) OR (FIREABLE(enregistrement_A_3) OR (FIREABLE(enregistrement_A_4) OR (FIREABLE(enregistrement_A_5) OR (FIREABLE(enregistrement_A_6) OR (FIREABLE(enregistrement_A_7) OR (FIREABLE(enregistrement_A_8) OR (FIREABLE(enregistrement_A_9) OR (FIREABLE(enregistrement_A_10) OR (FIREABLE(enregistrement_A_11) 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 284 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 8388562 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(altern_cpt_1_20) AND ! FIREABLE(altern_cpt_2_20)) OR (FIREABLE(timeout_B_2_0_1_0) OR (FIREABLE(timeout_B_2_1_1_0) OR (FIREABLE(timeout_B_2_2_1_0) OR (FIREABLE(timeout_B_2_3_1_0) OR (FIREABLE(timeout_B_2_4_1_0) OR (FIREABLE(timeout_B_2_5_1_0) OR (FIREABLE(timeout_B_2_6_1_0) OR (FIREABLE(timeout_B_2_7_1_0) OR (FIREABLE(timeout_B_2_8_1_0) OR (FIREABLE(timeout_B_2_9_1_0) OR (FIREABLE(... (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 284 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(altern_cpt_1_20) AND (! FIREABLE(altern_cpt_2_20) AND ((FIREABLE(altern_cpt_1_20) OR FIREABLE(altern_cpt_2_20)) AND ((FIREABLE(liberation_B) OR (! FIREABLE(enregistrement_A_0) AND (! FIREABLE(enregistrement_A_1) AND (! FIREABLE(enregistrement_A_2) AND (! FIREABLE(enregistrement_A_3) AND (! FIREABLE(enregistrement_A_4) AND (! FIREABLE(enregistrement_A_5) AND (! FIREABLE(enregistreme... (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 284 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 32230655076 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(altern_cpt_1_20) OR FIREABLE(altern_cpt_2_20)))
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 284 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 BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(enregistrement_A_0) OR (FIREABLE(enregistrement_A_1) OR (FIREABLE(enregistrement_A_2) OR (FIREABLE(enregistrement_A_3) OR (FIREABLE(enregistrement_A_4) OR (FIREABLE(enregistrement_A_5) OR (FIREABLE(enregistrement_A_6) OR (FIREABLE(enregistrement_A_7) OR (FIREABLE(enregistrement_A_8) OR (FIREABLE(enregistrement_A_9) OR (FIREABLE(enregistrement_A_10) OR (FIREABLE(enregistrement_A_11) 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 284 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 8388562 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(altern_cpt_1_20) OR FIREABLE(altern_cpt_2_20)))
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 284 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 BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(basculement_1) AND ! FIREABLE(basculement_2)) OR (! FIREABLE(liberation_B) OR (FIREABLE(autorisation_B_2_1) OR (FIREABLE(autorisation_B_2_2) OR (FIREABLE(autorisation_B_2_3) OR (FIREABLE(autorisation_B_2_4) OR (FIREABLE(autorisation_B_2_5) OR (FIREABLE(autorisation_B_2_6) OR (FIREABLE(autorisation_B_2_7) OR (FIREABLE(autorisation_B_2_8) OR (FIREABLE(autorisation_B_2_9) OR (FIREABL... (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 284 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 42992719005181095784897054846454846449260809098485575449713747854180524320704252100217801013216545103663457959154951298682505081381356791147079248775163985955387371185161470294522957390775783406203875033948545097167152111927557663537123265410612607482449102779711488 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola: summary: no no yes no no yes unknown no yes no no unknown yes no yes yes

BK_STOP 1463491911590

--------------------
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="BridgeAndVehicles-PT-V20P20N20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N20.tgz
mv BridgeAndVehicles-PT-V20P20N20 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 BridgeAndVehicles-PT-V20P20N20, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002kn-ebro-146347662400315"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;