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

About the Execution of M4M.struct for BridgeAndVehicles-PT-V50P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6829.210 600373.00 572080.00 333.30 TTTFFTFT?FTTTFT? 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.3M
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 69K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 205K 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 4.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 72K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K 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.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is BridgeAndVehicles-PT-V50P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-ebro-152646315300311
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527119607258


BK_STOP 1527120207631

--------------------
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-V50P20N10 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': 2060437, 'Memory': 14463.34, 'Tool': 'lola'}, {'Time': 2062503, 'Memory': 13843.29, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-PT-V50P20N10...

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V50P20N10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-PT-V50P20N10 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1456/65536 symbol table entries, 11 collisions
lola: preprocessing...
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: NOT(E (((ATTENTE_A + 1 <= CHOIX_1 + CHOIX_2) U ((3 <= SORTI_B) AND (2 <= SUR_PONT_A))))) : (A (F ((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 <= SUR_PONT_B))) OR (2 <= VIDANGE_1 + VIDANGE_2)) : E (X ((A (F ((1 <= SORTI_B))) OR E (X ((2 <= SUR_PONT_A)))))) : NOT((A (G (((3 <= SUR_PONT_A) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 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)))) AND A (((SORTI_A <= ROUTE_A) U (ATTENTE_B <= SUR_PONT_A))))) : E (G (A (((1 <= ROUTE_B) U (ATTENTE_A <= SUR_PONT_A))))) : A (F (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 <= 2))))) : 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) AND (ATTENTE_A <= 2)))) : NOT(((((3 <= ROUTE_B) OR (SUR_PONT_A <= VIDANGE_1 + VIDANGE_2) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 2)) AND (SORTI_B + 1 <= ATTENTE_A)) OR E (F (((1 <= CONTROLEUR_1 + CONTROLEUR_2) AND (1 <= VIDANGE_1 + VIDANGE_2)))))) : E (F (NOT(A (F ((NB_ATTENTE_A_23 <= NB_ATTENTE_B_6)))))) : A (F (A (G (((ROUTE_B <= NB_ATTENTE_A_13) AND (3 <= NB_ATTENTE_A_39)))))) : ((3 <= ATTENTE_B) OR (E (F (((NB_ATTENTE_B_1 <= COMPTEUR_7) AND (1 <= NB_ATTENTE_A_42)))) OR ((NB_ATTENTE_B_8 + 1 <= NB_ATTENTE_B_0) AND (ROUTE_B + 1 <= NB_ATTENTE_A_23) AND ((NB_ATTENTE_B_42 <= NB_ATTENTE_B_46) OR (3 <= NB_ATTENTE_A_25) OR ((3 <= NB_ATTENTE_B_8) AND (3 <= NB_ATTENTE_A_35)))))) : E (F (((1 <= NB_ATTENTE_A_45) OR ((NB_ATTENTE_A_1 <= 0) AND (NB_ATTENTE_B_35 + 1 <= NB_ATTENTE_A_41))))) : (A (G (((NB_ATTENTE_A_21 <= NB_ATTENTE_B_1) OR (ROUTE_A <= NB_ATTENTE_A_43) OR ((2 <= NB_ATTENTE_A_23) AND (NB_ATTENTE_A_11 <= NB_ATTENTE_B_36))))) OR ((((NB_ATTENTE_B_45 <= CHOIX_1) AND (NB_ATTENTE_A_43 <= NB_ATTENTE_B_34) AND ((1 <= NB_ATTENTE_B_1) OR (NB_ATTENTE_B_8 <= NB_ATTENTE_B_26))) AND E (G ((NB_ATTENTE_A_39 <= NB_ATTENTE_A_42)))) OR E (G ((NB_ATTENTE_B_38 <= NB_ATTENTE_A_50))))) : NOT(E (F (((VIDANGE_1 <= 1) AND (NB_ATTENTE_A_23 + 1 <= NB_ATTENTE_A_18))))) : (((E (G ((CHOIX_1 <= NB_ATTENTE_B_11))) AND ((2 <= NB_ATTENTE_B_24) OR (2 <= NB_ATTENTE_B_21) OR (NB_ATTENTE_A_20 <= NB_ATTENTE_A_35))) AND A (F (((3 <= NB_ATTENTE_A_0) AND (1 <= NB_ATTENTE_B_32))))) OR NOT(E (G ((NB_ATTENTE_A_36 + 1 <= COMPTEUR_0))))) : (E (X (E (X ((NB_ATTENTE_A_13 <= NB_ATTENTE_B_40))))) AND A (F (((NB_ATTENTE_A_30 <= NB_ATTENTE_B_5) AND (NB_ATTENTE_A_13 <= NB_ATTENTE_B_33) AND (COMPTEUR_0 <= NB_ATTENTE_A_8)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((ATTENTE_A + 1 <= CHOIX_1 + CHOIX_2) U ((3 <= SORTI_B) AND (2 <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((CHOIX_1 + CHOIX_2 <= ATTENTE_A) R ((SORTI_B <= 2) OR (SUR_PONT_A <= 1))))
lola: processed formula: A (((CHOIX_1 + CHOIX_2 <= ATTENTE_A) R ((SORTI_B <= 2) OR (SUR_PONT_A <= 1))))
lola: processed formula length: 79
lola: 4 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 153 markings, 152 edges
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((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_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((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 <= SUR_PONT_B)))
lola: processed formula: A (F ((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... (shortened)
lola: processed formula length: 929
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: ========================================
lola: 26361 markings, 38609 edges, 5272 markings/sec, 0 secs
lola: 44794 markings, 66788 edges, 3687 markings/sec, 5 secs
lola: 56804 markings, 85211 edges, 2402 markings/sec, 10 secs
lola: 68579 markings, 103244 edges, 2355 markings/sec, 15 secs
lola: 81337 markings, 122889 edges, 2552 markings/sec, 20 secs
lola: 95223 markings, 144140 edges, 2777 markings/sec, 25 secs
lola: 113312 markings, 171664 edges, 3618 markings/sec, 30 secs
lola: 131338 markings, 198439 edges, 3605 markings/sec, 35 secs
lola: 144058 markings, 218088 edges, 2544 markings/sec, 40 secs
lola: 153119 markings, 232105 edges, 1812 markings/sec, 45 secs
lola: 163100 markings, 247706 edges, 1996 markings/sec, 50 secs
lola: 182254 markings, 276905 edges, 3831 markings/sec, 55 secs
lola: 203919 markings, 309716 edges, 4333 markings/sec, 60 secs
lola: 220008 markings, 333980 edges, 3218 markings/sec, 65 secs
lola: 229909 markings, 349400 edges, 1980 markings/sec, 70 secs
lola: 242280 markings, 368555 edges, 2474 markings/sec, 75 secs
lola: 257149 markings, 391048 edges, 2974 markings/sec, 80 secs
lola: 269648 markings, 410455 edges, 2500 markings/sec, 85 secs
lola: 284729 markings, 433418 edges, 3016 markings/sec, 90 secs
lola: 309036 markings, 470375 edges, 4861 markings/sec, 95 secs
lola: 340010 markings, 517061 edges, 6195 markings/sec, 100 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: 347337 markings, 528104 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (F ((1 <= SORTI_B))) OR E (X ((2 <= SUR_PONT_A))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((1 <= SORTI_B)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (1 <= SORTI_B)))
lola: processed formula length: 28
lola: 3 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: 448358 markings, 1313825 edges, 2474375052007571456 markings/sec, 0 secs
lola: 945031 markings, 2382885 edges, 99335 markings/sec, 5 secs
lola: 1440919 markings, 3365947 edges, 99178 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1797730 markings, 4009207 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G (((3 <= SUR_PONT_A) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((SUR_PONT_A <= 2) AND (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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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-V50P20N10-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-CTLCardinality-3.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 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((ROUTE_A + 1 <= SORTI_A) R (SUR_PONT_A + 1 <= ATTENTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((SORTI_A <= ROUTE_A) U (ATTENTE_B <= SUR_PONT_A)))
lola: processed formula length: 56
lola: 11 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((1 <= ROUTE_B) U (ATTENTE_A <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((1 <= ROUTE_B) U (ATTENTE_A <= SUR_PONT_A)))))
lola: processed formula length: 65
lola: 2 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 101141 markings, 115270 edges
lola: ========================================
lola: subprocess 5 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (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_ATTENT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (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_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... (shortened)
lola: processed formula length: 937
lola: 3 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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 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: 422 markings, 422 edges
lola: ========================================
lola: subprocess 6 will run for 341 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) AND (ATTENTE_A <= 2))))
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: 954
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: 422 markings, 422 edges
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((3 <= ROUTE_B) OR (SUR_PONT_A <= VIDANGE_1 + VIDANGE_2) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 2)) AND (SORTI_B + 1 <= ATTENTE_A)) OR E (F (((1 <= CONTROLEUR_1 + CONTROLEUR_2) AND (1 <= VIDANGE_1 + VIDANGE_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((ROUTE_B <= 2) AND (VIDANGE_1 + VIDANGE_2 + 1 <= SUR_PONT_A) AND (3 <= CONTROLEUR_1 + CONTROLEUR_2)) OR (ATTENTE_A <= SORTI_B))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((ROUTE_B <= 2) AND (VIDANGE_1 + VIDANGE_2 + 1 <= SUR_PONT_A) AND (3 <= CONTROLEUR_1 + CONTROLEUR_2)) OR (ATTENTE_A <= SORTI_B))
lola: processed formula length: 130
lola: 5 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: processed formula with 4 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 8 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((CONTROLEUR_1 + CONTROLEUR_2 <= 0) OR (VIDANGE_1 + VIDANGE_2 <= 0))))
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 484 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-V50P20N10-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-CTLCardinality-8.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (F ((NB_ATTENTE_A_23 <= NB_ATTENTE_B_6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (NB_ATTENTE_A_23 <= NB_ATTENTE_B_6))))
lola: processed formula length: 60
lola: 6 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 327629 markings, 997666 edges, 3096159597753270272 markings/sec, 0 secs
lola: 636420 markings, 2011698 edges, 61758 markings/sec, 5 secs
lola: 954082 markings, 3054730 edges, 63532 markings/sec, 10 secs
lola: 1269176 markings, 4093201 edges, 63019 markings/sec, 15 secs
lola: 1582633 markings, 5130333 edges, 62691 markings/sec, 20 secs
lola: 1893639 markings, 6158092 edges, 62201 markings/sec, 25 secs
lola: 2199361 markings, 7166622 edges, 61144 markings/sec, 30 secs
lola: 2504375 markings, 8176170 edges, 61003 markings/sec, 35 secs
lola: 2801881 markings, 9158147 edges, 59501 markings/sec, 40 secs
lola: 3102529 markings, 10153343 edges, 60130 markings/sec, 45 secs
lola: 3400619 markings, 11136610 edges, 59618 markings/sec, 50 secs
lola: 3699927 markings, 12130591 edges, 59862 markings/sec, 55 secs
lola: 4000058 markings, 13120772 edges, 60026 markings/sec, 60 secs
lola: 4301288 markings, 14120453 edges, 60246 markings/sec, 65 secs
lola: 4596877 markings, 15098122 edges, 59118 markings/sec, 70 secs
lola: 4892205 markings, 16080544 edges, 59066 markings/sec, 75 secs
lola: 5190544 markings, 17065938 edges, 59668 markings/sec, 80 secs
lola: 5491593 markings, 18067626 edges, 60210 markings/sec, 85 secs
lola: 5785426 markings, 19040176 edges, 58767 markings/sec, 90 secs
lola: 6082198 markings, 20026304 edges, 59354 markings/sec, 95 secs
lola: 6375330 markings, 21000700 edges, 58626 markings/sec, 100 secs
lola: 6673723 markings, 21990877 edges, 59679 markings/sec, 105 secs
lola: 6966594 markings, 22967656 edges, 58574 markings/sec, 110 secs
lola: 7258659 markings, 23935194 edges, 58413 markings/sec, 115 secs
lola: 7550697 markings, 24905771 edges, 58408 markings/sec, 120 secs
lola: 7841594 markings, 25875333 edges, 58179 markings/sec, 125 secs
lola: 8125363 markings, 26815667 edges, 56754 markings/sec, 130 secs
lola: 8414730 markings, 27777961 edges, 57873 markings/sec, 135 secs
lola: 8699707 markings, 28728016 edges, 56995 markings/sec, 140 secs
lola: 8982387 markings, 29664452 edges, 56536 markings/sec, 145 secs
lola: 9264689 markings, 30599644 edges, 56460 markings/sec, 150 secs
lola: 9558799 markings, 31578590 edges, 58822 markings/sec, 155 secs
lola: 9849325 markings, 32546208 edges, 58105 markings/sec, 160 secs
lola: 10137011 markings, 33500883 edges, 57537 markings/sec, 165 secs
lola: 10420134 markings, 34443176 edges, 56625 markings/sec, 170 secs
lola: 10708765 markings, 35403681 edges, 57726 markings/sec, 175 secs
lola: 10993181 markings, 36352324 edges, 56883 markings/sec, 180 secs
lola: 11275446 markings, 37292034 edges, 56453 markings/sec, 185 secs
lola: 11559821 markings, 38249346 edges, 56875 markings/sec, 190 secs
lola: 11842601 markings, 39205738 edges, 56556 markings/sec, 195 secs
lola: 12126965 markings, 40162952 edges, 56873 markings/sec, 200 secs
lola: 12404427 markings, 41093562 edges, 55492 markings/sec, 205 secs
lola: 12686455 markings, 42051561 edges, 56406 markings/sec, 210 secs
lola: 12964914 markings, 42998145 edges, 55692 markings/sec, 215 secs
lola: 13243695 markings, 43940565 edges, 55756 markings/sec, 220 secs
lola: 13520004 markings, 44870165 edges, 55262 markings/sec, 225 secs
lola: 13804372 markings, 45836953 edges, 56874 markings/sec, 230 secs
lola: 14085902 markings, 46794570 edges, 56306 markings/sec, 235 secs
lola: 14366520 markings, 47744158 edges, 56124 markings/sec, 240 secs
lola: 14641722 markings, 48672235 edges, 55040 markings/sec, 245 secs
lola: 14923739 markings, 49630599 edges, 56403 markings/sec, 250 secs
lola: 15200551 markings, 50573911 edges, 55362 markings/sec, 255 secs
lola: 15477976 markings, 51515217 edges, 55485 markings/sec, 260 secs
lola: 15750666 markings, 52434523 edges, 54538 markings/sec, 265 secs
lola: 16030516 markings, 53383614 edges, 55970 markings/sec, 270 secs
lola: 16316667 markings, 54359669 edges, 57230 markings/sec, 275 secs
lola: 16601537 markings, 55329502 edges, 56974 markings/sec, 280 secs
lola: 16879719 markings, 56267076 edges, 55636 markings/sec, 285 secs
lola: 17160872 markings, 57221500 edges, 56231 markings/sec, 290 secs
lola: 17446472 markings, 58192598 edges, 57120 markings/sec, 295 secs
lola: 17729006 markings, 59155060 edges, 56507 markings/sec, 300 secs
lola: 18008083 markings, 60101832 edges, 55815 markings/sec, 305 secs
lola: 18279003 markings, 61019783 edges, 54184 markings/sec, 310 secs
lola: 18560530 markings, 61975740 edges, 56305 markings/sec, 315 secs
lola: 18842278 markings, 62936129 edges, 56350 markings/sec, 320 secs
lola: 19116872 markings, 63871107 edges, 54919 markings/sec, 325 secs
lola: 19392415 markings, 64805016 edges, 55109 markings/sec, 330 secs
lola: 19670263 markings, 65749072 edges, 55570 markings/sec, 335 secs
lola: 19949473 markings, 66688918 edges, 55842 markings/sec, 340 secs
lola: 20227211 markings, 67633897 edges, 55548 markings/sec, 345 secs
lola: 20502942 markings, 68575198 edges, 55146 markings/sec, 350 secs
lola: 20781020 markings, 69524701 edges, 55616 markings/sec, 355 secs
lola: 21060504 markings, 70479661 edges, 55897 markings/sec, 360 secs
lola: 21337290 markings, 71412443 edges, 55357 markings/sec, 365 secs
lola: 21609871 markings, 72339983 edges, 54516 markings/sec, 370 secs
lola: 21885369 markings, 73279897 edges, 55100 markings/sec, 375 secs
lola: 22162978 markings, 74228756 edges, 55522 markings/sec, 380 secs
lola: 22441264 markings, 75179385 edges, 55657 markings/sec, 385 secs
lola: 22718998 markings, 76117984 edges, 55547 markings/sec, 390 secs
lola: 22988773 markings, 77036019 edges, 53955 markings/sec, 395 secs
lola: 23264788 markings, 77977961 edges, 55203 markings/sec, 400 secs
lola: 23540218 markings, 78917931 edges, 55086 markings/sec, 405 secs
lola: 23816606 markings, 79863466 edges, 55278 markings/sec, 410 secs
lola: 24099025 markings, 80819911 edges, 56484 markings/sec, 415 secs
lola: 24366583 markings, 81727985 edges, 53512 markings/sec, 420 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((ROUTE_B <= NB_ATTENTE_A_13) AND (3 <= NB_ATTENTE_A_39))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((ROUTE_B <= NB_ATTENTE_A_13) AND (3 <= NB_ATTENTE_A_39))))))
lola: processed formula: A (F (A (G (((ROUTE_B <= NB_ATTENTE_A_13) AND (3 <= NB_ATTENTE_A_39))))))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: 424 markings, 425 edges
lola: ========================================
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= ATTENTE_B) OR (E (F (((NB_ATTENTE_B_1 <= COMPTEUR_7) AND (1 <= NB_ATTENTE_A_42)))) OR ((NB_ATTENTE_B_8 + 1 <= NB_ATTENTE_B_0) AND (ROUTE_B + 1 <= NB_ATTENTE_A_23) AND ((NB_ATTENTE_B_42 <= NB_ATTENTE_B_46) OR (3 <= NB_ATTENTE_A_25) OR ((3 <= NB_ATTENTE_B_8) AND (3 <= NB_ATTENTE_A_35))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= ATTENTE_B)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ATTENTE_B)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-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 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_B_1 <= COMPTEUR_7) AND (1 <= NB_ATTENTE_A_42))))
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 484 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-V50P20N10-CTLCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= NB_ATTENTE_A_45) OR ((NB_ATTENTE_A_1 <= 0) AND (NB_ATTENTE_B_35 + 1 <= NB_ATTENTE_A_41)))))
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 484 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 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P20N10-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 143 markings, 142 edges
lola: ========================================
lola: subprocess 12 will run for 746 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((NB_ATTENTE_A_21 <= NB_ATTENTE_B_1) OR (ROUTE_A <= NB_ATTENTE_A_43) OR ((2 <= NB_ATTENTE_A_23) AND (NB_ATTENTE_A_11 <= NB_ATTENTE_B_36))))) OR ((((NB_ATTENTE_B_45 <= CHOIX_1) AND (NB_ATTENTE_A_43 <= NB_ATTENTE_B_34) AND ((1 <= NB_ATTENTE_B_1) OR (NB_ATTENTE_B_8 <= NB_ATTENTE_B_26))) AND E (G ((NB_ATTENTE_A_39 <= NB_ATTENTE_A_42)))) OR E (G ((NB_ATTENTE_B_38 <= NB_ATTENTE_A_50)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 746 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NB_ATTENTE_A_21 <= NB_ATTENTE_B_1) OR (ROUTE_A <= NB_ATTENTE_A_43) OR ((2 <= NB_ATTENTE_A_23) AND (NB_ATTENTE_A_11 <= NB_ATTENTE_B_36)))))
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 484 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P20N10-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-CTLCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 290 markings, 289 edges
lola: ========================================
lola: subprocess 13 will run for 995 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NB_ATTENTE_B_45 <= CHOIX_1) AND (NB_ATTENTE_A_43 <= NB_ATTENTE_B_34) AND ((1 <= NB_ATTENTE_B_1) OR (NB_ATTENTE_B_8 <= NB_ATTENTE_B_26)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NB_ATTENTE_B_45 <= CHOIX_1) AND (NB_ATTENTE_A_43 <= NB_ATTENTE_B_34) AND ((1 <= NB_ATTENTE_B_1) OR (NB_ATTENTE_B_8 <= NB_ATTENTE_B_26)))
lola: processed formula length: 139
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: processed formula with 4 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 14 will run for 1493 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NB_ATTENTE_A_39 <= NB_ATTENTE_A_42)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NB_ATTENTE_A_42 + 1 <= NB_ATTENTE_A_39)))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: 510 markings, 509 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 995 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((VIDANGE_1 <= 1) AND (NB_ATTENTE_A_23 + 1 <= NB_ATTENTE_A_18)))))
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 484 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-V50P20N10-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 14 will run for 1492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((CHOIX_1 <= NB_ATTENTE_B_11))) AND ((2 <= NB_ATTENTE_B_24) OR (2 <= NB_ATTENTE_B_21) OR (NB_ATTENTE_A_20 <= NB_ATTENTE_A_35))) AND A (F (((3 <= NB_ATTENTE_A_0) AND (1 <= NB_ATTENTE_B_32))))) OR NOT(E (G ((NB_ATTENTE_A_36 + 1 <= COMPTEUR_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((CHOIX_1 <= NB_ATTENTE_B_11)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NB_ATTENTE_B_11 + 1 <= CHOIX_1)))
lola: processed formula length: 47
lola: 6 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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 15 will run for 2985 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((COMPTEUR_0 <= NB_ATTENTE_A_36)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((COMPTEUR_0 <= NB_ATTENTE_A_36)))
lola: processed formula: A (F ((COMPTEUR_0 <= NB_ATTENTE_A_36)))
lola: processed formula length: 39
lola: 4 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3723 markings, 5472 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2984 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (E (X ((NB_ATTENTE_A_13 <= NB_ATTENTE_B_40))))) AND A (F (((NB_ATTENTE_A_30 <= NB_ATTENTE_B_5) AND (NB_ATTENTE_A_13 <= NB_ATTENTE_B_33) AND (COMPTEUR_0 <= NB_ATTENTE_A_8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2984 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((NB_ATTENTE_A_13 <= NB_ATTENTE_B_40)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX((NB_ATTENTE_A_13 <= NB_ATTENTE_B_40)))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes no yes unknown no yes yes yes no yes unknown
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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-V50P20N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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-V50P20N10.tgz
mv BridgeAndVehicles-PT-V50P20N10 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 mcc4mcc-structural"
echo " Input is BridgeAndVehicles-PT-V50P20N10, 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 r035-ebro-152646315300311"
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 ;