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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306300256
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526557459852

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 CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ 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-CTLFireability.task
lola: A ((A (X ((NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)))) U E (G ((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(liberation_A)))))) : E (X (E (F (A (X ((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)))))))) : A (F ((E (G (((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 A (X ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2))))))) : A (F (((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))))) : E ((A (F ((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)))) U (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(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_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 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))))) : A (G (((E (X (FIREABLE(liberation_A))) OR A (F (FIREABLE(liberation_B)))) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2))))) : NOT(E (F (E (X (((FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)) 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 (G (((A (X (FIREABLE(liberation_B))) 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 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) OR FIREABLE(liberation_A) 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 (FIREABLE(enregistrement_B_0) OR FIREABLE(enregistrement_B_1) OR FIREABLE(enregistrement_B_2) OR FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4))))) : E (F (((FIREABLE(autorisation_A_1_4) AND FIREABLE(timeout_B_0_2_3_0)) OR E (F ((FIREABLE(liberation_B) AND FIREABLE(timeout_A_0_1_0_3))))))) : NOT(E (G (NOT FIREABLE(autorisation_A_1_4)))) : E (G (E (F (((FIREABLE(autorisation_B_2_4) OR FIREABLE(enregistrement_B_0)) AND (FIREABLE(autorisation_A_1_2) OR FIREABLE(timeout_B_1_2_2_0))))))) : (((E (X ((FIREABLE(autorisation_B_2_1) AND FIREABLE(decision_1_1)))) OR (FIREABLE(timeout_B_1_2_1_0) AND FIREABLE(autorisation_A_1_2) AND FIREABLE(enregistrement_A_4) AND FIREABLE(enregistrement_A_2))) OR E (G ((FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_A_0_1_0_3) OR NOT FIREABLE(timeout_B_1_2_4_0))))) AND (FIREABLE(enregistrement_B_3) OR NOT((A (X (FIREABLE(timeout_A_0_1_0_2))) AND A (F (FIREABLE(enregistrement_B_2))))))) : NOT(E (F ((FIREABLE(decision_1_2) AND FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(autorisation_B_2_1) AND FIREABLE(timeout_B_1_2_4_0))))) : E (F (E (F (FIREABLE(timeout_A_0_1_0_4))))) : A (F (E ((FIREABLE(decision_1_2) U (FIREABLE(timeout_A_0_1_0_4) AND FIREABLE(timeout_B_2_2_1_0)))))) : (A (X (A (G (FIREABLE(enregistrement_A_0))))) OR E (G (NOT(A (X (FIREABLE(basculement_1)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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 ((A (X ((NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)))) U E (G ((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(liberation_A))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(AX((NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2))) U NOT(A(TRUE U (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) AND NOT FIREABLE(liberation_A)))))
lola: processed formula length: 301
lola: 31 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2700 markings, 5679 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-0 FALSE 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 (X (E (F (A (X ((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)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(E(TRUE U AX((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)))))
lola: processed formula length: 399
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 41 markings, 40 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-1 TRUE 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: A (F ((E (G (((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 A (X ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U (NOT(A(TRUE U ((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(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))))) OR AX((FIREABLE(decision_0_1) OR FIREAB... (shortened)
lola: processed formula length: 474
lola: 31 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2862 markings, 10399 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-2 TRUE 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: A (G ((E (X (FIREABLE(liberation_A))) OR (A (F (FIREABLE(liberation_B))) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (NOT(EX(FIREABLE(liberation_A))) AND (NOT(A(TRUE U FIREABLE(liberation_B))) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2))))))
lola: processed formula length: 152
lola: 33 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 604 markings, 1440 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-5 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: A (X (A (G (((NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)) 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: ((FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)) 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... (shortened)
lola: processed formula length: 443
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is invariant from successors.
lola: 2329 markings, 3683 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-6 TRUE 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 (G (((A (X (FIREABLE(liberation_B))) 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 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 FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U ((NOT(AX(FIREABLE(liberation_B))) OR (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_... (shortened)
lola: processed formula length: 886
lola: 33 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2610 markings, 5151 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-7 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 (X ((FIREABLE(autorisation_B_2_1) AND FIREABLE(decision_1_1)))) OR ((FIREABLE(timeout_B_1_2_1_0) AND FIREABLE(autorisation_A_1_2) AND FIREABLE(enregistrement_A_4) AND FIREABLE(enregistrement_A_2)) OR E (G ((FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_A_0_1_0_3) OR NOT FIREABLE(timeout_B_1_2_4_0)))))) AND (FIREABLE(enregistrement_B_3) OR (E (X (NOT FIREABLE(timeout_A_0_1_0_2))) OR E (G (N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(enregistrement_B_2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(enregistrement_B_2)))
lola: processed formula length: 40
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(timeout_B_1_2_1_0) AND FIREABLE(autorisation_A_1_2) AND FIREABLE(enregistrement_A_4) AND FIREABLE(enregistrement_A_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(timeout_B_1_2_1_0) AND FIREABLE(autorisation_A_1_2) AND FIREABLE(enregistrement_A_4) AND FIREABLE(enregistrement_A_2))
lola: processed formula length: 128
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_A_0_1_0_3) OR NOT FIREABLE(timeout_B_1_2_4_0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_A_0_1_0_3) OR NOT FIREABLE(timeout_B_1_2_4_0))))
lola: processed formula length: 105
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 42 markings, 41 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-11 TRUE 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: (A (X (A (G (FIREABLE(enregistrement_A_0))))) OR E (G (E (X (NOT FIREABLE(basculement_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (NOT FIREABLE(basculement_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX(NOT FIREABLE(basculement_1)))))
lola: processed formula length: 51
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2871 markings, 7120 edges
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (FIREABLE(enregistrement_A_0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(enregistrement_A_0)
lola: processed formula length: 32
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-15 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: E (F (FIREABLE(timeout_A_0_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_0_1_0_4)))
lola: processed formula length: 35
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.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_4)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-CTLFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2284 markings, 3830 edges

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(decision_1_2) OR NOT FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(autorisation_B_2_1) OR NOT FIREABLE(timeout_B_1_2_4_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:695
lola: processed formula: A (G ((NOT FIREABLE(decision_1_2) OR NOT FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(autorisation_B_2_1) OR NOT FIREABLE(timeout_B_1_2_4_0))))
lola: processed formula length: 141
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.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:695
lola: formula 0: (FIREABLE(decision_1_2) AND FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(autorisation_B_2_1) AND FIREABLE(timeout_B_1_2_4_0))
lola: state equation: Generated DNF with 33 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-CTLFireability-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2048 markings, 3037 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-12 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 (F (FIREABLE(autorisation_A_1_4)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: NOT FIREABLE(autorisation_A_1_4)
lola: processed formula length: 32
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 43 markings, 42 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-9 FALSE 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: A (F (((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)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((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(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)))
lola: processed formula length: 334
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 42 markings, 41 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-3 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 (F (E ((FIREABLE(decision_1_2) U (FIREABLE(timeout_A_0_1_0_4) AND FIREABLE(timeout_B_2_2_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U E(FIREABLE(decision_1_2) U (FIREABLE(timeout_A_0_1_0_4) AND FIREABLE(timeout_B_2_2_1_0))))
lola: processed formula length: 99
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 44 markings, 89 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-14 FALSE 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 ((A (F ((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)))) U (NOT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(A(TRUE U (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))) U (NOT... (shortened)
lola: processed formula length: 1203
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 42 markings, 42 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-4 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 (G (E (F (((FIREABLE(autorisation_B_2_4) OR FIREABLE(enregistrement_B_0)) AND (FIREABLE(autorisation_A_1_2) OR FIREABLE(timeout_B_1_2_2_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: ((FIREABLE(autorisation_B_2_4) OR FIREABLE(enregistrement_B_0)) AND (FIREABLE(autorisation_A_1_2) OR FIREABLE(timeout_B_1_2_2_0)))
lola: processed formula length: 132
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: Reachability of the predicate is not possibly preserved.
lola: 2038 markings, 4000 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-10 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(autorisation_A_1_4) AND FIREABLE(timeout_B_0_2_3_0)))) OR E (F ((FIREABLE(liberation_B) AND FIREABLE(timeout_A_0_1_0_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(liberation_B) AND FIREABLE(timeout_A_0_1_0_3))))
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) AND FIREABLE(timeout_A_0_1_0_3))))
lola: processed formula length: 64
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.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) AND FIREABLE(timeout_A_0_1_0_3))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-CTLFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2330 markings, 3720 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(autorisation_A_1_4) AND FIREABLE(timeout_B_0_2_3_0)))) OR E (F ((FIREABLE(liberation_B) AND FIREABLE(timeout_A_0_1_0_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(liberation_B) AND FIREABLE(timeout_A_0_1_0_3))))
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) AND FIREABLE(timeout_A_0_1_0_3))))
lola: processed formula length: 64
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.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) AND FIREABLE(timeout_A_0_1_0_3))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-CTLFireability-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-CTLFireability-16-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2330 markings, 3720 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(autorisation_A_1_4) AND FIREABLE(timeout_B_0_2_3_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(autorisation_A_1_4) AND FIREABLE(timeout_B_0_2_3_0))))
lola: processed formula length: 70
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLFireability.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_4) AND FIREABLE(timeout_B_0_2_3_0))
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2368 markings, 3984 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

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

BK_STOP 1526557460605

--------------------
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="CTLFireability"
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 CTLFireability"
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-152646306300256"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;