fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r028-ebro-152646306300297
Last Updated
June 26, 2018

About the Execution of LoLA for BridgeAndVehicles-PT-V20P20N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1211.200 208743.00 215495.00 65.10 TFFFFTFFFFTTFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 58K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 178K 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.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 113K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 106K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 311K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 1.1M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BridgeAndVehicles-PT-V20P20N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306300297
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526564494737

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P20N20 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P20N20 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ BridgeAndVehicles-PT-V20P20N20 @ 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: 1046/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: Size of bit vector: 2496
lola: finding significant places
lola: 78 places, 968 transitions, 71 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1133 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (ROUTE_A <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)
lola: after: (ROUTE_A <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (ATTENTE_A <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)
lola: after: (ATTENTE_A <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20)
lola: after: (2 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (2 <= VIDANGE_1 + VIDANGE_2)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (3 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= SUR_PONT_A)
lola: after: (1 <= SUR_PONT_A)
lola: LP says that atomic proposition is always false: (2 <= COMPTEUR_15)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_A_6)
lola: LP says that atomic proposition is always false: (2 <= COMPTEUR_20)
lola: LP says that atomic proposition is always false: (2 <= COMPTEUR_20)
lola: LP says that atomic proposition is always false: (3 <= COMPTEUR_7)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_B_6)
lola: E (F ((ROUTE_A <= 1))) : (A ((((ATTENTE_B <= ROUTE_A) AND (1 <= SUR_PONT_A)) U ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) OR (ROUTE_A <= CAPACITE)))) AND (NOT(A (F ((1 <= CONTROLEUR_1 + CONTROLEUR_2)))) OR ((2 <= ATTENTE_A) AND (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B)))) : ((ROUTE_B <= SORTI_A) OR E (G (E (F ((2 <= ATTENTE_B)))))) : A (((SORTI_B <= CONTROLEUR_1 + CONTROLEUR_2) U A (F (FALSE)))) : A (F (FALSE)) : E (F ((CAPACITE <= SUR_PONT_B))) : E ((E (X ((1 <= CAPACITE))) U ())) : A (G (((((1 <= SUR_PONT_A) OR (2 <= ROUTE_B)) AND (CHOIX_1 + CHOIX_2 + 1 <= CAPACITE)) AND E (X ((3 <= ROUTE_B)))))) : A (X (A (G ((NB_ATTENTE_A_12 + 1 <= ROUTE_B))))) : A (F (FALSE)) : A (X ((E (G ((COMPTEUR_19 <= NB_ATTENTE_A_3))) OR (((3 <= SORTI_B) AND (NB_ATTENTE_B_7 <= NB_ATTENTE_A_9)) OR (1 <= NB_ATTENTE_B_9))))) : E (((NB_ATTENTE_B_8 <= COMPTEUR_12) U E (G ((COMPTEUR_6 <= COMPTEUR_15))))) : (E (F (((COMPTEUR_9 <= 0) OR (COMPTEUR_1 <= ROUTE_B)))) AND E (G (E (X ((NB_ATTENTE_B_14 <= NB_ATTENTE_B_1)))))) : A (G (A (F (())))) : ((() OR A (((NB_ATTENTE_A_10 <= COMPTEUR_2) U (1 <= ROUTE_B)))) AND (() OR A (F (FALSE)))) : (E (G (((COMPTEUR_2 <= 0) OR (NB_ATTENTE_A_6 <= 0)))) OR ((CHOIX_2 + 1 <= NB_ATTENTE_A_7) OR NOT(E (X ((NB_ATTENTE_A_3 <= COMPTEUR_16))))))
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-3 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-4 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((E (G ((COMPTEUR_19 <= NB_ATTENTE_A_3))) OR (((3 <= SORTI_B) AND (NB_ATTENTE_B_7 <= NB_ATTENTE_A_9)) OR (1 <= NB_ATTENTE_B_9)))))
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:297
lola: processed formula: AX((NOT(A(TRUE U (NB_ATTENTE_A_3 + 1 <= COMPTEUR_19))) OR (((3 <= SORTI_B) AND (NB_ATTENTE_B_7 <= NB_ATTENTE_A_9)) OR (1 <= NB_ATTENTE_B_9))))
lola: processed formula length: 143
lola: 37 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: 2061 markings, 4001 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((COMPTEUR_9 <= 0) OR (COMPTEUR_1 <= ROUTE_B)))) AND E (G (E (X ((NB_ATTENTE_B_14 <= NB_ATTENTE_B_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((COMPTEUR_9 <= 0) OR (COMPTEUR_1 <= ROUTE_B))))
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 (((COMPTEUR_9 <= 0) OR (COMPTEUR_1 <= ROUTE_B))))
lola: processed formula length: 55
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: ((COMPTEUR_9 <= 0) OR (COMPTEUR_1 <= ROUTE_B))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N20-CTLCardinality-7-0.sara
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((NB_ATTENTE_B_14 <= NB_ATTENTE_B_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: ========================================
lola: state equation: calling and running sara
lola: processed formula: NOT(A(TRUE U NOT(EX((NB_ATTENTE_B_14 <= NB_ATTENTE_B_1)))))
lola: processed formula length: 59
lola: 36 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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).
sara: try reading problem file BridgeAndVehicles-PT-V20P20N20-CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: 302436 markings, 984236 edges, 60487 markings/sec, 0 secs
lola: 602089 markings, 1986985 edges, 59931 markings/sec, 5 secs
lola: 901541 markings, 2999807 edges, 59890 markings/sec, 10 secs
lola: 1200920 markings, 4019720 edges, 59876 markings/sec, 15 secs
lola: 1500569 markings, 5049752 edges, 59930 markings/sec, 20 secs
lola: 1796131 markings, 6072124 edges, 59112 markings/sec, 25 secs
lola: 2093565 markings, 7100290 edges, 59487 markings/sec, 30 secs
lola: 2392654 markings, 8141517 edges, 59818 markings/sec, 35 secs
lola: 2692121 markings, 9181615 edges, 59893 markings/sec, 40 secs
lola: 2982893 markings, 10192171 edges, 58154 markings/sec, 45 secs
lola: 3271920 markings, 11205908 edges, 57805 markings/sec, 50 secs
lola: 3558628 markings, 12194115 edges, 57342 markings/sec, 55 secs
lola: 3846237 markings, 13209156 edges, 57522 markings/sec, 60 secs
lola: 4130090 markings, 14190492 edges, 56771 markings/sec, 65 secs
lola: 4416590 markings, 15207831 edges, 57300 markings/sec, 70 secs
lola: 4701843 markings, 16182957 edges, 57051 markings/sec, 75 secs
lola: 4988033 markings, 17166774 edges, 57238 markings/sec, 80 secs
lola: 5272325 markings, 18146134 edges, 56858 markings/sec, 85 secs
lola: 5553787 markings, 19138219 edges, 56292 markings/sec, 90 secs
lola: 5836148 markings, 20147174 edges, 56472 markings/sec, 95 secs
lola: 6114079 markings, 21117643 edges, 55586 markings/sec, 100 secs
lola: 6389201 markings, 22094181 edges, 55024 markings/sec, 105 secs
lola: 6663833 markings, 23084128 edges, 54926 markings/sec, 110 secs
lola: 6940341 markings, 24049556 edges, 55302 markings/sec, 115 secs
lola: 7218829 markings, 25040518 edges, 55698 markings/sec, 120 secs
lola: 7500199 markings, 26053829 edges, 56274 markings/sec, 125 secs
lola: 7777496 markings, 27035179 edges, 55459 markings/sec, 130 secs
lola: 8053623 markings, 28015862 edges, 55225 markings/sec, 135 secs
lola: 8331956 markings, 29015458 edges, 55667 markings/sec, 140 secs
lola: 8619423 markings, 30058346 edges, 57493 markings/sec, 145 secs
lola: 8893736 markings, 31022531 edges, 54863 markings/sec, 150 secs
lola: 9173205 markings, 32020568 edges, 55894 markings/sec, 155 secs
lola: 9454250 markings, 33042505 edges, 56209 markings/sec, 160 secs
lola: 9740439 markings, 34079401 edges, 57238 markings/sec, 165 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9783606 markings, 34241999 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((NB_ATTENTE_A_12 + 1 <= ROUTE_B)))))
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: (ROUTE_B <= NB_ATTENTE_A_12)
lola: processed formula length: 28
lola: 36 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: 20 markings, 19 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((1 <= SUR_PONT_A) OR (2 <= ROUTE_B)) AND (CHOIX_1 + CHOIX_2 + 1 <= CAPACITE)))) AND A (G (E (X ((3 <= ROUTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= SUR_PONT_A) OR (2 <= ROUTE_B)) AND (CHOIX_1 + CHOIX_2 + 1 <= CAPACITE))))
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 ((((1 <= SUR_PONT_A) OR (2 <= ROUTE_B)) AND (CHOIX_1 + CHOIX_2 + 1 <= CAPACITE))))
lola: processed formula length: 88
lola: 36 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: (((SUR_PONT_A <= 0) AND (ROUTE_B <= 1)) OR (CAPACITE <= CHOIX_1 + CHOIX_2))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N20-CTLCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((COMPTEUR_2 <= 0) OR (NB_ATTENTE_A_6 <= 0)))) OR ((CHOIX_2 + 1 <= NB_ATTENTE_A_7) OR A (X ((COMPTEUR_16 + 1 <= NB_ATTENTE_A_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (CHOIX_2 + 1 <= NB_ATTENTE_A_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (CHOIX_2 + 1 <= NB_ATTENTE_A_7)
lola: processed formula length: 31
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: processed formula with 1 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 11 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((COMPTEUR_2 <= 0) OR (NB_ATTENTE_A_6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((COMPTEUR_2 <= 0) OR (NB_ATTENTE_A_6 <= 0))))
lola: processed formula length: 53
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: 166 markings, 165 edges
lola: lola: SUBRESULT
lola: result: yes
========================================
lola: The Boolean predicate is true.

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((ROUTE_A <= 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 ((ROUTE_A <= 1)))
lola: processed formula length: 22
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: (ROUTE_A <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N20-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N20-CTLCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((CAPACITE <= SUR_PONT_B)))
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 ((CAPACITE <= SUR_PONT_B)))
lola: processed formula length: 32
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: (CAPACITE <= SUR_PONT_B)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N20-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N20-CTLCardinality-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((NB_ATTENTE_B_8 <= COMPTEUR_12) U E (G ((COMPTEUR_6 <= COMPTEUR_15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((NB_ATTENTE_B_8 <= COMPTEUR_12) U NOT(A(TRUE U (COMPTEUR_15 + 1 <= COMPTEUR_6))))
lola: processed formula length: 83
lola: 37 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: 44165 markings, 96659 edges

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ROUTE_B <= SORTI_A) OR E (G (E (F ((2 <= ATTENTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ROUTE_B <= SORTI_A)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ROUTE_B <= SORTI_A)
lola: processed formula length: 20
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: processed formula with 1 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 15 will run for 3387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= ATTENTE_B)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (2 <= ATTENTE_B)
lola: processed formula length: 16
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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: 453738 markings, 998049 edges, 90748 markings/sec, 0 secs
lola: 889091 markings, 1976661 edges, 87071 markings/sec, 5 secs
lola: 1321536 markings, 2955877 edges, 86489 markings/sec, 10 secs
lola: 1753309 markings, 3936235 edges, 86355 markings/sec, 15 secs
lola: 2186376 markings, 4919560 edges, 86613 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: Reachability of the predicate is not possibly preserved.
lola: 2233266 markings, 5027762 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((ATTENTE_B <= ROUTE_A) AND (1 <= SUR_PONT_A)) U ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) OR (ROUTE_A <= CAPACITE)))) AND (E (G ((CONTROLEUR_1 + CONTROLEUR_2 <= 0))) OR ((2 <= ATTENTE_A) AND (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= ATTENTE_A) AND (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= ATTENTE_A) AND (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B))
lola: processed formula length: 66
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: processed formula with 2 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((ATTENTE_B <= ROUTE_A) AND (1 <= SUR_PONT_A)) U ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) OR (ROUTE_A <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((ATTENTE_B <= ROUTE_A) AND (1 <= SUR_PONT_A)) U ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) OR (ROUTE_A <= CAPACITE))))
lola: processed formula length: 117
lola: 38 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A ((((ATTENTE_B <= ROUTE_A) AND (1 <= SUR_PONT_A)) U ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) OR (ROUTE_A <= CAPACITE)))) AND (E (G ((CONTROLEUR_1 + CONTROLEUR_2 <= 0))) OR ((2 <= ATTENTE_A) AND (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((2 <= ATTENTE_A) AND (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= ATTENTE_A) AND (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B))
lola: processed formula length: 66
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: ...considering subproblem: E (G ((CONTROLEUR_1 + CONTROLEUR_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((CONTROLEUR_1 + CONTROLEUR_2 <= 0)))
lola: processed formula length: 42
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.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 is not possibly preserved.
lola: 441 markings, 840 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no no yes yes no no no yes
lola:
preliminary result: yes no no no no yes no no no no yes yes no no no yes
lola: ========================================
lola: memory consumption: 29760 KB
lola: time consumption: 208 seconds

BK_STOP 1526564703480

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V20P20N20"
export BK_EXAMINATION="CTLCardinality"
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-V20P20N20.tgz
mv BridgeAndVehicles-PT-V20P20N20 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-V20P20N20, examination is CTLCardinality"
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-152646306300297"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;