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

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

=== Now, execution of the tool begins

BK_START 1463486097317

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ BridgeAndVehicles-PT-V04P05N02
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V04P05N02-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: 80/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 28 places, 52 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 85 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability.task
lola: read: 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)) AND ((((((((((((((FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0)) OR FIREABLE(timeout_B_2_2_1_0)) OR FIREABLE(timeout_B_0_2_2_0)) OR FIREABLE(timeout_B_1_2_2_0)) OR FIREABLE(timeout_B_2_2_2_0)) OR FIREABLE(timeout_B_0_... (shortened)
lola: formula length: 15126
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 (((FIREABLE(enregistrement_A_0) OR (FIREABLE(enregistrement_A_1) OR (FIREABLE(enregistrement_A_2) OR (FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4))))) AND ((FIREABLE(timeout_B_0_2_1_0) OR (FIREABLE(timeout_B_1_2_1_0) OR (FIREABLE(timeout_B_2_2_1_0) OR (FIREABLE(timeout_B_0_2_2_0) OR (FIREABLE(timeout_B_1_2_2_0) OR (FIREABLE(timeout_B_2_2_2_0) OR (FIREABLE(timeout_B_0_2_3_0) OR (... (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 84 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 156150 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 236 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)))) OR ((! FIREABLE(decision_0_1) AND (! FIREABLE(decision_1_1) AND (! FIREABLE(decision_0_2) AND ! FIREABLE(decision_1_2)))) OR (! FIREABLE(liberation_A) OR ((! FIREABLE(timeout_A_0_1_0_1) AND (! FIREABLE(timeout_A_1_1_0_1) AND (! FIREABLE(timeout_A_2_1_0_... (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 84 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 19952 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(timeout_A_0_1_0_1) AND (! FIREABLE(timeout_A_1_1_0_1) AND (! FIREABLE(timeout_A_2_1_0_1) AND (! FIREABLE(timeout_A_0_1_0_2) AND (! FIREABLE(timeout_A_1_1_0_2) AND (! FIREABLE(timeout_A_2_1_0_2) AND (! FIREABLE(timeout_A_0_1_0_3) AND (! FIREABLE(timeout_A_1_1_0_3) AND (! FIREABLE(timeout_A_2_1_0_3) AND (! FIREABLE(timeout_A_0_1_0_4) AND (! FIREABLE(timeout_A_1_1_0_4) AND (! 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 84 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 4496093627991545344 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(basculement_1) OR FIREABLE(basculement_2)) AND ((FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)) AND ((FIREABLE(enregistrement_A_0) OR (FIREABLE(enregistrement_A_1) OR (FIREABLE(enregistrement_A_2) OR (FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4))))) AND ((FIREABLE(timeout_A_0_1_0_1) OR (FIREABLE(timeout_A_1_1_0_1) OR (FIREABLE(timeout_A_2_1_0_1) OR (FIREABLE(t... (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 84 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 255484 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(timeout_A_0_1_0_1) AND (! FIREABLE(timeout_A_1_1_0_1) AND (! FIREABLE(timeout_A_2_1_0_1) AND (! FIREABLE(timeout_A_0_1_0_2) AND (! FIREABLE(timeout_A_1_1_0_2) AND (! FIREABLE(timeout_A_2_1_0_2) AND (! FIREABLE(timeout_A_0_1_0_3) AND (! FIREABLE(timeout_A_1_1_0_3) AND (! FIREABLE(timeout_A_2_1_0_3) AND (! FIREABLE(timeout_A_0_1_0_4) AND (! FIREABLE(timeout_A_1_1_0_4) AND ! 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 84 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 1356 literals
lola: write sara problem file to BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-4.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(decision_0_1) OR (FIREABLE(decision_1_1) OR (FIREABLE(decision_0_2) OR (FIREABLE(decision_1_2) OR (FIREABLE(timeout_B_0_2_1_0) OR (FIREABLE(timeout_B_1_2_1_0) OR (FIREABLE(timeout_B_2_2_1_0) OR (FIREABLE(timeout_B_0_2_2_0) OR (FIREABLE(timeout_B_1_2_2_0) OR (FIREABLE(timeout_B_2_2_2_0) OR (FIREABLE(timeout_B_0_2_3_0) OR (FIREABLE(timeout_B_1_2_3_0) OR (FIREABLE(timeout_B_2_2_3_0) OR ... (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 84 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 32928082976 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(autorisation_A_1_1) OR (FIREABLE(autorisation_A_1_2) OR (FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)))) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_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 84 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 48 literals
lola: write sara problem file to BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 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(timeout_A_0_1_0_1) OR (FIREABLE(timeout_A_1_1_0_1) OR (FIREABLE(timeout_A_2_1_0_1) OR (FIREABLE(timeout_A_0_1_0_2) OR (FIREABLE(timeout_A_1_1_0_2) OR (FIREABLE(timeout_A_2_1_0_2) OR (FIREABLE(timeout_A_0_1_0_3) OR (FIREAB... (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 84 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 363640565390 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 442 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_0) OR (FIREABLE(enregistrement_A_1) OR (FIREABLE(enregistrement_A_2) OR (FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4)))))))))) AND (FIREABLE(enregistrement_B_0) OR (FIREABLE(enregistremen... (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 84 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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(autorisation_B_2_1) AND (! FIREABLE(autorisation_B_2_2) AND (! FIREABLE(autorisation_B_2_3) AND ! FIREABLE(autorisation_B_2_4)))) OR (((FIREABLE(autorisation_A_1_1) OR (FIREABLE(autorisation_A_1_2) OR (FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)))) AND (FIREABLE(enregistrement_B_0) OR (FIREABLE(enregistrement_B_1) OR (FIREABLE(enregistrement_B_2) OR (FIREABLE(enre... (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 84 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 201480 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(liberation_A) AND ((FIREABLE(basculement_1) OR FIREABLE(basculement_2)) AND (FIREABLE(enregistrement_B_0) OR (FIREABLE(enregistrement_B_1) OR (FIREABLE(enregistrement_B_2) OR (FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4))))))))
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 84 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 46 literals
lola: write sara problem file to BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(autorisation_B_2_1) AND (! FIREABLE(autorisation_B_2_2) AND (! FIREABLE(autorisation_B_2_3) AND ! FIREABLE(autorisation_B_2_4)))) OR ((! FIREABLE(enregistrement_B_0) AND (! FIREABLE(enregistrement_B_1) AND (! FIREABLE(enregistrement_B_2) AND (! FIREABLE(enregistrement_B_3) AND ! FIREABLE(enregistrement_B_4))))) OR ((! FIREABLE(timeout_A_0_1_0_1) AND (! FIREABLE(timeout_A_1_1_0_1) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 10737482184 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(timeout_B_0_2_1_0) OR (FIREABLE(timeout_B_1_2_1_0) OR (FIREABLE(timeout_B_2_2_1_0) OR (FIREABLE(timeout_B_0_2_2_0) OR (FIREABLE(timeout_B_1_2_2_0) OR (FIREABLE(timeout_B_2_2_2_0) OR (FIREABLE(timeout_B_0_2_3_0) OR (FIREABLE(timeout_B_1_2_3_0) OR (FIREABLE(timeout_B_2_2_3_0) OR (FIREABLE(timeout_B_0_2_4_0) OR (FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)))))))))))) AND ... (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 84 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 278304 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(basculement_1) OR FIREABLE(basculement_2)) AND ((FIREABLE(autorisation_A_1_1) OR (FIREABLE(autorisation_A_1_2) OR (FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)))) AND ((FIREABLE(basculement_1) OR (FIREABLE(basculement_2) OR (FIREABLE(basculement_1) OR (FIREABLE(basculement_2) OR (! FIREABLE(enregistrement_A_0) AND (! FIREABLE(enregistrement_A_1) AND (! FIREABLE(enreg... (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 84 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 1428 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(altern_cpt_2_1) AND ! FIREABLE(altern_cpt_2_2)) OR ((! FIREABLE(timeout_B_0_2_1_0) AND (! FIREABLE(timeout_B_1_2_1_0) AND (! FIREABLE(timeout_B_2_2_1_0) AND (! FIREABLE(timeout_B_0_2_2_0) AND (! FIREABLE(timeout_B_1_2_2_0) AND (! FIREABLE(timeout_B_2_2_2_0) AND (! FIREABLE(timeout_B_0_2_3_0) AND (! FIREABLE(timeout_B_1_2_3_0) AND (! FIREABLE(timeout_B_2_2_3_0) AND (! FIREABLE(time... (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 84 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 1088 literals
lola: write sara problem file to BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(enregistrement_A_0) AND (! FIREABLE(enregistrement_A_1) AND (! FIREABLE(enregistrement_A_2) AND (! FIREABLE(enregistrement_A_3) AND ! FIREABLE(enregistrement_A_4))))) OR (FIREABLE(liberation_B) OR (FIREABLE(enregistrement_A_0) OR (FIREABLE(enregistrement_A_1) OR (FIREABLE(enregistrement_A_2) OR (FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4))))))))
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 84 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 660 literals
lola: write sara problem file to BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola: summary: no yes no no yes yes no yes no yes no yes no no yes yes

BK_STOP 1463486098653

--------------------
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-V04P05N02"
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-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 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-V04P05N02, 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-146347662300261"
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 ;