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)
.....................
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 359 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 57K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
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 r028-ebro-152646306300259
=====================================================================

--------------------
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-PT-V04P05N02-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1526557490837

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V04P05N02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V04P05N02 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ BridgeAndVehicles-PT-V04P05N02 @ 3569 seconds
lola: LoLA will run for 3569 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: Size of bit vector: 896
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-PT-V04P05N02-ReachabilityFireability.task
lola: E (F (((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2))))) : E (F ((NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_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)) AND NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) 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))))) : A (G ((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(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(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)) OR (NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)) AND ((FIREABLE(liberation_A) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4))) OR (NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4))))))) : A (G ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2) AND NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)) OR NOT FIREABLE(liberation_B) OR (NOT FIREABLE(autorisation_A_1_1) AND NOT FIREABLE(autorisation_A_1_2) AND NOT FIREABLE(autorisation_A_1_3) AND NOT FIREABLE(autorisation_A_1_4))))) : E (F (((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 FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4)) 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) OR FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND FIREABLE(liberation_B) AND NOT FIREABLE(timeout_B_0_2_1_0) AND NOT FIREABLE(timeout_B_1_2_1_0) AND NOT FIREABLE(timeout_B_2_2_1_0) AND NOT FIREABLE(timeout_B_0_2_2_0) AND NOT FIREABLE(timeout_B_1_2_2_0) AND NOT FIREABLE(timeout_B_2_2_2_0) AND NOT FIREABLE(timeout_B_0_2_3_0) AND NOT FIREABLE(timeout_B_1_2_3_0) AND NOT FIREABLE(timeout_B_2_2_3_0) AND NOT FIREABLE(timeout_B_0_2_4_0) AND NOT FIREABLE(timeout_B_1_2_4_0) AND NOT FIREABLE(timeout_B_2_2_4_0) AND NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4) 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) 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) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4)))))) : A (G ((NOT FIREABLE(liberation_A) OR (NOT FIREABLE(enregistrement_A_0) AND NOT FIREABLE(enregistrement_A_1) AND NOT FIREABLE(enregistrement_A_2) AND NOT FIREABLE(enregistrement_A_3) AND NOT FIREABLE(enregistrement_A_4)) OR (NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2)) OR (NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4)) OR NOT FIREABLE(liberation_A) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2) AND NOT FIREABLE(liberation_B))))) : E (F (((FIREABLE(liberation_B) 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 FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2)))) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)) AND (FIREABLE(liberation_A)) 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(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 FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4))))) : E (F (((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(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 FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) 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))))) : E (F ((FIREABLE(decision_1_2) AND FIREABLE(timeout_B_2_2_2_0) AND FIREABLE(basculement_1)))) : E (F ((FIREABLE(timeout_A_2_1_0_4) AND FIREABLE(timeout_A_0_1_0_4) AND FIREABLE(enregistrement_A_3) AND (FIREABLE(autorisation_A_1_3) OR NOT FIREABLE(timeout_A_0_1_0_4)) AND FIREABLE(timeout_A_1_1_0_4)))) : A (G (NOT FIREABLE(timeout_B_0_2_2_0))) : E (F ((NOT FIREABLE(basculement_1) AND NOT FIREABLE(enregistrement_A_1) AND FIREABLE(timeout_B_1_2_3_0) AND (FIREABLE(autorisation_A_1_4) OR NOT FIREABLE(timeout_A_2_1_0_4))))) : E (F (FIREABLE(timeout_B_0_2_4_0))) : E (F ((NOT FIREABLE(autorisation_A_1_3) AND (NOT FIREABLE(autorisation_A_1_2) OR NOT FIREABLE(enregistrement_A_0)) AND FIREABLE(timeout_B_0_2_4_0)))) : A (G ((NOT FIREABLE(autorisation_B_2_2) OR NOT FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(decision_1_1) OR FIREABLE(timeout_A_1_1_0_1) OR (FIREABLE(timeout_A_1_1_0_1) AND FIREABLE(timeout_A_0_1_0_1)) OR (((FIREABLE(timeout_B_1_2_4_0) AND FIREABLE(timeout_A_0_1_0_2)) OR FIREABLE(basculement_1)) AND FIREABLE(timeout_A_0_1_0_4))))) : E (F ((FIREABLE(timeout_B_1_2_1_0) AND FIREABLE(timeout_B_1_2_4_0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(timeout_B_0_2_2_0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (NOT FIREABLE(timeout_B_0_2_2_0)))
lola: processed formula length: 39
lola: 2 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: FIREABLE(timeout_B_0_2_2_0)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2330 markings, 3738 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(timeout_B_0_2_4_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(timeout_B_0_2_4_0)))
lola: processed formula length: 35
lola: 1 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(timeout_B_0_2_4_0)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2368 markings, 3984 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(timeout_B_1_2_1_0) AND FIREABLE(timeout_B_1_2_4_0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(timeout_B_1_2_1_0) AND FIREABLE(timeout_B_1_2_4_0))))
lola: processed formula length: 69
lola: 1 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(timeout_B_1_2_1_0) AND FIREABLE(timeout_B_1_2_4_0))
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2330 markings, 3731 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(decision_1_2) AND FIREABLE(timeout_B_2_2_2_0) AND FIREABLE(basculement_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(decision_1_2) AND FIREABLE(timeout_B_2_2_2_0) AND FIREABLE(basculement_1))))
lola: processed formula length: 92
lola: 1 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(decision_1_2) AND FIREABLE(timeout_B_2_2_2_0) AND FIREABLE(basculement_1))
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2294 markings, 3612 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(autorisation_A_1_3) AND (NOT FIREABLE(autorisation_A_1_2) OR NOT FIREABLE(enregistrement_A_0)) AND FIREABLE(timeout_B_0_2_4_0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(autorisation_A_1_3) AND (NOT FIREABLE(autorisation_A_1_2) OR NOT FIREABLE(enregistrement_A_0)) AND FIREABLE(timeout_B_0_2_4_0))))
lola: processed formula length: 150
lola: 1 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(autorisation_A_1_3) AND (NOT FIREABLE(autorisation_A_1_2) OR NOT FIREABLE(enregistrement_A_0)) AND FIREABLE(timeout_B_0_2_4_0))
lola: state equation: Generated DNF with 144 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2378 markings, 4074 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(basculement_1) AND NOT FIREABLE(enregistrement_A_1) AND FIREABLE(timeout_B_1_2_3_0) AND (FIREABLE(autorisation_A_1_4) OR NOT FIREABLE(timeout_A_2_1_0_4)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(basculement_1) AND NOT FIREABLE(enregistrement_A_1) AND FIREABLE(timeout_B_1_2_3_0) AND (FIREABLE(autorisation_A_1_4) OR NOT FIREABLE(timeout_A_2_1_0_4)))))
lola: processed formula length: 177
lola: 1 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(basculement_1) AND NOT FIREABLE(enregistrement_A_1) AND FIREABLE(timeout_B_1_2_3_0) AND (FIREABLE(autorisation_A_1_4) OR NOT FIREABLE(timeout_A_2_1_0_4)))
lola: state equation: Generated DNF with 152 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2270 markings, 3857 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(timeout_A_2_1_0_4) AND FIREABLE(timeout_A_0_1_0_4) AND FIREABLE(enregistrement_A_3) AND (FIREABLE(autorisation_A_1_3) OR NOT FIREABLE(timeout_A_0_1_0_4)) AND FIREABLE(timeout_A_1_1_0_4))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(timeout_A_2_1_0_4) AND FIREABLE(timeout_A_0_1_0_4) AND FIREABLE(enregistrement_A_3) AND (FIREABLE(autorisation_A_1_3) OR NOT FIREABLE(timeout_A_0_1_0_4)) AND FIREABLE(timeout_A_1_1_0_4))))
lola: processed formula length: 205
lola: 1 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(timeout_A_2_1_0_4) AND FIREABLE(timeout_A_0_1_0_4) AND FIREABLE(enregistrement_A_3) AND (FIREABLE(autorisation_A_1_3) OR NOT FIREABLE(timeout_A_0_1_0_4)) AND FIREABLE(timeout_A_1_1_0_4))
lola: state equation: Generated DNF with 18 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2296 markings, 3661 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) 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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)))))
lola: processed formula length: 175
lola: 1 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)))
lola: state equation: Generated DNF with 32 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2330 markings, 3721 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(autorisation_B_2_2) OR NOT FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(decision_1_1) OR FIREABLE(timeout_A_1_1_0_1) OR (FIREABLE(timeout_A_1_1_0_1) AND FIREABLE(timeout_A_0_1_0_1)) OR (((FIREABLE(timeout_B_1_2_4_0) AND FIREABLE(timeout_A_0_1_0_2)) OR FIREABLE(basculement_1)) AND FIREABLE(timeout_A_0_1_0_4)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(autorisation_B_2_2) OR NOT FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(decision_1_1) OR FIREABLE(timeout_A_1_1_0_1) OR (FIREABLE(timeout_A_1_1_0_1) AND FIREABLE(timeout_A_0_1_0_1)) OR (((FIREABLE(timeout_B_1_2_4_0) AND FIREABLE(timeout_A_0_1_0_2)) OR FIREABLE(basculement_1)) AND FIREABLE(timeout_A_0_1_0_4)))))
lola: processed formula length: 333
lola: 2 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(autorisation_B_2_2) AND FIREABLE(timeout_B_2_2_1_0) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND (NOT FIREABLE(timeout_A_1_1_0_1) OR NOT FIREABLE(timeout_A_0_1_0_1)) AND (((NOT FIREABLE(timeout_B_1_2_4_0) OR NOT FIREABLE(timeout_A_0_1_0_2)) AND NOT FIREABLE(basculement_1)) OR NOT FIREABLE(timeout_A_0_1_0_4)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2302 markings, 3664 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2) AND NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(altern_cpt_2_1) AND N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2) AND NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(altern_cpt_2_1) AND N... (shortened)
lola: processed formula length: 612
lola: 2 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2) AND (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)) AND FIREABLE(liberation_B) AND (FIREABLE(autorisation_A_1_1) OR FIREABLE(autorisation_A_1_2) OR FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((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(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(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((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(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(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT ... (shortened)
lola: processed formula length: 1027
lola: 2 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4) AND NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) AND NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_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) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)) OR ((NOT FIREABLE(liberation_A) OR (NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4))) 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2523 markings, 4290 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_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)) AND NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_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)) AND NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE... (shortened)
lola: processed formula length: 590
lola: 1 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_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)) AND NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) 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)))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(liberation_A) OR (NOT FIREABLE(enregistrement_A_0) AND NOT FIREABLE(enregistrement_A_1) AND NOT FIREABLE(enregistrement_A_2) AND NOT FIREABLE(enregistrement_A_3) AND NOT FIREABLE(enregistrement_A_4)) OR (NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2)) OR (NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(liberation_A) OR (NOT FIREABLE(enregistrement_A_0) AND NOT FIREABLE(enregistrement_A_1) AND NOT FIREABLE(enregistrement_A_2) AND NOT FIREABLE(enregistrement_A_3) AND NOT FIREABLE(enregistrement_A_4)) OR (NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2)) OR (NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) A... (shortened)
lola: processed formula length: 569
lola: 2 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(liberation_A) 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(basculement_1) OR FIREABLE(basculement_2)) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4)) AND FIREABLE(liberation_A) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2) OR FIREABLE(liberation_B)))
lola: state equation: Generated DNF with 1400 literals and 120 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1580 markings, 2374 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((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(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 FIREABLE(timeout_A_1_1_0_3) OR FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((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(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 FIREABLE(timeout_A_1_1_0_3) OR FI... (shortened)
lola: processed formula length: 692
lola: 1 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((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(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 FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) 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)))
lola: state equation: Generated DNF with 2400 literals and 240 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1565 markings, 2353 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(liberation_B) 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 FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(ti... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(liberation_B) 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 FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(ti... (shortened)
lola: processed formula length: 955
lola: 1 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(liberation_B) 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 FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2)))) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)) AND (FIREABLE(liberation_A)) 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(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 FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)))
lola: state equation: Generated DNF with 7680 literals and 600 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2327 markings, 3669 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((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 FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((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 FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREAB... (shortened)
lola: processed formula length: 2457
lola: 1 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((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 FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4)) 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) OR FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND FIREABLE(liberation_B) AND NOT FIREABLE(timeout_B_0_2_1_0) AND NOT FIREABLE(timeout_B_1_2_1_0) AND NOT FIREABLE(timeout_B_2_2_1_0) AND NOT FIREABLE(timeout_B_0_2_2_0) AND NOT FIREABLE(timeout_B_1_2_2_0) AND NOT FIREABLE(timeout_B_2_2_2_0) AND NOT FIREABLE(timeout_B_0_2_3_0) AND NOT FIREABLE(timeout_B_1_2_3_0) AND NOT FIREABLE(timeout_B_2_2_3_0) AND NOT FIREABLE(timeout_B_0_2_4_0) AND NOT FIREABLE(timeout_B_1_2_4_0) AND NOT FIREABLE(timeout_B_2_2_4_0) AND NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4) 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) 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) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2330 markings, 3680 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no yes no no no no yes no no no yes no
lola:
preliminary result: no no yes yes no yes no no no no yes no no no yes no
lola: memory consumption: 14668 KB
lola: time consumption: 0 seconds

BK_STOP 1526557491434

--------------------
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="/tmp/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
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
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 r028-ebro-152646306300259"
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 ;