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-COL-V50P50N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074300356
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496342512444


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_BridgeAndVehicles-COL-V50P50N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-COL-V50P50N10: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_BridgeAndVehicles-COL-V50P50N10 @ 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, 6 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-V50P50N10-LTLCardinality.task
lola: A (X ((2 <= p126 + p127))) : A (X (F (G (X ((p0 <= p2)))))) : A ((2 <= p126 + p127)) : A (G (X (X ((3 <= p72))))) : A (F ((F ((1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + 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)) U X ((3 <= p72))))) : A ((X ((2 <= p71)) U X (X ((1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70))))) : A ((X ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)) U (1 <= p0))) : A ((((2 <= p72) U (1 <= p124)) U (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 <= p0))) : A (X (G (X (G ((p56 <= p58 + p59)))))) : A ((G (X ((1 <= p126 + p127))) U (p72 <= p125))) : A (G (X ((2 <= p125)))) : A (F ((X ((1 <= p124)) U X ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p71))))) : A (G ((1 <= p58 + p59))) : A ((F (F ((3 <= p125))) U (p124 <= p58 + p59))) : A ((G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 <= p58 + p59)) U F (F ((p2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))))) : A (((p124 <= p58 + p59) U G ((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + 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 <= p58 + p59))))
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 ((2 <= p126 + p127)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= p126 + p127)))
lola: processed formula: A (X ((2 <= p126 + p127)))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (X ((p0 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G (X ((p0 <= p2))))))
lola: processed formula: A (X (F (G (X ((p0 <= p2))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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: 460631 markings, 1696584 edges, 92126 markings/sec, 0 secs
lola: 870180 markings, 3866159 edges, 81910 markings/sec, 5 secs
lola: 1272074 markings, 6046108 edges, 80379 markings/sec, 10 secs
lola: 1720477 markings, 8463566 edges, 89681 markings/sec, 15 secs
lola: 2174238 markings, 10577155 edges, 90752 markings/sec, 20 secs
lola: 2603133 markings, 12605316 edges, 85779 markings/sec, 25 secs
lola: 2925770 markings, 14978390 edges, 64527 markings/sec, 30 secs
lola: 3273922 markings, 17548704 edges, 69630 markings/sec, 35 secs
lola: 3600556 markings, 19964199 edges, 65327 markings/sec, 40 secs
lola: 3908517 markings, 22257915 edges, 61592 markings/sec, 45 secs
lola: 4320511 markings, 24390737 edges, 82399 markings/sec, 50 secs
lola: 4729349 markings, 26346766 edges, 81768 markings/sec, 55 secs
lola: 5088957 markings, 28354975 edges, 71922 markings/sec, 60 secs
lola: 5376380 markings, 30478197 edges, 57485 markings/sec, 65 secs
lola: 5684072 markings, 32748703 edges, 61538 markings/sec, 70 secs
lola: 5989800 markings, 35004372 edges, 61146 markings/sec, 75 secs
lola: 6303658 markings, 37343170 edges, 62772 markings/sec, 80 secs
lola: 6708371 markings, 39601928 edges, 80943 markings/sec, 85 secs
lola: 7125133 markings, 41774268 edges, 83352 markings/sec, 90 secs
lola: 7503761 markings, 43757964 edges, 75726 markings/sec, 95 secs
lola: 7858055 markings, 45972552 edges, 70859 markings/sec, 100 secs
lola: 8157366 markings, 48168149 edges, 59862 markings/sec, 105 secs
lola: 8468240 markings, 50486303 edges, 62175 markings/sec, 110 secs
lola: 8811890 markings, 53017012 edges, 68730 markings/sec, 115 secs
lola: 9138125 markings, 55274976 edges, 65247 markings/sec, 120 secs
lola: 9576724 markings, 57769508 edges, 87720 markings/sec, 125 secs
lola: 9972401 markings, 60001224 edges, 79135 markings/sec, 130 secs
lola: 10342742 markings, 62100227 edges, 74068 markings/sec, 135 secs
lola: 10711857 markings, 64226895 edges, 73823 markings/sec, 140 secs
lola: 11008251 markings, 66388556 edges, 59279 markings/sec, 145 secs
lola: 11317092 markings, 68650283 edges, 61768 markings/sec, 150 secs
lola: 11621515 markings, 70893544 edges, 60885 markings/sec, 155 secs
lola: 11943082 markings, 73287484 edges, 64313 markings/sec, 160 secs
lola: 12279914 markings, 75459729 edges, 67366 markings/sec, 165 secs
lola: 12698089 markings, 77965664 edges, 83635 markings/sec, 170 secs
lola: 13096528 markings, 80369518 edges, 79688 markings/sec, 175 secs
lola: 13468918 markings, 82622338 edges, 74478 markings/sec, 180 secs
lola: 13823403 markings, 84783111 edges, 70897 markings/sec, 185 secs
lola: 14168704 markings, 86989408 edges, 69060 markings/sec, 190 secs
lola: 14470220 markings, 89194523 edges, 60303 markings/sec, 195 secs
lola: 14785691 markings, 91540629 edges, 63094 markings/sec, 200 secs
lola: 15117640 markings, 93986019 edges, 66390 markings/sec, 205 secs
lola: 15419705 markings, 96223992 edges, 60413 markings/sec, 210 secs
lola: 15800056 markings, 98588798 edges, 76070 markings/sec, 215 secs
lola: 16214839 markings, 101193237 edges, 82957 markings/sec, 220 secs
lola: 16624884 markings, 103807093 edges, 82009 markings/sec, 225 secs
lola: 17021129 markings, 106339134 edges, 79249 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 ((2 <= p126 + p127))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p126 + p127)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X ((3 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (X ((3 <= p72)))))
lola: processed formula: A (G (X (X ((3 <= p72)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + 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)) U X ((3 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + 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)) U X ((3 <= p72)))))
lola: processed formula: A (F ((F ((1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + 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)) U X ((3 <= p72)))))
lola: processed formula length: 336
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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: 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 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((2 <= p71)) U X (X ((1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((2 <= p71) U X ((1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)))))
lola: processed formula: A (X (((2 <= p71) U X ((1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)))))
lola: processed formula length: 97
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: 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 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)) U (1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)) U (1 <= p0)))
lola: processed formula: A ((X ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)) U (1 <= p0)))
lola: processed formula length: 356
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p72) U (1 <= p124)) U (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p72) U (1 <= p124)) U (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 <= p0)))
lola: processed formula: A ((((2 <= p72) U (1 <= p124)) U (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 <= p0)))
lola: processed formula length: 106
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (G ((p56 <= p58 + p59))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (X (G ((p56 <= p58 + p59))))))
lola: processed formula: A (X (G (X (G ((p56 <= p58 + p59))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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 9 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((1 <= p126 + p127))) U (p72 <= p125)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((1 <= p126 + p127))) U (p72 <= p125)))
lola: processed formula: A ((G (X ((1 <= p126 + p127))) U (p72 <= p125)))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((2 <= p125))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((2 <= p125))))
lola: processed formula: A (G (X ((2 <= p125))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((1 <= p124)) U X ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p71)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((1 <= p124) U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p71)))))
lola: processed formula: A (F (X (((1 <= p124) U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p71)))))
lola: processed formula length: 364
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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: 631542 markings, 1749465 edges, 126308 markings/sec, 0 secs
lola: 1308192 markings, 3416931 edges, 135330 markings/sec, 5 secs
lola: 2010010 markings, 5017169 edges, 140364 markings/sec, 10 secs
lola: 2769971 markings, 6681626 edges, 151992 markings/sec, 15 secs
lola: 3586502 markings, 8355971 edges, 163306 markings/sec, 20 secs
lola: 4422229 markings, 10029337 edges, 167145 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 12 will run for 818 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p58 + p59)))
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: subprocess 13 will run for 1090 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((3 <= p125))) U (p124 <= p58 + p59)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= p125)) U (p124 <= p58 + p59)))
lola: processed formula: A ((F ((3 <= p125)) U (p124 <= p58 + p59)))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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: 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 14 will run for 1636 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 <= p58 + p59)) U F (F ((p2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 <= p58 + p59)) U F ((p2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))))
lola: processed formula: A ((G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 <= p58 + p59)) U F ((p2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p... (shortened)
lola: processed formula length: 430
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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 3272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p124 <= p58 + p59) U G ((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + 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 <= p58 + p59))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p124 <= p58 + p59) U G ((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + 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 <= p58 + p59))))
lola: processed formula: A (((p124 <= p58 + p59) U G ((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + 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 <= p58 + p59))))
lola: processed formula length: 345
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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: 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: RESULT
lola:
SUMMARY: no unknown no no no yes yes yes no yes no yes no yes yes no
lola: ========================================
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496342781020

--------------------
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-COL-V50P50N10"
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-COL-V50P50N10.tgz
mv S_BridgeAndVehicles-COL-V50P50N10 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-COL-V50P50N10, 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-149441074300356"
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 ;