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

About the Execution of LoLA for BridgeAndVehicles-COL-V20P20N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3999.070 655743.00 657500.00 52.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 BridgeAndVehicles-COL-V20P20N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126100320
=====================================================================


--------------------
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 1494605780641


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ BridgeAndVehicles-COL-V20P20N50 @ 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: 2336/65536 symbol table entries, 6 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 <= p101))) : A (F (F (G (G ((p26 <= p104)))))) : A (X (F (F (G ((1 <= p26)))))) : A (G (G (X (F ((p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p105 + p106)))))) : A (F ((3 <= p28))) : A ((((2 <= p104) U (p107 <= p105 + p106)) U ((2 <= p105 + p106) U (p24 + p25 <= p105 + p106)))) : A (F (((p26 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) U G ((1 <= p101))))) : A (F ((2 <= p102))) : A ((X (X ((p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p24 + p25))) U (p103 <= p107))) : A (G ((G ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)) U F ((3 <= p24 + p25))))) : A ((2 <= p0)) : A ((((p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p104) U (1 <= p104)) U F (G ((p28 <= p105 + p106))))) : A ((p103 <= p105 + p106)) : A (G (G (G ((p104 <= p27))))) : A (F (F (X ((2 <= p0))))) : A ((F (G ((p103 <= p0))) U X (X ((p22 + p23 <= p105 + p106)))))
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 <= p101)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= p101)))
lola: processed formula: A (X ((1 <= p101)))
lola: processed formula length: 19
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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (G ((p26 <= p104))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G ((p26 <= p104)))))
lola: processed formula: A (F (G (G ((p26 <= p104)))))
lola: processed formula length: 29
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: 8936 markings, 25972 edges, 1787 markings/sec, 0 secs
lola: 17739 markings, 58219 edges, 1761 markings/sec, 5 secs
lola: 26141 markings, 91591 edges, 1680 markings/sec, 10 secs
lola: 36941 markings, 136527 edges, 2160 markings/sec, 15 secs
lola: 48074 markings, 183814 edges, 2227 markings/sec, 20 secs
lola: 59591 markings, 234564 edges, 2303 markings/sec, 25 secs
lola: 71020 markings, 286345 edges, 2286 markings/sec, 30 secs
lola: 80814 markings, 330444 edges, 1959 markings/sec, 35 secs
lola: 94288 markings, 392539 edges, 2695 markings/sec, 40 secs
lola: 103144 markings, 429565 edges, 1771 markings/sec, 45 secs
lola: 112559 markings, 476650 edges, 1883 markings/sec, 50 secs
lola: 121559 markings, 525136 edges, 1800 markings/sec, 55 secs
lola: 131186 markings, 578955 edges, 1925 markings/sec, 60 secs
lola: 141448 markings, 638439 edges, 2052 markings/sec, 65 secs
lola: 152670 markings, 704651 edges, 2244 markings/sec, 70 secs
lola: 164817 markings, 777549 edges, 2429 markings/sec, 75 secs
lola: 177992 markings, 857458 edges, 2635 markings/sec, 80 secs
lola: 190124 markings, 931275 edges, 2426 markings/sec, 85 secs
lola: 200638 markings, 997547 edges, 2103 markings/sec, 90 secs
lola: 210327 markings, 1041410 edges, 1938 markings/sec, 95 secs
lola: 219869 markings, 1090700 edges, 1908 markings/sec, 100 secs
lola: 229369 markings, 1142873 edges, 1900 markings/sec, 105 secs
lola: 239421 markings, 1200790 edges, 2010 markings/sec, 110 secs
lola: 250204 markings, 1263919 edges, 2157 markings/sec, 115 secs
lola: 262133 markings, 1334976 edges, 2386 markings/sec, 120 secs
lola: 275195 markings, 1415191 edges, 2612 markings/sec, 125 secs
lola: 289420 markings, 1502938 edges, 2845 markings/sec, 130 secs
lola: 304152 markings, 1593660 edges, 2946 markings/sec, 135 secs
lola: 315197 markings, 1663737 edges, 2209 markings/sec, 140 secs
lola: 325925 markings, 1711821 edges, 2146 markings/sec, 145 secs
lola: 336081 markings, 1765177 edges, 2031 markings/sec, 150 secs
lola: 347845 markings, 1831416 edges, 2353 markings/sec, 155 secs
lola: 360329 markings, 1904800 edges, 2497 markings/sec, 160 secs
lola: 373316 markings, 1982667 edges, 2597 markings/sec, 165 secs
lola: 384996 markings, 2054236 edges, 2336 markings/sec, 170 secs
lola: 397127 markings, 2128283 edges, 2426 markings/sec, 175 secs
lola: 413712 markings, 2232303 edges, 3317 markings/sec, 180 secs
lola: 431246 markings, 2342967 edges, 3507 markings/sec, 185 secs
lola: 441496 markings, 2399130 edges, 2050 markings/sec, 190 secs
lola: 452426 markings, 2452904 edges, 2186 markings/sec, 195 secs
lola: 463666 markings, 2513857 edges, 2248 markings/sec, 200 secs
lola: 475610 markings, 2583258 edges, 2389 markings/sec, 205 secs
lola: 488058 markings, 2657271 edges, 2490 markings/sec, 210 secs
lola: 501092 markings, 2735788 edges, 2607 markings/sec, 215 secs
lola: 512975 markings, 2808110 edges, 2377 markings/sec, 220 secs
lola: 526574 markings, 2892086 edges, 2720 markings/sec, 225 secs
lola: 543641 markings, 3000842 edges, 3413 markings/sec, 230 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 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((1 <= p26)))))
lola: processed formula: A (X (F (G ((1 <= p26)))))
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 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: 481608 markings, 1563448 edges, 96322 markings/sec, 0 secs
lola: 937367 markings, 3104003 edges, 91152 markings/sec, 5 secs
lola: 1409133 markings, 4723624 edges, 94353 markings/sec, 10 secs
lola: 1880339 markings, 6339746 edges, 94241 markings/sec, 15 secs
lola: 2345693 markings, 7958315 edges, 93071 markings/sec, 20 secs
lola: 2778102 markings, 9473011 edges, 86482 markings/sec, 25 secs
lola: 3209534 markings, 10975861 edges, 86286 markings/sec, 30 secs
lola: 3635041 markings, 12457560 edges, 85101 markings/sec, 35 secs
lola: 4061583 markings, 13956978 edges, 85308 markings/sec, 40 secs
lola: 4497640 markings, 15495464 edges, 87211 markings/sec, 45 secs
lola: 4905011 markings, 16939303 edges, 81474 markings/sec, 50 secs
lola: 5346938 markings, 18497810 edges, 88385 markings/sec, 55 secs
lola: 5717654 markings, 19812342 edges, 74143 markings/sec, 60 secs
lola: 6160839 markings, 21378029 edges, 88637 markings/sec, 65 secs
lola: 6582352 markings, 22873440 edges, 84303 markings/sec, 70 secs
lola: 7022047 markings, 24431067 edges, 87939 markings/sec, 75 secs
lola: 7446348 markings, 25939082 edges, 84860 markings/sec, 80 secs
lola: 7810577 markings, 27252417 edges, 72846 markings/sec, 85 secs
lola: 8251528 markings, 28819476 edges, 88190 markings/sec, 90 secs
lola: 8687067 markings, 30362630 edges, 87108 markings/sec, 95 secs
lola: 9102741 markings, 31849124 edges, 83135 markings/sec, 100 secs
lola: 9554014 markings, 33476268 edges, 90255 markings/sec, 105 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 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (F ((p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p105 + p106))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (X (F ((p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p105 + p106))))))
lola: processed formula: A (G (G (X (F ((p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p105 + p106))))))
lola: processed formula length: 340
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 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p28)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((3 <= p28)))
lola: processed formula: A (F ((3 <= p28)))
lola: processed formula length: 18
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 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p104) U (p107 <= p105 + p106)) U ((2 <= p105 + p106) U (p24 + p25 <= p105 + p106))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p104) U (p107 <= p105 + p106)) U ((2 <= p105 + p106) U (p24 + p25 <= p105 + p106))))
lola: processed formula: A ((((2 <= p104) U (p107 <= p105 + p106)) U ((2 <= p105 + p106) U (p24 + p25 <= p105 + p106))))
lola: processed formula length: 95
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 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p26 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) U G ((1 <= p101)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((p26 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) U G ((1 <= p101)))))
lola: processed formula: A (F (((p26 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) U G ((1 <= p101)))))
lola: processed formula length: 161
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 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p102)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((2 <= p102)))
lola: processed formula: A (F ((2 <= p102)))
lola: processed formula length: 19
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 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p24 + p25))) U (p103 <= p107)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p24 + p25))) U (p103 <= p107)))
lola: processed formula: A ((X (X ((p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p24 + p25))) U (p103 <= p107)))
lola: processed formula length: 349
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 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)) U F ((3 <= p24 + p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)) U F ((3 <= p24 + p25)))))
lola: processed formula: A (G ((G ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)) U F ((3 <= p24 + p25)))))
lola: processed formula length: 158
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 531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p0)
lola: processed formula length: 9
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 638 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p104) U (1 <= p104)) U F (G ((p28 <= p105 + p106)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p104) U (1 <= p104)) U F (G ((p28 <= p105 + p106)))))
lola: processed formula: A ((((p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p104) U (1 <= p104)) U F (G ((p28 <= p105 + p106)))))
lola: processed formula length: 187
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: 360925 markings, 1989933 edges, 72185 markings/sec, 0 secs
lola: 702046 markings, 4020802 edges, 68224 markings/sec, 5 secs
lola: 1045551 markings, 6082316 edges, 68701 markings/sec, 10 secs
lola: 1392082 markings, 8163571 edges, 69306 markings/sec, 15 secs
lola: 1743410 markings, 10264207 edges, 70266 markings/sec, 20 secs
lola: 2094614 markings, 12375891 edges, 70241 markings/sec, 25 secs
lola: 2447420 markings, 14491614 edges, 70561 markings/sec, 30 secs
lola: 2794670 markings, 16636694 edges, 69450 markings/sec, 35 secs
lola: 3173616 markings, 18868681 edges, 75789 markings/sec, 40 secs
lola: 3562175 markings, 21197889 edges, 77712 markings/sec, 45 secs
lola: 3908043 markings, 23302210 edges, 69174 markings/sec, 50 secs
lola: 4264058 markings, 25411041 edges, 71203 markings/sec, 55 secs
lola: 4598010 markings, 27448872 edges, 66790 markings/sec, 60 secs
lola: 4962092 markings, 29594088 edges, 72816 markings/sec, 65 secs
lola: 5327193 markings, 31806662 edges, 73020 markings/sec, 70 secs
lola: 5710787 markings, 34076830 edges, 76719 markings/sec, 75 secs
lola: 6078855 markings, 36309448 edges, 73614 markings/sec, 80 secs
lola: 6461216 markings, 38576330 edges, 76472 markings/sec, 85 secs
lola: 6835937 markings, 40798744 edges, 74944 markings/sec, 90 secs
lola: 7192547 markings, 43038057 edges, 71322 markings/sec, 95 secs
lola: 7567625 markings, 45175196 edges, 75016 markings/sec, 100 secs
lola: 7886230 markings, 47102668 edges, 63721 markings/sec, 105 secs
lola: 8225494 markings, 49125911 edges, 67853 markings/sec, 110 secs
lola: 8573005 markings, 51163749 edges, 69502 markings/sec, 115 secs
lola: 8897249 markings, 53129753 edges, 64849 markings/sec, 120 secs
lola: 9234282 markings, 55130338 edges, 67407 markings/sec, 125 secs
lola: 9613030 markings, 57347663 edges, 75750 markings/sec, 130 secs
lola: 9974777 markings, 59521323 edges, 72349 markings/sec, 135 secs
lola: 10334536 markings, 61652423 edges, 71952 markings/sec, 140 secs
lola: 10678431 markings, 63642105 edges, 68779 markings/sec, 145 secs
lola: 10997622 markings, 65553127 edges, 63838 markings/sec, 150 secs
lola: 11316951 markings, 67525453 edges, 63866 markings/sec, 155 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 12 will run for 757 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p103 <= p105 + p106))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p103 <= p105 + p106)
lola: processed formula length: 21
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: ========================================
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 1009 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G ((p104 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (G ((p104 <= p27)))))
lola: processed formula: A (G (G (G ((p104 <= p27)))))
lola: processed formula length: 29
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 1514 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((2 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((2 <= p0))))
lola: processed formula: A (F (X ((2 <= p0))))
lola: processed formula length: 21
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: 605472 markings, 1518446 edges, 121094 markings/sec, 0 secs
lola: 1082663 markings, 3077045 edges, 95438 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: subprocess 15 will run for 3018 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((p103 <= p0))) U X (X ((p22 + p23 <= p105 + p106)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((p103 <= p0))) U X (X ((p22 + p23 <= p105 + p106)))))
lola: ========================================
lola: processed formula: A ((F (G ((p103 <= p0))) U X (X ((p22 + p23 <= p105 + p106)))))
lola: processed formula length: 63
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: 496240 markings, 1614029 edges, 99248 markings/sec, 0 secs
lola: 960985 markings, 3231094 edges, 92949 markings/sec, 5 secs
lola: 1449832 markings, 4972318 edges, 97769 markings/sec, 10 secs
lola: 1927649 markings, 6728249 edges, 95563 markings/sec, 15 secs
lola: 2412352 markings, 8568302 edges, 96941 markings/sec, 20 secs
lola: 2889505 markings, 10432153 edges, 95431 markings/sec, 25 secs
lola: 3357481 markings, 12286234 edges, 93595 markings/sec, 30 secs
lola: 3819056 markings, 14185498 edges, 92315 markings/sec, 35 secs
lola: 4266739 markings, 16039275 edges, 89537 markings/sec, 40 secs
lola: 4710735 markings, 17910636 edges, 88799 markings/sec, 45 secs
lola: 5120806 markings, 19691085 edges, 82014 markings/sec, 50 secs
lola: 5526085 markings, 21478026 edges, 81056 markings/sec, 55 secs
lola: 5934625 markings, 23327798 edges, 81708 markings/sec, 60 secs
lola: 6314773 markings, 24989720 edges, 76030 markings/sec, 65 secs
lola: 6726148 markings, 26894131 edges, 82275 markings/sec, 70 secs
lola: 7152734 markings, 28876243 edges, 85317 markings/sec, 75 secs
lola: 7580643 markings, 30860607 edges, 85582 markings/sec, 80 secs
lola: 8009355 markings, 32916939 edges, 85742 markings/sec, 85 secs
lola: 8398555 markings, 34805457 edges, 77840 markings/sec, 90 secs
lola: 8754299 markings, 36409726 edges, 71149 markings/sec, 95 secs
lola: 9149810 markings, 38435575 edges, 79102 markings/sec, 100 secs
lola: 9546142 markings, 40444535 edges, 79266 markings/sec, 105 secs
lola: 9937107 markings, 42234357 edges, 78193 markings/sec, 110 secs
lola: 10311401 markings, 43776459 edges, 74859 markings/sec, 115 secs
lola: 10741765 markings, 45713612 edges, 86073 markings/sec, 120 secs
lola: 11119124 markings, 48048385 edges, 75472 markings/sec, 125 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 1494606436384

--------------------
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-COL-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/BridgeAndVehicles-COL-V20P20N50.tgz
mv BridgeAndVehicles-COL-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 BridgeAndVehicles-COL-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 r008-csrt-149436126100320"
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 ;