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 BridgeAndVehicles-PT-V50P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126300473
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494614115417


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ BridgeAndVehicles-PT-V50P20N10 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1456/65536 symbol table entries, 11 collisions
lola: preprocessing...
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: A ((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 <= SUR_PONT_B)) : A (G (X ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B)))) : A ((((2 <= ROUTE_A) U (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B)) U X (F ((CAPACITE <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9))))) : A ((2 <= CONTROLEUR_1 + CONTROLEUR_2)) : A ((((2 <= SORTI_A) U (3 <= CAPACITE)) U F (X ((1 <= SORTI_A))))) : A (X (F (F ((3 <= SORTI_A))))) : A (F (X (F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2)))))) : A ((1 <= ATTENTE_B)) : A (F (F ((3 <= ROUTE_A)))) : A (X ((3 <= VIDANGE_1 + VIDANGE_2))) : A ((1 <= CONTROLEUR_1 + CONTROLEUR_2)) : A ((2 <= CAPACITE)) : A (((CAPACITE <= ROUTE_B) U ((CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2) U (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)))) : A (G (X (((ROUTE_A <= VIDANGE_1 + VIDANGE_2) U (ATTENTE_B <= CHOIX_1 + CHOIX_2))))) : A (F (F ((ATTENTE_B <= ROUTE_A)))) : A (G ((1 <= CONTROLEUR_1 + CONTROLEUR_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 ((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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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_... (shortened)
lola: processed formula length: 921
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))))
lola: processed formula: A (G (X ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= ROUTE_A) U (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B)) U X (F ((CAPACITE <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= ROUTE_A) U (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B)) U X (F ((CAPACITE <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)))))
lola: processed formula: A ((((2 <= ROUTE_A) U (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B)) U X (F ((CAPACITE <= 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... (shortened)
lola: processed formula length: 992
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= CONTROLEUR_1 + CONTROLEUR_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= CONTROLEUR_1 + CONTROLEUR_2)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= SORTI_A) U (3 <= CAPACITE)) U F (X ((1 <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= SORTI_A) U (3 <= CAPACITE)) U F (X ((1 <= SORTI_A)))))
lola: processed formula: A ((((2 <= SORTI_A) U (3 <= CAPACITE)) U F (X ((1 <= SORTI_A)))))
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 668221 markings, 1767224 edges, 133644 markings/sec, 0 secs
lola: 1311016 markings, 3391777 edges, 128559 markings/sec, 5 secs
lola: 2010924 markings, 5017320 edges, 139982 markings/sec, 10 secs
lola: 2701206 markings, 6526084 edges, 138056 markings/sec, 15 secs
lola: 3444743 markings, 8047221 edges, 148707 markings/sec, 20 secs
lola: 4208434 markings, 9609074 edges, 152738 markings/sec, 25 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 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((3 <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= SORTI_A))))
lola: processed formula: A (X (F ((3 <= SORTI_A))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 706914 markings, 1995819 edges, 141383 markings/sec, 0 secs
lola: 1338524 markings, 3587769 edges, 126322 markings/sec, 5 secs
lola: 1996211 markings, 5118718 edges, 131537 markings/sec, 10 secs
lola: 2679013 markings, 6609695 edges, 136560 markings/sec, 15 secs
lola: 3358284 markings, 8013318 edges, 135854 markings/sec, 20 secs
lola: 3944887 markings, 9807143 edges, 117321 markings/sec, 25 secs
lola: 4448457 markings, 11428704 edges, 100714 markings/sec, 30 secs
lola: 4921972 markings, 12984442 edges, 94703 markings/sec, 35 secs
lola: 5410334 markings, 14593980 edges, 97672 markings/sec, 40 secs
lola: 5932678 markings, 16281036 edges, 104469 markings/sec, 45 secs
lola: 6456363 markings, 18046269 edges, 104737 markings/sec, 50 secs
lola: 6980673 markings, 19809198 edges, 104862 markings/sec, 55 secs
lola: 7507234 markings, 21574406 edges, 105312 markings/sec, 60 secs
lola: 8068711 markings, 23445774 edges, 112295 markings/sec, 65 secs
lola: 8646921 markings, 25365878 edges, 115642 markings/sec, 70 secs
lola: 9202989 markings, 27196084 edges, 111214 markings/sec, 75 secs
lola: 9736496 markings, 28994864 edges, 106701 markings/sec, 80 secs
lola: 10308967 markings, 30966418 edges, 114494 markings/sec, 85 secs
lola: 10857760 markings, 32752133 edges, 109759 markings/sec, 90 secs
lola: 11352864 markings, 34388665 edges, 99021 markings/sec, 95 secs
lola: 11826349 markings, 35975604 edges, 94697 markings/sec, 100 secs
lola: 12317053 markings, 37618980 edges, 98141 markings/sec, 105 secs
lola: 12815855 markings, 39324116 edges, 99760 markings/sec, 110 secs
lola: 13332197 markings, 41056174 edges, 103268 markings/sec, 115 secs
lola: 13851924 markings, 42815129 edges, 103945 markings/sec, 120 secs
lola: 14373020 markings, 44595818 edges, 104219 markings/sec, 125 secs
lola: 14895378 markings, 46403321 edges, 104472 markings/sec, 130 secs
lola: 15449935 markings, 48287378 edges, 110911 markings/sec, 135 secs
lola: 15974878 markings, 50049644 edges, 104989 markings/sec, 140 secs
lola: 16520357 markings, 51961244 edges, 109096 markings/sec, 145 secs
lola: 17049201 markings, 53716478 edges, 105769 markings/sec, 150 secs
lola: 17589359 markings, 55634173 edges, 108032 markings/sec, 155 secs
lola: 18158396 markings, 57391788 edges, 113807 markings/sec, 160 secs
lola: 18738248 markings, 59316542 edges, 115970 markings/sec, 165 secs
lola: 19347961 markings, 61219383 edges, 121943 markings/sec, 170 secs
lola: 19894710 markings, 63090903 edges, 109350 markings/sec, 175 secs
lola: 20491550 markings, 64909655 edges, 119368 markings/sec, 180 secs
lola: 21085910 markings, 66710663 edges, 118872 markings/sec, 185 secs
lola: 21669196 markings, 68728029 edges, 116657 markings/sec, 190 secs
lola: 22271463 markings, 70591426 edges, 120453 markings/sec, 195 secs
lola: 22819623 markings, 72442469 edges, 109632 markings/sec, 200 secs
lola: 23423561 markings, 74299995 edges, 120788 markings/sec, 205 secs
lola: 24027538 markings, 76129983 edges, 120795 markings/sec, 210 secs
lola: 24603256 markings, 78122580 edges, 115144 markings/sec, 215 secs
lola: 25176171 markings, 79865576 edges, 114583 markings/sec, 220 secs
lola: 25690168 markings, 81661569 edges, 102799 markings/sec, 225 secs
lola: 26229677 markings, 83275161 edges, 107902 markings/sec, 230 secs
lola: 26767191 markings, 85161323 edges, 107503 markings/sec, 235 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: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2))))))
lola: ========================================
lola: processed formula: A (F (X (F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2))))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 546992 markings, 2736198 edges, 109398 markings/sec, 0 secs
lola: 1051251 markings, 5503734 edges, 100852 markings/sec, 5 secs
lola: 1512797 markings, 8433565 edges, 92309 markings/sec, 10 secs
lola: 1976444 markings, 11355490 edges, 92729 markings/sec, 15 secs
lola: 2437157 markings, 14258448 edges, 92143 markings/sec, 20 secs
lola: 2886770 markings, 17204601 edges, 89923 markings/sec, 25 secs
lola: 3345900 markings, 20050805 edges, 91826 markings/sec, 30 secs
lola: 3754883 markings, 22687062 edges, 81797 markings/sec, 35 secs
lola: 4171702 markings, 25462091 edges, 83364 markings/sec, 40 secs
lola: 4580609 markings, 28003073 edges, 81781 markings/sec, 45 secs
lola: 4998384 markings, 30694559 edges, 83555 markings/sec, 50 secs
lola: 5431664 markings, 33562932 edges, 86656 markings/sec, 55 secs
lola: 5868425 markings, 36423716 edges, 87352 markings/sec, 60 secs
lola: 6296932 markings, 39126917 edges, 85701 markings/sec, 65 secs
lola: 6728135 markings, 41953271 edges, 86241 markings/sec, 70 secs
lola: 7147825 markings, 44759866 edges, 83938 markings/sec, 75 secs
lola: 7571310 markings, 47536587 edges, 84697 markings/sec, 80 secs
lola: 7977297 markings, 50104410 edges, 81197 markings/sec, 85 secs
lola: 8389018 markings, 52793402 edges, 82344 markings/sec, 90 secs
lola: 8799407 markings, 55537267 edges, 82078 markings/sec, 95 secs
lola: 9213778 markings, 58321471 edges, 82874 markings/sec, 100 secs
lola: 9605390 markings, 60856360 edges, 78322 markings/sec, 105 secs
lola: 9985532 markings, 63292797 edges, 76028 markings/sec, 110 secs
lola: 10371710 markings, 65827259 edges, 77236 markings/sec, 115 secs
lola: 10759308 markings, 68427560 edges, 77520 markings/sec, 120 secs
lola: 11145460 markings, 71027500 edges, 77230 markings/sec, 125 secs
lola: 11544851 markings, 73698306 edges, 79878 markings/sec, 130 secs
lola: 11953844 markings, 76323041 edges, 81799 markings/sec, 135 secs
lola: 12363596 markings, 79002140 edges, 81950 markings/sec, 140 secs
lola: 12780787 markings, 81754912 edges, 83438 markings/sec, 145 secs
lola: 13196981 markings, 84569641 edges, 83239 markings/sec, 150 secs
lola: 13578809 markings, 87144922 edges, 76366 markings/sec, 155 secs
lola: 13966200 markings, 89773128 edges, 77478 markings/sec, 160 secs
lola: 14341747 markings, 92178688 edges, 75109 markings/sec, 165 secs
lola: 14703811 markings, 94514440 edges, 72413 markings/sec, 170 secs
lola: 15078628 markings, 96948712 edges, 74963 markings/sec, 175 secs
lola: 15468898 markings, 99504521 edges, 78054 markings/sec, 180 secs
lola: 15870114 markings, 102183509 edges, 80243 markings/sec, 185 secs
lola: 16266718 markings, 104822607 edges, 79321 markings/sec, 190 secs
lola: 16670402 markings, 107508902 edges, 80737 markings/sec, 195 secs
lola: 17075074 markings, 110144611 edges, 80934 markings/sec, 200 secs
lola: 17435667 markings, 112510817 edges, 72119 markings/sec, 205 secs
lola: 17828585 markings, 115128477 edges, 78584 markings/sec, 210 secs
lola: 18216051 markings, 117568379 edges, 77493 markings/sec, 215 secs
lola: 18592090 markings, 120059006 edges, 75208 markings/sec, 220 secs
lola: 18969462 markings, 122548236 edges, 75474 markings/sec, 225 secs
lola: 19343717 markings, 125059538 edges, 74851 markings/sec, 230 secs
lola: 19728243 markings, 127619539 edges, 76905 markings/sec, 235 secs
lola: 20118585 markings, 130253912 edges, 78068 markings/sec, 240 secs
lola: 20500012 markings, 132813471 edges, 76285 markings/sec, 245 secs
lola: 20884117 markings, 135387370 edges, 76821 markings/sec, 250 secs
lola: 21266048 markings, 137957409 edges, 76386 markings/sec, 255 secs
lola: 21633270 markings, 140300852 edges, 73444 markings/sec, 260 secs
lola: 21996853 markings, 142678503 edges, 72717 markings/sec, 265 secs
lola: 22367617 markings, 145159494 edges, 74153 markings/sec, 270 secs
lola: 22730589 markings, 147606703 edges, 72594 markings/sec, 275 secs
lola: 23097127 markings, 150079303 edges, 73308 markings/sec, 280 secs
lola: 23478640 markings, 152638724 edges, 76303 markings/sec, 285 secs
lola: 23861262 markings, 155233197 edges, 76524 markings/sec, 290 secs
lola: 24243924 markings, 157832387 edges, 76532 markings/sec, 295 secs
lola: 24650282 markings, 160593425 edges, 81272 markings/sec, 300 secs
lola: 25024668 markings, 163125626 edges, 74877 markings/sec, 305 secs
lola: 25390431 markings, 165535213 edges, 73153 markings/sec, 310 secs
lola: 25759545 markings, 167930807 edges, 73823 markings/sec, 315 secs
lola: 26128853 markings, 170426857 edges, 73862 markings/sec, 320 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= ATTENTE_B))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= ATTENTE_B)
lola: processed formula length: 16
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-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 8 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((3 <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((3 <= ROUTE_A)))
lola: processed formula: A (F ((3 <= ROUTE_A)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 9 will run for 420 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= VIDANGE_1 + VIDANGE_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= VIDANGE_1 + VIDANGE_2)))
lola: processed formula: A (X ((3 <= VIDANGE_1 + VIDANGE_2)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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 10 will run for 490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= CONTROLEUR_1 + CONTROLEUR_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= CONTROLEUR_1 + CONTROLEUR_2)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-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 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= CAPACITE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= CAPACITE)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-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 12 will run for 735 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((CAPACITE <= ROUTE_B) U ((CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2) U (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((CAPACITE <= ROUTE_B) U ((CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2) U (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))
lola: processed formula: A (((CAPACITE <= ROUTE_B) U ((CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2) U (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))
lola: processed formula length: 224
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 980 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((ROUTE_A <= VIDANGE_1 + VIDANGE_2) U (ATTENTE_B <= CHOIX_1 + CHOIX_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((ROUTE_A <= VIDANGE_1 + VIDANGE_2) U (ATTENTE_B <= CHOIX_1 + CHOIX_2)))))
lola: processed formula: A (G (X (((ROUTE_A <= VIDANGE_1 + VIDANGE_2) U (ATTENTE_B <= CHOIX_1 + CHOIX_2)))))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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 14 will run for 1470 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((ATTENTE_B <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((ATTENTE_B <= ROUTE_A)))
lola: processed formula: A (F ((ATTENTE_B <= ROUTE_A)))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 2940 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes unknown no yes no no yes no no yes no
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494614715939

--------------------
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="BridgeAndVehicles-PT-V50P20N10"
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/BridgeAndVehicles-PT-V50P20N10.tgz
mv BridgeAndVehicles-PT-V50P20N10 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 BridgeAndVehicles-PT-V50P20N10, 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 r008-csrt-149436126300473"
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 ;