About the Execution of M4M.full for BridgeAndVehicles-PT-V80P20N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5442.960 | 730153.00 | 743360.00 | 350.90 | ???????????????? | 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.7M
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 252K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 728K 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 6.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 124K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 353K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K 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 195K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 568K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K 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.3M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is BridgeAndVehicles-PT-V80P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-ebro-152646312500353
=====================================================================
--------------------
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-V80P20N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527038847768
BK_STOP 1527039577921
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-V80P20N10 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': 2655856, 'Memory': 15952.48, 'Tool': 'lola'}, {'Time': 2687312, 'Memory': 15952.86, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-PT-V80P20N10...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-PT-V80P20N10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V80P20N10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ BridgeAndVehicles-PT-V80P20N10 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
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: 2296/65536 symbol table entries, 15 collisions
lola: preprocessing...
lola: finding significant places
lola: 188 places, 2108 transitions, 181 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2613 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: E (G ((E (G ((ATTENTE_B <= 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 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80))) OR ((SORTI_A + 1 <= CONTROLEUR_1 + CONTROLEUR_2) AND (SORTI_A <= 2))))) : A (X (A (F (((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 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80 <= SUR_PONT_B) AND (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_51 + NB_ATTENTE_B_52 + NB_ATTENTE_B_53 + NB_ATTENTE_B_54 + NB_ATTENTE_B_55 + NB_ATTENTE_B_56 + NB_ATTENTE_B_57 + NB_ATTENTE_B_58 + NB_ATTENTE_B_59 + NB_ATTENTE_B_60 + NB_ATTENTE_B_61 + NB_ATTENTE_B_62 + NB_ATTENTE_B_63 + NB_ATTENTE_B_64 + NB_ATTENTE_B_65 + NB_ATTENTE_B_66 + NB_ATTENTE_B_67 + NB_ATTENTE_B_68 + NB_ATTENTE_B_69 + NB_ATTENTE_B_70 + NB_ATTENTE_B_71 + NB_ATTENTE_B_72 + NB_ATTENTE_B_73 + NB_ATTENTE_B_74 + NB_ATTENTE_B_75 + NB_ATTENTE_B_76 + NB_ATTENTE_B_77 + NB_ATTENTE_B_78 + NB_ATTENTE_B_79 + NB_ATTENTE_B_80 + 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)))))) : NOT((((1 <= ROUTE_B) OR (2 <= SUR_PONT_A)) AND NOT(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_51 + NB_ATTENTE_B_52 + NB_ATTENTE_B_53 + NB_ATTENTE_B_54 + NB_ATTENTE_B_55 + NB_ATTENTE_B_56 + NB_ATTENTE_B_57 + NB_ATTENTE_B_58 + NB_ATTENTE_B_59 + NB_ATTENTE_B_60 + NB_ATTENTE_B_61 + NB_ATTENTE_B_62 + NB_ATTENTE_B_63 + NB_ATTENTE_B_64 + NB_ATTENTE_B_65 + NB_ATTENTE_B_66 + NB_ATTENTE_B_67 + NB_ATTENTE_B_68 + NB_ATTENTE_B_69 + NB_ATTENTE_B_70 + NB_ATTENTE_B_71 + NB_ATTENTE_B_72 + NB_ATTENTE_B_73 + NB_ATTENTE_B_74 + NB_ATTENTE_B_75 + NB_ATTENTE_B_76 + NB_ATTENTE_B_77 + NB_ATTENTE_B_78 + NB_ATTENTE_B_79 + NB_ATTENTE_B_80 + 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)))))) : (((CONTROLEUR_1 + CONTROLEUR_2 <= 0) OR (ROUTE_B + 1 <= VIDANGE_1 + VIDANGE_2) OR ((SUR_PONT_B <= 2) AND (SUR_PONT_A <= 1)) OR ((2 <= ROUTE_B) AND (ROUTE_A <= SORTI_A))) AND (((VIDANGE_1 + VIDANGE_2 <= 1) OR (CHOIX_1 + CHOIX_2 <= 0) OR ((SORTI_B <= ATTENTE_B) AND (3 <= VIDANGE_1 + VIDANGE_2)) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 0)) AND A ((TRUE U (3 <= ATTENTE_B))))) : (NOT(E (F (((SORTI_B <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))) OR NOT(A (G ((CHOIX_1 + CHOIX_2 <= 1))))) : E (G (E (((SORTI_B <= 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 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80) U (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 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80 <= ATTENTE_A))))) : NOT(((E (G ((SORTI_B <= ROUTE_A))) OR E (X ((2 <= SORTI_B)))) AND ((CONTROLEUR_1 + CONTROLEUR_2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) OR (1 <= ATTENTE_A)))) : NOT(E (F (((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_51 + NB_ATTENTE_B_52 + NB_ATTENTE_B_53 + NB_ATTENTE_B_54 + NB_ATTENTE_B_55 + NB_ATTENTE_B_56 + NB_ATTENTE_B_57 + NB_ATTENTE_B_58 + NB_ATTENTE_B_59 + NB_ATTENTE_B_60 + NB_ATTENTE_B_61 + NB_ATTENTE_B_62 + NB_ATTENTE_B_63 + NB_ATTENTE_B_64 + NB_ATTENTE_B_65 + NB_ATTENTE_B_66 + NB_ATTENTE_B_67 + NB_ATTENTE_B_68 + NB_ATTENTE_B_69 + NB_ATTENTE_B_70 + NB_ATTENTE_B_71 + NB_ATTENTE_B_72 + NB_ATTENTE_B_73 + NB_ATTENTE_B_74 + NB_ATTENTE_B_75 + NB_ATTENTE_B_76 + NB_ATTENTE_B_77 + NB_ATTENTE_B_78 + NB_ATTENTE_B_79 + NB_ATTENTE_B_80 + 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 (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 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80) AND (ROUTE_B <= SUR_PONT_B))))) : NOT(A (F (E (X ((2 <= NB_ATTENTE_A_22)))))) : A (X (NOT(E (G ((COMPTEUR_1 <= ROUTE_A)))))) : (A (G (A (X ((2 <= NB_ATTENTE_B_78))))) OR (E (G ((NB_ATTENTE_A_11 <= NB_ATTENTE_B_60))) AND E (G ((NB_ATTENTE_B_5 <= 0))))) : A (X (NOT(E (G ((NB_ATTENTE_B_12 <= NB_ATTENTE_B_61)))))) : E (G ((A (F ((2 <= NB_ATTENTE_A_42))) OR ((NB_ATTENTE_B_68 <= NB_ATTENTE_B_9) AND (1 <= NB_ATTENTE_B_9) AND ((2 <= NB_ATTENTE_B_62) OR (NB_ATTENTE_B_63 <= NB_ATTENTE_A_24)))))) : A ((((3 <= NB_ATTENTE_A_53) AND (3 <= NB_ATTENTE_A_21) AND ((2 <= NB_ATTENTE_B_44) OR (NB_ATTENTE_B_45 <= NB_ATTENTE_A_38))) U A (F ((2 <= NB_ATTENTE_B_52))))) : ((E (((1 <= NB_ATTENTE_A_13) U (NB_ATTENTE_B_15 <= NB_ATTENTE_B_29))) AND ((NB_ATTENTE_A_41 + 1 <= NB_ATTENTE_A_69) AND (NB_ATTENTE_A_48 <= 1) AND ((NB_ATTENTE_A_67 <= 2) OR (NB_ATTENTE_A_11 + 1 <= NB_ATTENTE_B_53)))) OR A (F ((2 <= NB_ATTENTE_B_1)))) : A (G ((NB_ATTENTE_A_30 <= NB_ATTENTE_B_21)))
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 (G ((E (G ((ATTENTE_B <= 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_AT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A(TRUE U (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_ATTEN... (shortened)
lola: processed formula length: 1557
lola: 6 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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: 2885 markings, 6852 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((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 CTL
lola: processed formula: AX(A(TRUE U ((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: 2934
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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: 274951 markings, 1008799 edges, 3689329903141912576 markings/sec, 0 secs
lola: 543736 markings, 2004582 edges, 53757 markings/sec, 5 secs
lola: 854729 markings, 3004029 edges, 62199 markings/sec, 10 secs
lola: 1192931 markings, 3908708 edges, 67640 markings/sec, 15 secs
lola: 1451110 markings, 4732521 edges, 51636 markings/sec, 20 secs
lola: 1709357 markings, 5674697 edges, 51649 markings/sec, 25 secs
lola: 1966919 markings, 6611429 edges, 51512 markings/sec, 30 secs
lola: 2223157 markings, 7536463 edges, 51248 markings/sec, 35 secs
lola: 2488906 markings, 8472045 edges, 53150 markings/sec, 40 secs
lola: 2753427 markings, 9405295 edges, 52904 markings/sec, 45 secs
lola: 3015392 markings, 10319741 edges, 52393 markings/sec, 50 secs
lola: 3291223 markings, 11250515 edges, 55166 markings/sec, 55 secs
lola: 3554343 markings, 12156350 edges, 52624 markings/sec, 60 secs
lola: 3838036 markings, 13082829 edges, 56739 markings/sec, 65 secs
lola: 4122971 markings, 14007670 edges, 56987 markings/sec, 70 secs
lola: 4417096 markings, 14932598 edges, 58825 markings/sec, 75 secs
lola: 4705084 markings, 15821832 edges, 57598 markings/sec, 80 secs
lola: 5013340 markings, 16723237 edges, 61651 markings/sec, 85 secs
lola: 5322062 markings, 17605761 edges, 61744 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5568617 markings, 18255536 edges
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((1 <= ROUTE_B) OR (2 <= SUR_PONT_A)) AND NOT(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 +... (shortened)
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: ((ROUTE_B <= 0) AND (SUR_PONT_A <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ROUTE_B <= 0) AND (SUR_PONT_A <= 1))
lola: processed formula length: 38
lola: 8 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-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 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (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... (shortened)
lola: processed formula length: 1478
lola: 10 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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: 674 markings, 673 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((CONTROLEUR_1 + CONTROLEUR_2 <= 0) OR (ROUTE_B + 1 <= VIDANGE_1 + VIDANGE_2) OR ((SUR_PONT_B <= 2) AND (SUR_PONT_A <= 1)) OR ((2 <= ROUTE_B) AND (ROUTE_A <= SORTI_A))) AND (((VIDANGE_1 + VIDANGE_2 <= 1) OR (CHOIX_1 + CHOIX_2 <= 0) OR ((SORTI_B <= ATTENTE_B) AND (3 <= VIDANGE_1 + VIDANGE_2)) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 0)) AND A ((TRUE U (3 <= ATTENTE_B)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((CONTROLEUR_1 + CONTROLEUR_2 <= 0) OR (ROUTE_B + 1 <= VIDANGE_1 + VIDANGE_2) OR ((SUR_PONT_B <= 2) AND (SUR_PONT_A <= 1)) OR ((2 <= ROUTE_B) AND (ROUTE_A <= SORTI_A)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((CONTROLEUR_1 + CONTROLEUR_2 <= 0) OR (ROUTE_B + 1 <= VIDANGE_1 + VIDANGE_2) OR ((SUR_PONT_B <= 2) AND (SUR_PONT_A <= 1)) OR ((2 <= ROUTE_B) AND (ROUTE_A <= SORTI_A)))
lola: processed formula length: 171
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: processed formula with 6 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 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((VIDANGE_1 + VIDANGE_2 <= 1) OR (CHOIX_1 + CHOIX_2 <= 0) OR ((SORTI_B <= ATTENTE_B) AND (3 <= VIDANGE_1 + VIDANGE_2)) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((VIDANGE_1 + VIDANGE_2 <= 1) OR (CHOIX_1 + CHOIX_2 <= 0) OR ((SORTI_B <= ATTENTE_B) AND (3 <= VIDANGE_1 + VIDANGE_2)) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 0))
lola: processed formula length: 160
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: processed formula with 5 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 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= ATTENTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= ATTENTE_B)))
lola: processed formula: A (F ((3 <= ATTENTE_B)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 728 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: 890 markings, 890 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((SORTI_B <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))) OR NOT(A (G ((CHOIX_1 + CHOIX_2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + 1 <= SORTI_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 724 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= CHOIX_1 + CHOIX_2)))
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 724 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-V80P20N10-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P20N10-CTLCardinality-5.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((SORTI_B <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((SORTI_B <= 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 + N... (shortened)
lola: processed formula length: 2944
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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: 253672 markings, 856761 edges, 2977822184912715776 markings/sec, 0 secs
lola: 499376 markings, 1701861 edges, 49141 markings/sec, 5 secs
lola: 742681 markings, 2544949 edges, 48661 markings/sec, 10 secs
lola: 977522 markings, 3359507 edges, 46968 markings/sec, 15 secs
lola: 1216138 markings, 4187872 edges, 47723 markings/sec, 20 secs
lola: 1439401 markings, 5052691 edges, 44653 markings/sec, 25 secs
lola: 1649930 markings, 5966788 edges, 42106 markings/sec, 30 secs
lola: 1851974 markings, 6850851 edges, 40409 markings/sec, 35 secs
lola: 2061197 markings, 7768440 edges, 41845 markings/sec, 40 secs
lola: 2268119 markings, 8677041 edges, 41384 markings/sec, 45 secs
lola: 2474725 markings, 9586241 edges, 41321 markings/sec, 50 secs
lola: 2683354 markings, 10498171 edges, 41726 markings/sec, 55 secs
lola: 2893239 markings, 11404851 edges, 41977 markings/sec, 60 secs
lola: 3101565 markings, 12314572 edges, 41665 markings/sec, 65 secs
lola: 3308342 markings, 13222889 edges, 41355 markings/sec, 70 secs
lola: 3514272 markings, 14129280 edges, 41186 markings/sec, 75 secs
lola: 3719739 markings, 15034395 edges, 41093 markings/sec, 80 secs
lola: 3924766 markings, 15938689 edges, 41005 markings/sec, 85 secs
lola: 4135332 markings, 16844717 edges, 42113 markings/sec, 90 secs
lola: 4345033 markings, 17761459 edges, 41940 markings/sec, 95 secs
lola: 4556535 markings, 18690064 edges, 42300 markings/sec, 100 secs
lola: 4765935 markings, 19611801 edges, 41880 markings/sec, 105 secs
lola: 4975510 markings, 20536572 edges, 41915 markings/sec, 110 secs
lola: 5182779 markings, 21450779 edges, 41454 markings/sec, 115 secs
lola: 5391548 markings, 22354948 edges, 41754 markings/sec, 120 secs
lola: 5602822 markings, 23277694 edges, 42255 markings/sec, 125 secs
lola: 5810293 markings, 24189162 edges, 41494 markings/sec, 130 secs
lola: 6017748 markings, 25103255 edges, 41491 markings/sec, 135 secs
lola: 6226986 markings, 26025313 edges, 41848 markings/sec, 140 secs
lola: 6434994 markings, 26943614 edges, 41602 markings/sec, 145 secs
lola: 6645196 markings, 27860892 edges, 42040 markings/sec, 150 secs
lola: 6856185 markings, 28782911 edges, 42198 markings/sec, 155 secs
lola: 7065201 markings, 29701342 edges, 41803 markings/sec, 160 secs
lola: 7274261 markings, 30621873 edges, 41812 markings/sec, 165 secs
lola: 7482967 markings, 31544224 edges, 41741 markings/sec, 170 secs
lola: 7690842 markings, 32462879 edges, 41575 markings/sec, 175 secs
lola: 7900472 markings, 33381243 edges, 41926 markings/sec, 180 secs
lola: 8111867 markings, 34305099 edges, 42279 markings/sec, 185 secs
lola: 8319162 markings, 35217167 edges, 41459 markings/sec, 190 secs
lola: 8527950 markings, 36137772 edges, 41758 markings/sec, 195 secs
lola: 8736747 markings, 37061813 edges, 41759 markings/sec, 200 secs
lola: 8944539 markings, 37981070 edges, 41558 markings/sec, 205 secs
lola: 9152882 markings, 38897509 edges, 41669 markings/sec, 210 secs
lola: 9364505 markings, 39822178 edges, 42325 markings/sec, 215 secs
lola: 9574116 markings, 40745425 edges, 41922 markings/sec, 220 secs
lola: 9782916 markings, 41667277 edges, 41760 markings/sec, 225 secs
lola: 9991160 markings, 42588965 edges, 41649 markings/sec, 230 secs
lola: 10196907 markings, 43499890 edges, 41149 markings/sec, 235 secs
lola: 10403886 markings, 44414799 edges, 41396 markings/sec, 240 secs
lola: 10616325 markings, 45343330 edges, 42488 markings/sec, 245 secs
lola: 10827308 markings, 46273713 edges, 42197 markings/sec, 250 secs
lola: 11037257 markings, 47202056 edges, 41990 markings/sec, 255 secs
lola: 11245542 markings, 48124249 edges, 41657 markings/sec, 260 secs
lola: 11453150 markings, 49043900 edges, 41522 markings/sec, 265 secs
lola: 11661038 markings, 49965259 edges, 41578 markings/sec, 270 secs
lola: 11873257 markings, 50895295 edges, 42444 markings/sec, 275 secs
lola: 12083803 markings, 51825023 edges, 42109 markings/sec, 280 secs
lola: 12293822 markings, 52754409 edges, 42004 markings/sec, 285 secs
lola: 12500174 markings, 53668986 edges, 41270 markings/sec, 290 secs
lola: 12708355 markings, 54592947 edges, 41636 markings/sec, 295 secs
lola: 12913635 markings, 55503021 edges, 41056 markings/sec, 300 secs
lola: 13127740 markings, 56415607 edges, 42821 markings/sec, 305 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((SORTI_B <= ROUTE_A))) OR E (X ((2 <= SORTI_B)))) AND ((CONTROLEUR_1 + CONTROLEUR_2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) OR (1 <= ATTENTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((ROUTE_A + 1 <= SORTI_B)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((ROUTE_A + 1 <= SORTI_B)))
lola: processed formula: A (F ((ROUTE_A + 1 <= SORTI_B)))
lola: processed formula length: 32
lola: 9 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 728 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: 5448 markings, 8043 edges, 1090 markings/sec, 0 secs
lola: 16155 markings, 34112 edges, 2141 markings/sec, 5 secs
lola: 26626 markings, 62523 edges, 2094 markings/sec, 10 secs
lola: 36702 markings, 91536 edges, 2015 markings/sec, 15 secs
lola: 46259 markings, 119938 edges, 1911 markings/sec, 20 secs
lola: 55572 markings, 148205 edges, 1863 markings/sec, 25 secs
lola: 64576 markings, 175923 edges, 1801 markings/sec, 30 secs
lola: 73358 markings, 203184 edges, 1756 markings/sec, 35 secs
lola: 81875 markings, 229861 edges, 1703 markings/sec, 40 secs
lola: 90380 markings, 256895 edges, 1701 markings/sec, 45 secs
lola: 99693 markings, 281153 edges, 1863 markings/sec, 50 secs
lola: 110873 markings, 307506 edges, 2236 markings/sec, 55 secs
lola: 126251 markings, 328403 edges, 3076 markings/sec, 60 secs
lola: 143074 markings, 349662 edges, 3365 markings/sec, 65 secs
lola: 156812 markings, 370355 edges, 2748 markings/sec, 70 secs
lola: 166155 markings, 397320 edges, 1869 markings/sec, 75 secs
lola: 178294 markings, 424240 edges, 2428 markings/sec, 80 secs
lola: 193785 markings, 445314 edges, 3098 markings/sec, 85 secs
lola: 209402 markings, 466533 edges, 3123 markings/sec, 90 secs
lola: 221155 markings, 490490 edges, 2351 markings/sec, 95 secs
lola: 232224 markings, 516597 edges, 2214 markings/sec, 100 secs
lola: 244264 markings, 543432 edges, 2408 markings/sec, 105 secs
lola: 256782 markings, 570602 edges, 2504 markings/sec, 110 secs
lola: 266160 markings, 598246 edges, 1876 markings/sec, 115 secs
lola: 280421 markings, 625978 edges, 2852 markings/sec, 120 secs
lola: 296060 markings, 647307 edges, 3128 markings/sec, 125 secs
lola: 310794 markings, 667621 edges, 2947 markings/sec, 130 secs
lola: 321657 markings, 693057 edges, 2173 markings/sec, 135 secs
lola: 333119 markings, 720143 edges, 2292 markings/sec, 140 secs
lola: 345999 markings, 747013 edges, 2576 markings/sec, 145 secs
lola: 358607 markings, 776071 edges, 2522 markings/sec, 150 secs
lola: 369479 markings, 804327 edges, 2174 markings/sec, 155 secs
lola: 380335 markings, 832259 edges, 2171 markings/sec, 160 secs
lola: 395224 markings, 865985 edges, 2978 markings/sec, 165 secs
lola: 404926 markings, 893093 edges, 1940 markings/sec, 170 secs
lola: 414395 markings, 921535 edges, 1894 markings/sec, 175 secs
lola: 429849 markings, 946982 edges, 3091 markings/sec, 180 secs
lola: 445453 markings, 968186 edges, 3121 markings/sec, 185 secs
lola: 459182 markings, 990662 edges, 2746 markings/sec, 190 secs
lola: 470486 markings, 1017324 edges, 2261 markings/sec, 195 secs
lola: 482014 markings, 1044686 edges, 2306 markings/sec, 200 secs
lola: 496201 markings, 1072538 edges, 2837 markings/sec, 205 secs
lola: 507141 markings, 1100976 edges, 2188 markings/sec, 210 secs
lola: 518190 markings, 1129544 edges, 2210 markings/sec, 215 secs
lola: 530052 markings, 1158290 edges, 2372 markings/sec, 220 secs
lola: 543709 markings, 1190080 edges, 2731 markings/sec, 225 secs
lola: 554198 markings, 1219075 edges, 2098 markings/sec, 230 secs
lola: 564696 markings, 1248034 edges, 2100 markings/sec, 235 secs
lola: 574924 markings, 1275723 edges, 2046 markings/sec, 240 secs
lola: 588347 markings, 1310002 edges, 2685 markings/sec, 245 secs
lola: 601374 markings, 1342574 edges, 2605 markings/sec, 250 secs
lola: 610663 markings, 1370894 edges, 1858 markings/sec, 255 secs
lola: 622795 markings, 1401177 edges, 2426 markings/sec, 260 secs
lola: 638343 markings, 1422303 edges, 3110 markings/sec, 265 secs
lola: 654283 markings, 1443906 edges, 3188 markings/sec, 270 secs
lola: 665928 markings, 1469697 edges, 2329 markings/sec, 275 secs
lola: 677419 markings, 1496841 edges, 2298 markings/sec, 280 secs
lola: 690330 markings, 1524007 edges, 2582 markings/sec, 285 secs
lola: 703060 markings, 1553563 edges, 2546 markings/sec, 290 secs
lola: 714000 markings, 1581993 edges, 2188 markings/sec, 295 secs
lola: 725216 markings, 1610389 edges, 2243 markings/sec, 300 secs
lola: 740433 markings, 1644710 edges, 3043 markings/sec, 305 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ' '
Aborted (core dumped)
----- Kill lola and sara stderr -----
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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-V80P20N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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-V80P20N10.tgz
mv BridgeAndVehicles-PT-V80P20N10 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-full"
echo " Input is BridgeAndVehicles-PT-V80P20N10, 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 r034-ebro-152646312500353"
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 '
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 ;