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

About the Execution of Irma.struct for BridgeAndVehicles-PT-V50P50N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3602.040 320267.00 289167.00 307.60 TF?FFFFFTFTTTFF? 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 4.3M
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 110K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 319K 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.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 76K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 211K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K 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 208K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 589K 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 2.6M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-PT-V50P50N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309400339
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526830708702


BK_STOP 1526831028969

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-V50P50N20 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 2350331, 'Memory': 15935.02, 'Tool': 'lola'}, {'Time': 2392618, 'Memory': 15943.84, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-PT-V50P50N20...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
BridgeAndVehicles-PT-V50P50N20: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V50P50N20: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-PT-V50P50N20 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2486/65536 symbol table entries, 36 collisions
lola: preprocessing...
lola: finding significant places
lola: 138 places, 2348 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: (E (((SUR_PONT_A <= ROUTE_A) U (1 <= SORTI_B))) AND (A (F ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ATTENTE_B))) OR E (G (((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 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50) OR (VIDANGE_1 + VIDANGE_2 <= ROUTE_A)))))) : (NOT(((((3 <= ROUTE_A) OR (3 <= ROUTE_A)) AND (SORTI_A <= 0)) AND E (G ((SUR_PONT_B <= CHOIX_1 + CHOIX_2))))) AND (E (((3 <= CAPACITE) U (2 <= CHOIX_1 + CHOIX_2))) OR (E (G ((2 <= SUR_PONT_A))) OR (SORTI_B + 1 <= CHOIX_1 + CHOIX_2)))) : E (G ((SORTI_A <= ATTENTE_A))) : NOT((((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 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 <= SORTI_B) AND ((SORTI_A + 1 <= VIDANGE_1 + VIDANGE_2) OR (VIDANGE_1 + VIDANGE_2 + 1 <= ROUTE_B))) OR (E (G ((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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + 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 <= CAPACITE))) OR E (F ((3 <= VIDANGE_1 + VIDANGE_2)))))) : A (F ((E (X ((ROUTE_A <= ATTENTE_A))) AND (ROUTE_B + 1 <= ROUTE_A)))) : (A (F (((SORTI_A <= 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 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50) AND (CAPACITE + 1 <= 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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + 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)))) OR (CAPACITE <= 2)) : (A (G (((SORTI_B <= CAPACITE) AND (3 <= ROUTE_A) AND (2 <= ROUTE_B)))) OR A (X (E (X ((2 <= SUR_PONT_A)))))) : A (F ((2 <= CONTROLEUR_1 + CONTROLEUR_2))) : NOT(A (F (((3 <= NB_ATTENTE_A_0) AND (COMPTEUR_3 <= NB_ATTENTE_A_8) AND (NB_ATTENTE_A_16 <= VIDANGE_1))))) : ((E (F ((2 <= NB_ATTENTE_B_8))) OR (3 <= NB_ATTENTE_B_35)) AND E (F (A (G ((COMPTEUR_15 <= NB_ATTENTE_A_42)))))) : NOT(NOT(NOT(A (F ((2 <= NB_ATTENTE_A_45)))))) : ((A (G (((NB_ATTENTE_A_26 <= COMPTEUR_13) OR (NB_ATTENTE_A_1 <= NB_ATTENTE_A_47)))) AND (NB_ATTENTE_A_3 <= NB_ATTENTE_A_13)) AND ((((NB_ATTENTE_B_24 <= 0) AND (NB_ATTENTE_B_44 + 1 <= NB_ATTENTE_B_31)) OR (NB_ATTENTE_B_44 <= 1)) AND ((NB_ATTENTE_A_26 + 1 <= NB_ATTENTE_A_18) OR (NB_ATTENTE_B_48 <= 0) OR ((NB_ATTENTE_A_33 <= 2) AND (COMPTEUR_0 + 1 <= NB_ATTENTE_A_38))))) : ((1 <= SORTI_B) OR ((E (G ((3 <= NB_ATTENTE_B_25))) OR E (G ((NB_ATTENTE_A_17 <= NB_ATTENTE_A_3)))) OR ((NB_ATTENTE_A_45 <= 1) AND (NB_ATTENTE_A_0 + 1 <= NB_ATTENTE_B_5) AND (COMPTEUR_9 <= 2) AND (NB_ATTENTE_B_4 <= 1)))) : (A (X (((3 <= NB_ATTENTE_B_30) AND (NB_ATTENTE_A_24 <= NB_ATTENTE_B_43) AND ((NB_ATTENTE_B_39 <= NB_ATTENTE_B_22) OR (NB_ATTENTE_A_37 <= NB_ATTENTE_A_28))))) OR A ((((COMPTEUR_2 <= NB_ATTENTE_B_27) OR (NB_ATTENTE_A_47 <= NB_ATTENTE_B_48)) U ((2 <= NB_ATTENTE_A_6) OR (3 <= NB_ATTENTE_B_28))))) : A ((A (G ((COMPTEUR_19 <= NB_ATTENTE_B_21))) U (1 <= COMPTEUR_7))) : (((A (F ((3 <= COMPTEUR_3))) OR ((NB_ATTENTE_B_17 + 1 <= NB_ATTENTE_B_20) AND (COMPTEUR_0 + 1 <= NB_ATTENTE_A_50))) OR (((NB_ATTENTE_B_5 + 1 <= NB_ATTENTE_A_18) OR (NB_ATTENTE_B_42 + 1 <= NB_ATTENTE_A_35)) OR E (G ((1 <= NB_ATTENTE_B_21))))) AND (NB_ATTENTE_B_11 <= NB_ATTENTE_B_5))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((SUR_PONT_A <= ROUTE_A) U (1 <= SORTI_B))) AND (A (F ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ATTENTE_B))) OR E (G (((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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((SUR_PONT_A <= ROUTE_A) U (1 <= SORTI_B)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((SUR_PONT_A <= ROUTE_A) U (1 <= SORTI_B))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
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: 405 markings, 504 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ATTENTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ATTENTE_B)))
lola: processed formula: A (F ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ATTENTE_B)))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 41015 markings, 57378 edges, 8203 markings/sec, 0 secs
lola: 75460 markings, 109445 edges, 6889 markings/sec, 5 secs
lola: 108772 markings, 157472 edges, 6662 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 120507 markings, 174363 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(((((3 <= ROUTE_A) OR (3 <= ROUTE_A)) AND (SORTI_A <= 0)) AND E (G ((SUR_PONT_B <= CHOIX_1 + CHOIX_2))))) AND (E (((3 <= CAPACITE) U (2 <= CHOIX_1 + CHOIX_2))) OR (E (G ((2 <= SUR_PONT_A))) OR (SORTI_B + 1 <= CHOIX_1 + CHOIX_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((ROUTE_A <= 2) AND (ROUTE_A <= 2)) OR (1 <= SORTI_A))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((ROUTE_A <= 2) AND (ROUTE_A <= 2)) OR (1 <= SORTI_A))
lola: processed formula length: 56
lola: 5 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: processed formula with 3 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 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CHOIX_1 + CHOIX_2 + 1 <= SUR_PONT_B)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((CHOIX_1 + CHOIX_2 + 1 <= SUR_PONT_B)))
lola: processed formula: A (F ((CHOIX_1 + CHOIX_2 + 1 <= SUR_PONT_B)))
lola: processed formula length: 45
lola: 5 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 463 markings, 463 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((SORTI_A <= ATTENTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (ATTENTE_A + 1 <= SORTI_A)))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
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: 275371 markings, 892577 edges, 3689329903141912576 markings/sec, 0 secs
lola: 556858 markings, 1921604 edges, 56297 markings/sec, 5 secs
lola: 836434 markings, 2854012 edges, 55915 markings/sec, 10 secs
lola: 1100156 markings, 3623996 edges, 52744 markings/sec, 15 secs
lola: 1355883 markings, 4414308 edges, 51145 markings/sec, 20 secs
lola: 1614667 markings, 5191201 edges, 51757 markings/sec, 25 secs
lola: 1864038 markings, 5982775 edges, 49874 markings/sec, 30 secs
lola: 2123005 markings, 6772542 edges, 51793 markings/sec, 35 secs
lola: 2371533 markings, 7574099 edges, 49706 markings/sec, 40 secs
lola: 2620093 markings, 8375893 edges, 49712 markings/sec, 45 secs
lola: 2872458 markings, 9153286 edges, 50473 markings/sec, 50 secs
lola: 3111837 markings, 9939711 edges, 47876 markings/sec, 55 secs
lola: 3349362 markings, 10718855 edges, 47505 markings/sec, 60 secs
lola: 3587466 markings, 11497750 edges, 47621 markings/sec, 65 secs
lola: 3840159 markings, 12290102 edges, 50539 markings/sec, 70 secs
lola: 4080511 markings, 13083454 edges, 48070 markings/sec, 75 secs
lola: 4316183 markings, 13876518 edges, 47134 markings/sec, 80 secs
lola: 4552300 markings, 14667662 edges, 47223 markings/sec, 85 secs
lola: 4791925 markings, 15467814 edges, 47925 markings/sec, 90 secs
lola: 5046334 markings, 16271699 edges, 50882 markings/sec, 95 secs
lola: 5283272 markings, 17074266 edges, 47388 markings/sec, 100 secs
lola: 5513522 markings, 17853761 edges, 46050 markings/sec, 105 secs
lola: 5743291 markings, 18629877 edges, 45954 markings/sec, 110 secs
lola: 5971281 markings, 19395470 edges, 45598 markings/sec, 115 secs
lola: 6203576 markings, 20196916 edges, 46459 markings/sec, 120 secs
lola: 6453001 markings, 20978550 edges, 49885 markings/sec, 125 secs
lola: 6667264 markings, 21722675 edges, 42853 markings/sec, 130 secs
lola: 6891946 markings, 22489400 edges, 44936 markings/sec, 135 secs
lola: 7113341 markings, 23254036 edges, 44279 markings/sec, 140 secs
lola: 7345015 markings, 24046336 edges, 46335 markings/sec, 145 secs
lola: 7575407 markings, 24844499 edges, 46078 markings/sec, 150 secs
lola: 7811297 markings, 25645581 edges, 47178 markings/sec, 155 secs
lola: 8061481 markings, 26471964 edges, 50037 markings/sec, 160 secs
lola: 8298354 markings, 27272084 edges, 47375 markings/sec, 165 secs
lola: 8531624 markings, 28074611 edges, 46654 markings/sec, 170 secs
lola: 8761347 markings, 28881283 edges, 45945 markings/sec, 175 secs
lola: 8991605 markings, 29678437 edges, 46052 markings/sec, 180 secs
lola: 9223085 markings, 30475166 edges, 46296 markings/sec, 185 secs
lola: 9452069 markings, 31279992 edges, 45797 markings/sec, 190 secs
lola: 9684128 markings, 32092599 edges, 46412 markings/sec, 195 secs
lola: 9919606 markings, 32913925 edges, 47096 markings/sec, 200 secs
lola: 10173983 markings, 33728939 edges, 50875 markings/sec, 205 secs
lola: 10409041 markings, 34532939 edges, 47012 markings/sec, 210 secs
lola: 10639113 markings, 35348683 edges, 46014 markings/sec, 215 secs
lola: 10864712 markings, 36145965 edges, 45120 markings/sec, 220 secs
lola: 11085293 markings, 36923461 edges, 44116 markings/sec, 225 secs
lola: 11306861 markings, 37703576 edges, 44314 markings/sec, 230 secs
lola: 11529220 markings, 38485833 edges, 44472 markings/sec, 235 secs
lola: 11752424 markings, 39271144 edges, 44641 markings/sec, 240 secs
lola: 11976214 markings, 40058224 edges, 44758 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((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 + NB_ATTENTE_A_21 + NB_ATTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((SORTI_B + 1 <= 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 + NB_ATTENTE_A_21... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((SORTI_B + 1 <= 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 + NB_ATTENTE_A_21... (shortened)
lola: processed formula length: 1004
lola: 9 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CAPACITE + 1 <= 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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((CAPACITE + 1 <= 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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + 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: processed formula: A (F ((CAPACITE + 1 <= 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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 +... (shortened)
lola: processed formula length: 931
lola: 9 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 413 markings, 413 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((ROUTE_A <= ATTENTE_A))) AND (ROUTE_B + 1 <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX((ROUTE_A <= ATTENTE_A)) AND (ROUTE_B + 1 <= ROUTE_A)))
lola: processed formula length: 67
lola: 2 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 413 markings, 412 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((SORTI_A <= 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 + NB_ATTENTE_A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((SORTI_A <= 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 + NB_ATTENTE_A_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((SORTI_A <= 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 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50) AND (CAPACITE + 1 <= 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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + 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: processed formula: A (F (((SORTI_A <= 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 + NB_ATTENTE_A_... (shortened)
lola: processed formula length: 1856
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 413 markings, 413 edges
lola: ========================================
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (CAPACITE <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (CAPACITE <= 2)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((SORTI_B <= CAPACITE) AND (3 <= ROUTE_A) AND (2 <= ROUTE_B)))) OR A (X (E (X ((2 <= SUR_PONT_A))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SORTI_B <= CAPACITE) AND (3 <= ROUTE_A) AND (2 <= ROUTE_B))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N20-CTLCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 49 markings, 48 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((2 <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((2 <= SUR_PONT_A)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: processed formula: A (F ((2 <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 413 markings, 413 edges
lola: ========================================
lola: subprocess 8 will run for 409 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((3 <= NB_ATTENTE_A_0) AND (COMPTEUR_3 <= NB_ATTENTE_A_8) AND (NB_ATTENTE_A_16 <= VIDANGE_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= NB_ATTENTE_A_0) AND (COMPTEUR_3 <= NB_ATTENTE_A_8) AND (NB_ATTENTE_A_16 <= VIDANGE_1))))
lola: processed formula length: 108
lola: 5 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
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: 413 markings, 412 edges
lola: ========================================
lola: subprocess 9 will run for 467 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((2 <= NB_ATTENTE_B_8))) OR (3 <= NB_ATTENTE_B_35)) AND E (F (A (G ((COMPTEUR_15 <= NB_ATTENTE_A_42))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 467 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= NB_ATTENTE_B_8)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N20-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N20-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 545 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= NB_ATTENTE_B_35)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= NB_ATTENTE_B_35)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 545 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(NOT(A (F ((2 <= NB_ATTENTE_A_45))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= NB_ATTENTE_A_45)))
lola: processed formula length: 37
lola: 11 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
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: 413 markings, 412 edges
lola: ========================================
lola: subprocess 11 will run for 654 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((NB_ATTENTE_A_26 <= COMPTEUR_13) OR (NB_ATTENTE_A_1 <= NB_ATTENTE_A_47)))) AND (NB_ATTENTE_A_3 <= NB_ATTENTE_A_13)) AND ((((NB_ATTENTE_B_24 <= 0) AND (NB_ATTENTE_B_44 + 1 <= NB_ATTENTE_B_31)) OR (NB_ATTENTE_B_44 <= 1)) AND ((NB_ATTENTE_A_26 + 1 <= NB_ATTENTE_A_18) OR (NB_ATTENTE_B_48 <= 0) OR ((NB_ATTENTE_A_33 <= 2) AND (COMPTEUR_0 + 1 <= NB_ATTENTE_A_38)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 654 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NB_ATTENTE_A_26 <= COMPTEUR_13) OR (NB_ATTENTE_A_1 <= NB_ATTENTE_A_47))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N20-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N20-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 817 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NB_ATTENTE_A_3 <= NB_ATTENTE_A_13) AND ((((NB_ATTENTE_B_24 <= 0) AND (NB_ATTENTE_B_44 + 1 <= NB_ATTENTE_B_31)) OR (NB_ATTENTE_B_44 <= 1)) AND ((NB_ATTENTE_A_26 + 1 <= NB_ATTENTE_A_18) OR (NB_ATTENTE_B_48 <= 0) OR ((NB_ATTENTE_A_33 <= 2) AND (COMPTEUR_0 + 1 <= NB_ATTENTE_A_38)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NB_ATTENTE_A_3 <= NB_ATTENTE_A_13) AND ((((NB_ATTENTE_B_24 <= 0) AND (NB_ATTENTE_B_44 + 1 <= NB_ATTENTE_B_31)) OR (NB_ATTENTE_B_44 <= 1)) AND ((NB_ATTENTE_A_26 + 1 <= NB_ATTENTE_A_18) OR (NB_ATTENTE_B_48 <= 0) OR ((NB_ATTENTE_A_33 <= 2) AND (COMPTEUR_0 + 1 <= NB_ATTENTE_A_38)))))
lola: processed formula length: 285
lola: 2 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 817 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= SORTI_B) OR ((E (G ((3 <= NB_ATTENTE_B_25))) OR E (G ((NB_ATTENTE_A_17 <= NB_ATTENTE_A_3)))) OR ((NB_ATTENTE_A_45 <= 1) AND (NB_ATTENTE_A_0 + 1 <= NB_ATTENTE_B_5) AND (COMPTEUR_9 <= 2) AND (NB_ATTENTE_B_4 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 817 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= SORTI_B)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= SORTI_B)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-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 13 will run for 1089 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= NB_ATTENTE_B_25)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NB_ATTENTE_B_25 <= 2)))
lola: processed formula length: 37
lola: 3 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NB_ATTENTE_A_17 <= NB_ATTENTE_A_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NB_ATTENTE_A_3 + 1 <= NB_ATTENTE_A_17)))
lola: processed formula length: 54
lola: 3 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
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: 564 markings, 563 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1089 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((3 <= NB_ATTENTE_B_30) AND (NB_ATTENTE_A_24 <= NB_ATTENTE_B_43) AND ((NB_ATTENTE_B_39 <= NB_ATTENTE_B_22) OR (NB_ATTENTE_A_37 <= NB_ATTENTE_A_28))))) OR A ((((COMPTEUR_2 <= NB_ATTENTE_B_27) OR (NB_ATTENTE_A_47 <= NB_ATTENTE_B_48)) U ((2 <= NB_ATTENTE_A_6) OR (3 <= NB_ATTENTE_B_28)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1089 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= NB_ATTENTE_B_30) AND (NB_ATTENTE_A_24 <= NB_ATTENTE_B_43) AND ((NB_ATTENTE_B_39 <= NB_ATTENTE_B_22) OR (NB_ATTENTE_A_37 <= NB_ATTENTE_A_28)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((3 <= NB_ATTENTE_B_30) AND (NB_ATTENTE_A_24 <= NB_ATTENTE_B_43) AND ((NB_ATTENTE_B_39 <= NB_ATTENTE_B_22) OR (NB_ATTENTE_A_37 <= NB_ATTENTE_A_28)))))
lola: processed formula: A (X (((3 <= NB_ATTENTE_B_30) AND (NB_ATTENTE_A_24 <= NB_ATTENTE_B_43) AND ((NB_ATTENTE_B_39 <= NB_ATTENTE_B_22) OR (NB_ATTENTE_A_37 <= NB_ATTENTE_A_28)))))
lola: processed formula length: 157
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 413 markings, 413 edges
lola: ========================================
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((COMPTEUR_2 <= NB_ATTENTE_B_27) OR (NB_ATTENTE_A_47 <= NB_ATTENTE_B_48)) U ((2 <= NB_ATTENTE_A_6) OR (3 <= NB_ATTENTE_B_28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((COMPTEUR_2 <= NB_ATTENTE_B_27) OR (NB_ATTENTE_A_47 <= NB_ATTENTE_B_48)) U ((2 <= NB_ATTENTE_A_6) OR (3 <= NB_ATTENTE_B_28))))
lola: processed formula: A ((((COMPTEUR_2 <= NB_ATTENTE_B_27) OR (NB_ATTENTE_A_47 <= NB_ATTENTE_B_48)) U ((2 <= NB_ATTENTE_A_6) OR (3 <= NB_ATTENTE_B_28))))
lola: processed formula length: 133
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 413 markings, 413 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((COMPTEUR_19 <= NB_ATTENTE_B_21))) U (1 <= COMPTEUR_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((A (G ((COMPTEUR_19 <= NB_ATTENTE_B_21))) U (1 <= COMPTEUR_7)))
lola: processed formula: A ((A (G ((COMPTEUR_19 <= NB_ATTENTE_B_21))) U (1 <= COMPTEUR_7)))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 413 markings, 413 edges
lola: ========================================
lola: subprocess 15 will run for 3266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (F ((3 <= COMPTEUR_3))) OR ((NB_ATTENTE_B_17 + 1 <= NB_ATTENTE_B_20) AND (COMPTEUR_0 + 1 <= NB_ATTENTE_A_50))) OR (((NB_ATTENTE_B_5 + 1 <= NB_ATTENTE_A_18) OR (NB_ATTENTE_B_42 + 1 <= NB_ATTENTE_A_35)) OR E (G ((1 <= NB_ATTENTE_B_21))))) AND (NB_ATTENTE_B_11 <= NB_ATTENTE_B_5))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= COMPTEUR_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= COMPTEUR_3)))
lola: processed formula: A (F ((3 <= COMPTEUR_3)))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 413 markings, 413 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=-1)
lola: ========================================
lola: ...considering subproblem: ((NB_ATTENTE_B_5 + 1 <= NB_ATTENTE_A_18) OR (NB_ATTENTE_B_42 + 1 <= NB_ATTENTE_A_35))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NB_ATTENTE_B_5 + 1 <= NB_ATTENTE_A_18) OR (NB_ATTENTE_B_42 + 1 <= NB_ATTENTE_A_35))
lola: processed formula length: 86
lola: 1 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-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: subprocess 18 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= NB_ATTENTE_B_21)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NB_ATTENTE_B_21 <= 0)))
lola: processed formula length: 37
lola: 3 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NB_ATTENTE_B_11 <= NB_ATTENTE_B_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NB_ATTENTE_B_11 <= NB_ATTENTE_B_5)
lola: processed formula length: 35
lola: 1 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N20-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown no no no no no yes no yes yes yes no no unknown
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished 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-V50P50N20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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-V50P50N20.tgz
mv BridgeAndVehicles-PT-V50P50N20 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 irma4mcc-structural"
echo " Input is BridgeAndVehicles-PT-V50P50N20, 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 r031-ebro-152646309400339"
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 ;