fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r088-csrt-149441074500464
Last Updated
June 27, 2017

About the Execution of LoLA for S_BridgeAndVehicles-PT-V20P20N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2182.150 763237.00 765680.00 47.60 T?FTTFTTTFFTFFTF 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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_BridgeAndVehicles-PT-V20P20N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074500464
=====================================================================


--------------------
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-COL-V20P20N50-LTLCardinality-0
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-1
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-2
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-3
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-4
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-5
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-6
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-7
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-8
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496348494775


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


checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-PT-V20P20N50: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_BridgeAndVehicles-PT-V20P20N50 @ 3539 seconds
----- Start make result stdout -----
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: 2336/65536 symbol table entries, 26 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2453 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: A (X ((1 <= ROUTE_A))) : A (F (F (G (G ((CAPACITE <= SORTI_B)))))) : A (X (F (F (G ((1 <= CAPACITE)))))) : A (G (G (X (F ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= CHOIX_1 + CHOIX_2)))))) : A (F ((3 <= ATTENTE_B))) : A ((((2 <= SORTI_B) U (ROUTE_B <= CHOIX_1 + CHOIX_2)) U ((2 <= CHOIX_1 + CHOIX_2) U (VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2)))) : A (F (((CAPACITE <= 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) U G ((1 <= ROUTE_A))))) : A (F ((2 <= ATTENTE_A))) : A ((X (X ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= VIDANGE_1 + VIDANGE_2))) U (SUR_PONT_B <= ROUTE_B))) : A (G ((G ((3 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)) U F ((3 <= VIDANGE_1 + VIDANGE_2))))) : A ((2 <= SORTI_A)) : A ((((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= SORTI_B) U (1 <= SORTI_B)) U F (G ((ATTENTE_B <= CHOIX_1 + CHOIX_2))))) : A ((SUR_PONT_B <= CHOIX_1 + CHOIX_2)) : A (G (G (G ((SORTI_B <= SUR_PONT_A))))) : A (F (F (X ((2 <= SORTI_A))))) : A ((F (G ((SUR_PONT_B <= SORTI_A))) U X (X ((CONTROLEUR_1 + CONTROLEUR_2 <= CHOIX_1 + CHOIX_2)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= ROUTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= ROUTE_A)))
lola: processed formula: A (X ((1 <= ROUTE_A)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (G ((CAPACITE <= SORTI_B))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G ((CAPACITE <= SORTI_B)))))
lola: processed formula: A (F (G (G ((CAPACITE <= SORTI_B)))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 9975 markings, 51983 edges, 1995 markings/sec, 0 secs
lola: 16722 markings, 89473 edges, 1349 markings/sec, 5 secs
lola: 51710 markings, 297988 edges, 6998 markings/sec, 10 secs
lola: 86925 markings, 518309 edges, 7043 markings/sec, 15 secs
lola: 114825 markings, 695168 edges, 5580 markings/sec, 20 secs
lola: 140115 markings, 850861 edges, 5058 markings/sec, 25 secs
lola: 163157 markings, 993656 edges, 4608 markings/sec, 30 secs
lola: 189298 markings, 1160824 edges, 5228 markings/sec, 35 secs
lola: 210316 markings, 1290223 edges, 4204 markings/sec, 40 secs
lola: 226669 markings, 1386024 edges, 3271 markings/sec, 45 secs
lola: 255382 markings, 1575791 edges, 5743 markings/sec, 50 secs
lola: 276478 markings, 1708905 edges, 4219 markings/sec, 55 secs
lola: 295678 markings, 1828351 edges, 3840 markings/sec, 60 secs
lola: 311883 markings, 1924811 edges, 3241 markings/sec, 65 secs
lola: 339237 markings, 2102438 edges, 5471 markings/sec, 70 secs
lola: 363229 markings, 2254581 edges, 4798 markings/sec, 75 secs
lola: 383251 markings, 2380663 edges, 4004 markings/sec, 80 secs
lola: 400910 markings, 2491364 edges, 3532 markings/sec, 85 secs
lola: 419370 markings, 2604661 edges, 3692 markings/sec, 90 secs
lola: 432581 markings, 2684319 edges, 2642 markings/sec, 95 secs
lola: 460322 markings, 2865869 edges, 5548 markings/sec, 100 secs
lola: 483979 markings, 3016083 edges, 4731 markings/sec, 105 secs
lola: 504372 markings, 3144804 edges, 4079 markings/sec, 110 secs
lola: 522595 markings, 3258965 edges, 3645 markings/sec, 115 secs
lola: 539555 markings, 3365238 edges, 3392 markings/sec, 120 secs
lola: 553160 markings, 3447573 edges, 2721 markings/sec, 125 secs
lola: 576164 markings, 3594902 edges, 4601 markings/sec, 130 secs
lola: 600819 markings, 3752999 edges, 4931 markings/sec, 135 secs
lola: 623544 markings, 3897017 edges, 4545 markings/sec, 140 secs
lola: 643502 markings, 4024243 edges, 3992 markings/sec, 145 secs
lola: 661645 markings, 4138806 edges, 3629 markings/sec, 150 secs
lola: 681053 markings, 4262448 edges, 3882 markings/sec, 155 secs
lola: 700478 markings, 4387457 edges, 3885 markings/sec, 160 secs
lola: 710336 markings, 4440078 edges, 1972 markings/sec, 165 secs
lola: 742482 markings, 4647495 edges, 6429 markings/sec, 170 secs
lola: 766411 markings, 4798932 edges, 4786 markings/sec, 175 secs
lola: 788011 markings, 4937800 edges, 4320 markings/sec, 180 secs
lola: 805553 markings, 5048962 edges, 3508 markings/sec, 185 secs
lola: 822519 markings, 5157667 edges, 3393 markings/sec, 190 secs
lola: 838820 markings, 5260667 edges, 3260 markings/sec, 195 secs
lola: 857069 markings, 5377043 edges, 3650 markings/sec, 200 secs
lola: 877114 markings, 5506835 edges, 4009 markings/sec, 205 secs
lola: 888840 markings, 5573035 edges, 2345 markings/sec, 210 secs
lola: 915433 markings, 5742590 edges, 5319 markings/sec, 215 secs
lola: 942136 markings, 5912019 edges, 5341 markings/sec, 220 secs
lola: 963919 markings, 6050249 edges, 4357 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (G ((1 <= CAPACITE))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((1 <= CAPACITE)))))
lola: processed formula: A (X (F (G ((1 <= CAPACITE)))))
lola: processed formula length: 31
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 431011 markings, 1414006 edges, 86202 markings/sec, 0 secs
lola: 810055 markings, 2692358 edges, 75809 markings/sec, 5 secs
lola: 1191679 markings, 3989632 edges, 76325 markings/sec, 10 secs
lola: 1556417 markings, 5245161 edges, 72948 markings/sec, 15 secs
lola: 1913671 markings, 6475583 edges, 71451 markings/sec, 20 secs
lola: 2267973 markings, 7707517 edges, 70860 markings/sec, 25 secs
lola: 2616480 markings, 8922026 edges, 69701 markings/sec, 30 secs
lola: 2964637 markings, 10133296 edges, 69631 markings/sec, 35 secs
lola: 3307518 markings, 11332349 edges, 68576 markings/sec, 40 secs
lola: 3659854 markings, 12552541 edges, 70467 markings/sec, 45 secs
lola: 3997119 markings, 13731649 edges, 67453 markings/sec, 50 secs
lola: 4327968 markings, 14895593 edges, 66170 markings/sec, 55 secs
lola: 4667297 markings, 16079113 edges, 67866 markings/sec, 60 secs
lola: 5000757 markings, 17259342 edges, 66692 markings/sec, 65 secs
lola: 5353321 markings, 18494557 edges, 70513 markings/sec, 70 secs
lola: 5699939 markings, 19727817 edges, 69324 markings/sec, 75 secs
lola: 6060912 markings, 20996923 edges, 72195 markings/sec, 80 secs
lola: 6411409 markings, 22243603 edges, 70099 markings/sec, 85 secs
lola: 6761670 markings, 23498901 edges, 70052 markings/sec, 90 secs
lola: 7129991 markings, 24791909 edges, 73664 markings/sec, 95 secs
lola: 7471114 markings, 26020686 edges, 68225 markings/sec, 100 secs
lola: 7824905 markings, 27273832 edges, 70758 markings/sec, 105 secs
lola: 8172320 markings, 28513954 edges, 69483 markings/sec, 110 secs
lola: 8514840 markings, 29750867 edges, 68504 markings/sec, 115 secs
lola: 8878250 markings, 31040943 edges, 72682 markings/sec, 120 secs
lola: 9242273 markings, 32347383 edges, 72805 markings/sec, 125 secs
lola: 9604015 markings, 33654919 edges, 72348 markings/sec, 130 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: ========================================
lola: subprocess 3 will run for 243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (F ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (X (F ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= CHOIX_1 + CHOIX_2))))))
lola: processed formula: A (G (G (X (F ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTE... (shortened)
lola: processed formula length: 744
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 263 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üchi-Automaton
lola: processed formula: A (F ((3 <= ATTENTE_B)))
lola: processed formula: A (F ((3 <= ATTENTE_B)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: ========================================
lola: subprocess 5 will run for 287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= SORTI_B) U (ROUTE_B <= CHOIX_1 + CHOIX_2)) U ((2 <= CHOIX_1 + CHOIX_2) U (VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= SORTI_B) U (ROUTE_B <= CHOIX_1 + CHOIX_2)) U ((2 <= CHOIX_1 + CHOIX_2) U (VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2))))
lola: processed formula: A ((((2 <= SORTI_B) U (ROUTE_B <= CHOIX_1 + CHOIX_2)) U ((2 <= CHOIX_1 + CHOIX_2) U (VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2))))
lola: processed formula length: 131
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 29 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: ========================================
lola: subprocess 6 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((CAPACITE <= 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) U G ((1 <= RO... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((CAPACITE <= 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) U G ((1 <= ROUTE_A)))))
lola: processed formula: A (F (((CAPACITE <= 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) U G ((1 <= RO... (shortened)
lola: processed formula length: 410
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: ========================================
lola: subprocess 7 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= ATTENTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((2 <= ATTENTE_A)))
lola: processed formula: A (F ((2 <= ATTENTE_A)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: ========================================
lola: subprocess 8 will run for 395 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= VIDANGE_1 + VIDANGE_2))) U (SUR_PONT_B <= ROUTE_B)))
lola: processed formula: A ((X (X ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37... (shortened)
lola: processed formula length: 768
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 9 will run for 452 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((3 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)) U F ((3 <= VIDAN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((3 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)) U F ((3 <= VIDANGE_1 + VIDANGE_2)))))
lola: processed formula: A (G ((G ((3 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)) U F ((3 <= VIDAN... (shortened)
lola: processed formula length: 421
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: ========================================
lola: subprocess 10 will run for 527 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= SORTI_A))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SORTI_A)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.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: ========================================
lola: subprocess 11 will run for 633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= SORTI_B) U (1 <= SORTI_B)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= SORTI_B) U (1 <= SORTI_B)) U F (G ((ATTENTE_B <= CHOIX_1 + CHOIX_2)))))
lola: processed formula: A ((((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= SORTI_B) U (1 <= SORTI_B)... (shortened)
lola: processed formula length: 446
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 313773 markings, 1786889 edges, 62755 markings/sec, 0 secs
lola: 631807 markings, 3641159 edges, 63607 markings/sec, 5 secs
lola: 939604 markings, 5423678 edges, 61559 markings/sec, 10 secs
lola: 1234952 markings, 7146955 edges, 59070 markings/sec, 15 secs
lola: 1525813 markings, 8808487 edges, 58172 markings/sec, 20 secs
lola: 1821390 markings, 10524897 edges, 59115 markings/sec, 25 secs
lola: 2117231 markings, 12220666 edges, 59168 markings/sec, 30 secs
lola: 2412234 markings, 13898439 edges, 59001 markings/sec, 35 secs
lola: 2726303 markings, 15676466 edges, 62814 markings/sec, 40 secs
lola: 3014937 markings, 17320008 edges, 57727 markings/sec, 45 secs
lola: 3283497 markings, 18813316 edges, 53712 markings/sec, 50 secs
lola: 3551818 markings, 20317692 edges, 53664 markings/sec, 55 secs
lola: 3821361 markings, 21853286 edges, 53909 markings/sec, 60 secs
lola: 4087254 markings, 23380553 edges, 53179 markings/sec, 65 secs
lola: 4361942 markings, 24956276 edges, 54938 markings/sec, 70 secs
lola: 4636952 markings, 26547189 edges, 55002 markings/sec, 75 secs
lola: 4911225 markings, 28138606 edges, 54855 markings/sec, 80 secs
lola: 5182823 markings, 29751128 edges, 54320 markings/sec, 85 secs
lola: 5457721 markings, 31368443 edges, 54980 markings/sec, 90 secs
lola: 5729782 markings, 32975679 edges, 54412 markings/sec, 95 secs
lola: 6002435 markings, 34600424 edges, 54531 markings/sec, 100 secs
lola: 6276717 markings, 36233719 edges, 54856 markings/sec, 105 secs
lola: 6546893 markings, 37863156 edges, 54035 markings/sec, 110 secs
lola: 6817606 markings, 39512199 edges, 54143 markings/sec, 115 secs
lola: 7090332 markings, 41175858 edges, 54545 markings/sec, 120 secs
lola: 7363808 markings, 42844145 edges, 54695 markings/sec, 125 secs
lola: 7644906 markings, 44545838 edges, 56220 markings/sec, 130 secs
lola: 7925056 markings, 46281874 edges, 56030 markings/sec, 135 secs
lola: 8198390 markings, 47993902 edges, 54667 markings/sec, 140 secs
lola: 8479047 markings, 49709176 edges, 56131 markings/sec, 145 secs
lola: 8756076 markings, 51404602 edges, 55406 markings/sec, 150 secs
lola: 9035704 markings, 53154747 edges, 55926 markings/sec, 155 secs
lola: 9312373 markings, 54908579 edges, 55334 markings/sec, 160 secs
lola: 9594534 markings, 56643276 edges, 56432 markings/sec, 165 secs
lola: 9872066 markings, 58396725 edges, 55506 markings/sec, 170 secs
lola: 10146299 markings, 60125531 edges, 54847 markings/sec, 175 secs
lola: 10423690 markings, 61893082 edges, 55478 markings/sec, 180 secs
lola: 10704808 markings, 63676900 edges, 56224 markings/sec, 185 secs
lola: 10987355 markings, 65433443 edges, 56509 markings/sec, 190 secs
lola: 11267399 markings, 67187662 edges, 56009 markings/sec, 195 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: ========================================
lola: subprocess 12 will run for 741 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((SUR_PONT_B <= CHOIX_1 + CHOIX_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SUR_PONT_B <= CHOIX_1 + CHOIX_2)
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 988 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G ((SORTI_B <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (G ((SORTI_B <= SUR_PONT_A)))))
lola: processed formula: A (G (G (G ((SORTI_B <= SUR_PONT_A)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: ========================================
lola: subprocess 14 will run for 1482 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((2 <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((2 <= SORTI_A))))
lola: processed formula: A (F (X ((2 <= SORTI_A))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 434932 markings, 1230682 edges, 86986 markings/sec, 0 secs
lola: 859483 markings, 2423042 edges, 84910 markings/sec, 5 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: ========================================
lola: subprocess 15 will run for 2950 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((SUR_PONT_B <= SORTI_A))) U X (X ((CONTROLEUR_1 + CONTROLEUR_2 <= CHOIX_1 + CHOIX_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((SUR_PONT_B <= SORTI_A))) U X (X ((CONTROLEUR_1 + CONTROLEUR_2 <= CHOIX_1 + CHOIX_2)))))
lola: processed formula: A ((F (G ((SUR_PONT_B <= SORTI_A))) U X (X ((CONTROLEUR_1 + CONTROLEUR_2 <= CHOIX_1 + CHOIX_2)))))
lola: processed formula length: 98
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 417791 markings, 1443351 edges, 83558 markings/sec, 0 secs
lola: 796144 markings, 2908308 edges, 75671 markings/sec, 5 secs
lola: 1159567 markings, 4404559 edges, 72685 markings/sec, 10 secs
lola: 1503599 markings, 5835984 edges, 68806 markings/sec, 15 secs
lola: 1840207 markings, 7341885 edges, 67322 markings/sec, 20 secs
lola: 2175777 markings, 8874160 edges, 67114 markings/sec, 25 secs
lola: 2503879 markings, 10369113 edges, 65620 markings/sec, 30 secs
lola: 2822345 markings, 11909599 edges, 63693 markings/sec, 35 secs
lola: 3136318 markings, 13482094 edges, 62795 markings/sec, 40 secs
lola: 3452419 markings, 14883446 edges, 63220 markings/sec, 45 secs
lola: 3780540 markings, 16157098 edges, 65624 markings/sec, 50 secs
lola: 4114617 markings, 17482649 edges, 66815 markings/sec, 55 secs
lola: 4431296 markings, 18818082 edges, 63336 markings/sec, 60 secs
lola: 4767551 markings, 20133808 edges, 67251 markings/sec, 65 secs
lola: 5085101 markings, 21491184 edges, 63510 markings/sec, 70 secs
lola: 5420024 markings, 22847493 edges, 66985 markings/sec, 75 secs
lola: 5739086 markings, 24196823 edges, 63812 markings/sec, 80 secs
lola: 6055590 markings, 25607165 edges, 63301 markings/sec, 85 secs
lola: 6390382 markings, 26925201 edges, 66958 markings/sec, 90 secs
lola: 6699891 markings, 28368653 edges, 61902 markings/sec, 95 secs
lola: 7039431 markings, 29774069 edges, 67908 markings/sec, 100 secs
lola: 7367768 markings, 31142573 edges, 65667 markings/sec, 105 secs
lola: 7670684 markings, 32614432 edges, 60583 markings/sec, 110 secs
lola: 8012696 markings, 34060418 edges, 68402 markings/sec, 115 secs
lola: 8335599 markings, 35467977 edges, 64581 markings/sec, 120 secs
lola: 8645576 markings, 36927657 edges, 61995 markings/sec, 125 secs
lola: 8957554 markings, 38434135 edges, 62396 markings/sec, 130 secs
lola: 9305396 markings, 39842027 edges, 69568 markings/sec, 135 secs
lola: 9623754 markings, 41330302 edges, 63672 markings/sec, 140 secs
lola: 9918599 markings, 42831449 edges, 58969 markings/sec, 145 secs
lola: 10242196 markings, 44303915 edges, 64719 markings/sec, 150 secs
lola: 10569547 markings, 45691119 edges, 65470 markings/sec, 155 secs
lola: 10878053 markings, 47174771 edges, 61701 markings/sec, 160 secs
lola: 11185585 markings, 48763896 edges, 61506 markings/sec, 165 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: RESULT
lola:
SUMMARY: yes unknown yes no no yes no no yes no no yes yes no yes yes
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496349258012

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_BridgeAndVehicles-PT-V20P20N50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_BridgeAndVehicles-PT-V20P20N50.tgz
mv S_BridgeAndVehicles-PT-V20P20N50 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_BridgeAndVehicles-PT-V20P20N50, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-csrt-149441074500464"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;