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

About the Execution of LoLA for BridgeAndVehicles-COL-V50P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2859.590 1458085.00 2920038.00 135.20 F?F?FFFTFFTF?T?T 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-V50P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126200331
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494606283894


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ BridgeAndVehicles-COL-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, 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-V50P20N10-ReachabilityCardinality.task
lola: E (F (((3 <= p16 + p17) AND (p16 + p17 <= p125) AND (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND ((2 <= 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 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p127) OR (p70 <= 0))))) : A (G (((2 <= p71) OR (3 <= p0) OR (p16 + p17 + 1 <= p123)))) : A (G ((((p3 + p4 <= 1) AND (p126 <= 1)) OR (((3 <= p18) OR (p18 <= p0)) AND ((p71 <= p125) OR (p18 <= p71)))))) : A (G (((((p70 <= p126) AND (p1 + p2 <= p16 + p17)) OR (p16 + p17 <= p0)) AND ((p127 <= 0) OR (p1 + p2 <= 2))))) : A (G ((((1 <= p16 + p17) AND (3 <= p127)) OR ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (p18 <= p123)) OR (p18 <= p16 + p17) OR (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p18) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p3 + p4)))) : A (G ((((3 <= 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 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) AND (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 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p124) AND (p3 + p4 <= p123)) OR (p18 <= p70)))) : A (G ((((2 <= p124) OR (1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR ((p16 + p17 <= p127) AND (3 <= p124))) AND (((2 <= p123) AND (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 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p125)) OR (1 <= p71))))) : A (G (((p3 + p4 <= 2) OR ((2 <= p0) AND (p125 <= p126))))) : A (G ((2 <= p71))) : E (F ((((p0 <= 2) AND (p3 + p4 <= 0)) OR (((p16 + p17 <= p125) OR (3 <= p70)) AND (2 <= p3 + p4))))) : A (G ((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p70))) : E (F (((2 <= p125) AND (p71 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))) : A (G ((1 <= p0))) : E (F (((p70 <= p125) AND (2 <= p1 + p2)))) : A (G ((((p125 + 1 <= p71) OR (p123 <= 0)) AND ((p1 + p2 + 1 <= p16 + p17) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= 1))))) : E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= 0) OR (p70 <= 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: E (F (((3 <= p16 + p17) AND (p16 + p17 <= p125) AND (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND ((2 <= p19... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p71) OR (3 <= p0) OR (p16 + p17 + 1 <= p123))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 24410 markings, 64669 edges, 4882 markings/sec, 0 secs
lola: sara is running 5 secs || 51397 markings, 136714 edges, 5397 markings/sec, 5 secs
lola: sara is running 10 secs || 78815 markings, 209601 edges, 5484 markings/sec, 10 secs
lola: sara is running 15 secs || 105056 markings, 280063 edges, 5248 markings/sec, 15 secs
lola: sara is running 20 secs || 129210 markings, 344060 edges, 4831 markings/sec, 20 secs
lola: sara is running 25 secs || 141696 markings, 376330 edges, 2497 markings/sec, 25 secs
lola: sara is running 30 secs || 163649 markings, 448213 edges, 4391 markings/sec, 30 secs
lola: sara is running 35 secs || 174183 markings, 477058 edges, 2107 markings/sec, 35 secs
lola: sara is running 40 secs || 188180 markings, 518742 edges, 2799 markings/sec, 40 secs
lola: sara is running 45 secs || 204740 markings, 573051 edges, 3312 markings/sec, 45 secs
lola: sara is running 50 secs || 221366 markings, 626724 edges, 3325 markings/sec, 50 secs
lola: sara is running 55 secs || 234679 markings, 667325 edges, 2663 markings/sec, 55 secs
lola: sara is running 60 secs || 252899 markings, 729030 edges, 3644 markings/sec, 60 secs
lola: sara is running 65 secs || 263096 markings, 756386 edges, 2039 markings/sec, 65 secs
lola: sara is running 70 secs || 280702 markings, 816085 edges, 3521 markings/sec, 70 secs
lola: sara is running 75 secs || 290611 markings, 842495 edges, 1982 markings/sec, 75 secs
lola: sara is running 80 secs || 307695 markings, 900589 edges, 3417 markings/sec, 80 secs
lola: sara is running 85 secs || 322382 markings, 947087 edges, 2937 markings/sec, 85 secs
lola: sara is running 90 secs || 334675 markings, 983978 edges, 2459 markings/sec, 90 secs
lola: sara is running 95 secs || 351844 markings, 1040919 edges, 3434 markings/sec, 95 secs
lola: sara is running 100 secs || 367243 markings, 1089930 edges, 3080 markings/sec, 100 secs
lola: sara is running 105 secs || 379064 markings, 1123885 edges, 2364 markings/sec, 105 secs
lola: sara is running 110 secs || 394942 markings, 1181919 edges, 3176 markings/sec, 110 secs
lola: sara is running 115 secs || 406905 markings, 1214226 edges, 2393 markings/sec, 115 secs
lola: sara is running 120 secs || 418136 markings, 1248050 edges, 2246 markings/sec, 120 secs
lola: sara is running 125 secs || 431862 markings, 1291668 edges, 2745 markings/sec, 125 secs
lola: sara is running 130 secs || 449031 markings, 1349833 edges, 3434 markings/sec, 130 secs
lola: sara is running 135 secs || 469636 markings, 1410380 edges, 4121 markings/sec, 135 secs
lola: sara is running 140 secs || 484208 markings, 1442845 edges, 2914 markings/sec, 140 secs
lola: sara is running 145 secs || 498002 markings, 1481030 edges, 2759 markings/sec, 145 secs
lola: sara is running 150 secs || 512305 markings, 1522670 edges, 2861 markings/sec, 150 secs
lola: sara is running 155 secs || 522585 markings, 1557181 edges, 2056 markings/sec, 155 secs
lola: sara is running 160 secs || 532340 markings, 1588848 edges, 1951 markings/sec, 160 secs
lola: sara is running 165 secs || 542147 markings, 1619755 edges, 1961 markings/sec, 165 secs
lola: sara is running 170 secs || 554883 markings, 1662843 edges, 2547 markings/sec, 170 secs
lola: sara is running 175 secs || 572013 markings, 1720812 edges, 3426 markings/sec, 175 secs
lola: sara is running 180 secs || 581976 markings, 1752944 edges, 1993 markings/sec, 180 secs
lola: sara is running 185 secs || 592000 markings, 1784631 edges, 2005 markings/sec, 185 secs
lola: sara is running 190 secs || 608265 markings, 1842059 edges, 3253 markings/sec, 190 secs
lola: sara is running 195 secs || 621391 markings, 1883760 edges, 2625 markings/sec, 195 secs
lola: sara is running 200 secs || 631283 markings, 1915251 edges, 1978 markings/sec, 200 secs
lola: sara is running 205 secs || 641277 markings, 1948204 edges, 1999 markings/sec, 205 secs
lola: sara is running 210 secs || 660395 markings, 2015552 edges, 3824 markings/sec, 210 secs
lola: sara is running 215 secs || 670239 markings, 2047579 edges, 1969 markings/sec, 215 secs
lola: sara is running 220 secs || 680212 markings, 2078056 edges, 1995 markings/sec, 220 secs
lola: sara is running 225 secs || 694647 markings, 2127615 edges, 2887 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p3 + p4 <= 1) AND (p126 <= 1)) OR (((3 <= p18) OR (p18 <= p0)) AND ((p71 <= p125) OR (p18 <= p71))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p70 <= p126) AND (p1 + p2 <= p16 + p17)) OR (p16 + p17 <= p0)) AND ((p127 <= 0) OR (p1 + p2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p16 + p17) AND (3 <= p127)) OR ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (p18 <= p123)) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= 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 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) AND (p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p124) OR (1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR ((p16 + p17 <= p127) AND (3 <= p124))) AND (((2 <= p123) AND (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 + p56 + p57 + p58 + p59 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 51)
lola: sara is running 0 secs || 41362 markings, 103050 edges, 8272 markings/sec, 0 secs
lola: sara is running 5 secs || 76473 markings, 200285 edges, 7022 markings/sec, 5 secs
lola: sara is running 10 secs || 110123 markings, 294391 edges, 6730 markings/sec, 10 secs
lola: sara is running 15 secs || 140995 markings, 382173 edges, 6174 markings/sec, 15 secs
lola: sara is running 20 secs || 169518 markings, 466691 edges, 5705 markings/sec, 20 secs
lola: sara is running 25 secs || 199044 markings, 551262 edges, 5905 markings/sec, 25 secs
lola: sara is running 30 secs || 227901 markings, 640088 edges, 5771 markings/sec, 30 secs
lola: sara is running 35 secs || 260000 markings, 732189 edges, 6420 markings/sec, 35 secs
lola: sara is running 40 secs || 286990 markings, 816287 edges, 5398 markings/sec, 40 secs
lola: sara is running 45 secs || 319528 markings, 910372 edges, 6508 markings/sec, 45 secs
lola: sara is running 50 secs || 344835 markings, 988914 edges, 5061 markings/sec, 50 secs
lola: sara is running 55 secs || 375095 markings, 1076537 edges, 6052 markings/sec, 55 secs
lola: sara is running 60 secs || 400866 markings, 1156091 edges, 5154 markings/sec, 60 secs
lola: sara is running 65 secs || 425534 markings, 1234309 edges, 4934 markings/sec, 65 secs
lola: sara is running 70 secs || 456845 markings, 1324325 edges, 6262 markings/sec, 70 secs
lola: sara is running 75 secs || 482182 markings, 1404811 edges, 5067 markings/sec, 75 secs
lola: sara is running 80 secs || 507582 markings, 1484004 edges, 5080 markings/sec, 80 secs
lola: sara is running 85 secs || 538454 markings, 1572923 edges, 6174 markings/sec, 85 secs
lola: sara is running 90 secs || 563881 markings, 1653444 edges, 5085 markings/sec, 90 secs
lola: sara is running 95 secs || 588837 markings, 1732888 edges, 4991 markings/sec, 95 secs
lola: sara is running 100 secs || 619387 markings, 1820991 edges, 6110 markings/sec, 100 secs
lola: sara is running 105 secs || 645658 markings, 1903547 edges, 5254 markings/sec, 105 secs
lola: sara is running 110 secs || 669342 markings, 1978551 edges, 4737 markings/sec, 110 secs
lola: sara is running 115 secs || 695424 markings, 2057913 edges, 5216 markings/sec, 115 secs
lola: sara is running 120 secs || 724525 markings, 2144507 edges, 5820 markings/sec, 120 secs
lola: sara is running 125 secs || 749611 markings, 2223776 edges, 5017 markings/sec, 125 secs
lola: sara is running 130 secs || 772541 markings, 2298769 edges, 4586 markings/sec, 130 secs
lola: sara is running 135 secs || 798568 markings, 2376932 edges, 5205 markings/sec, 135 secs
lola: sara is running 140 secs || 827127 markings, 2460108 edges, 5712 markings/sec, 140 secs
lola: sara is running 145 secs || 849808 markings, 2530824 edges, 4536 markings/sec, 145 secs
lola: sara is running 150 secs || 874838 markings, 2607919 edges, 5006 markings/sec, 150 secs
lola: sara is running 155 secs || 898333 markings, 2681291 edges, 4699 markings/sec, 155 secs
lola: sara is running 160 secs || 921940 markings, 2756393 edges, 4721 markings/sec, 160 secs
lola: sara is running 165 secs || 945567 markings, 2831914 edges, 4725 markings/sec, 165 secs
lola: sara is running 170 secs || 969465 markings, 2908104 edges, 4780 markings/sec, 170 secs
lola: sara is running 175 secs || 993452 markings, 2985202 edges, 4797 markings/sec, 175 secs
lola: sara is running 180 secs || 1017275 markings, 3062935 edges, 4765 markings/sec, 180 secs
lola: sara is running 185 secs || 1039120 markings, 3135400 edges, 4369 markings/sec, 185 secs
lola: sara is running 190 secs || 1065884 markings, 3211913 edges, 5353 markings/sec, 190 secs
lola: sara is running 195 secs || 1089906 markings, 3284618 edges, 4804 markings/sec, 195 secs
lola: sara is running 200 secs || 1113761 markings, 3357848 edges, 4771 markings/sec, 200 secs
lola: sara is running 205 secs || 1139513 markings, 3436553 edges, 5150 markings/sec, 205 secs
lola: sara is running 210 secs || 1162776 markings, 3509452 edges, 4653 markings/sec, 210 secs
lola: sara is running 215 secs || 1186178 markings, 3583532 edges, 4680 markings/sec, 215 secs
lola: sara is running 220 secs || 1209098 markings, 3656622 edges, 4584 markings/sec, 220 secs
lola: sara is running 225 secs || 1231014 markings, 3727553 edges, 4383 markings/sec, 225 secs
lola: sara is running 230 secs || 1253762 markings, 3801956 edges, 4550 markings/sec, 230 secs
lola: sara is running 235 secs || 1279261 markings, 3882040 edges, 5100 markings/sec, 235 secs
lola: sara is running 240 secs || 1301935 markings, 3955879 edges, 4535 markings/sec, 240 secs
lola: sara is running 245 secs || 1323082 markings, 4026835 edges, 4229 markings/sec, 245 secs
lola: sara is running 250 secs || 1348489 markings, 4100147 edges, 5081 markings/sec, 250 secs
lola: sara is running 255 secs || 1374421 markings, 4176489 edges, 5186 markings/sec, 255 secs
lola: sara is running 260 secs || 1398212 markings, 4248919 edges, 4758 markings/sec, 260 secs
lola: sara is running 265 secs || 1421144 markings, 4320138 edges, 4586 markings/sec, 265 secs
lola: sara is running 270 secs || 1443974 markings, 4391575 edges, 4566 markings/sec, 270 secs
lola: sara is running 275 secs || 1466920 markings, 4464190 edges, 4589 markings/sec, 275 secs
lola: sara is running 280 secs || 1489759 markings, 4537023 edges, 4568 markings/sec, 280 secs
lola: sara is running 285 secs || 1510152 markings, 4603469 edges, 4079 markings/sec, 285 secs
lola: sara is running 290 secs || 1531765 markings, 4671918 edges, 4323 markings/sec, 290 secs
lola: sara is running 295 secs || 1554047 markings, 4743865 edges, 4456 markings/sec, 295 secs
lola: sara is running 300 secs || 1574329 markings, 4811692 edges, 4056 markings/sec, 300 secs
lola: sara is running 305 secs || 1595522 markings, 4877940 edges, 4239 markings/sec, 305 secs
lola: sara is running 310 secs || 1615931 markings, 4945747 edges, 4082 markings/sec, 310 secs
lola: sara is running 315 secs || 1637142 markings, 5013126 edges, 4242 markings/sec, 315 secs
lola: sara is running 320 secs || 1659505 markings, 5088309 edges, 4473 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 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p3 + p4 <= 2) OR ((2 <= p0) AND (p125 <= p126)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p71)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 14)
lola: sara is running 0 secs || 62158 markings, 170252 edges, 12432 markings/sec, 0 secs
lola: sara is running 5 secs || 128498 markings, 365609 edges, 13268 markings/sec, 5 secs
lola: sara is running 10 secs || 194643 markings, 562987 edges, 13229 markings/sec, 10 secs
lola: sara is running 15 secs || 261054 markings, 768989 edges, 13282 markings/sec, 15 secs
lola: sara is running 20 secs || 326467 markings, 973408 edges, 13083 markings/sec, 20 secs
lola: sara is running 25 secs || 388166 markings, 1170308 edges, 12340 markings/sec, 25 secs
lola: sara is running 30 secs || 451235 markings, 1368118 edges, 12614 markings/sec, 30 secs
lola: sara is running 35 secs || 512485 markings, 1559780 edges, 12250 markings/sec, 35 secs
lola: sara is running 40 secs || 572718 markings, 1755364 edges, 12047 markings/sec, 40 secs
lola: sara is running 45 secs || 634418 markings, 1948707 edges, 12340 markings/sec, 45 secs
lola: sara is running 50 secs || 693216 markings, 2137772 edges, 11760 markings/sec, 50 secs
lola: sara is running 55 secs || 751574 markings, 2324072 edges, 11672 markings/sec, 55 secs
lola: sara is running 60 secs || 810792 markings, 2513876 edges, 11844 markings/sec, 60 secs
lola: sara is running 65 secs || 869036 markings, 2700348 edges, 11649 markings/sec, 65 secs
lola: sara is running 70 secs || 924633 markings, 2882401 edges, 11119 markings/sec, 70 secs
lola: sara is running 75 secs || 983091 markings, 3066109 edges, 11692 markings/sec, 75 secs
lola: sara is running 80 secs || 1039330 markings, 3251878 edges, 11248 markings/sec, 80 secs
lola: sara is running 85 secs || 1108088 markings, 3462477 edges, 13752 markings/sec, 85 secs
lola: sara is running 90 secs || 1175496 markings, 3679570 edges, 13482 markings/sec, 90 secs
lola: sara is running 95 secs || 1236727 markings, 3877719 edges, 12246 markings/sec, 95 secs
lola: sara is running 100 secs || 1293226 markings, 4064877 edges, 11300 markings/sec, 100 secs
lola: sara is running 105 secs || 1347205 markings, 4246134 edges, 10796 markings/sec, 105 secs
lola: sara is running 110 secs || 1426493 markings, 4488429 edges, 15858 markings/sec, 110 secs
lola: sara is running 115 secs || 1493464 markings, 4705102 edges, 13394 markings/sec, 115 secs
lola: sara is running 120 secs || 1553631 markings, 4901903 edges, 12033 markings/sec, 120 secs
lola: sara is running 125 secs || 1610292 markings, 5090863 edges, 11332 markings/sec, 125 secs
lola: sara is running 130 secs || 1672808 markings, 5296552 edges, 12503 markings/sec, 130 secs
lola: sara is running 135 secs || 1740473 markings, 5506511 edges, 13533 markings/sec, 135 secs
lola: sara is running 140 secs || 1814176 markings, 5743144 edges, 14741 markings/sec, 140 secs
lola: sara is running 145 secs || 1878968 markings, 5954034 edges, 12958 markings/sec, 145 secs
lola: sara is running 150 secs || 1938256 markings, 6151391 edges, 11858 markings/sec, 150 secs
lola: sara is running 155 secs || 1997105 markings, 6343539 edges, 11770 markings/sec, 155 secs
lola: sara is running 160 secs || 2054542 markings, 6538323 edges, 11487 markings/sec, 160 secs
lola: sara is running 165 secs || 2125994 markings, 6758083 edges, 14290 markings/sec, 165 secs
lola: sara is running 170 secs || 2201755 markings, 7002392 edges, 15152 markings/sec, 170 secs
lola: sara is running 175 secs || 2266235 markings, 7213750 edges, 12896 markings/sec, 175 secs
lola: sara is running 180 secs || 2329744 markings, 7422192 edges, 12702 markings/sec, 180 secs
lola: sara is running 185 secs || 2385718 markings, 7610734 edges, 11195 markings/sec, 185 secs
lola: sara is running 190 secs || 2447503 markings, 7814632 edges, 12357 markings/sec, 190 secs
lola: sara is running 195 secs || 2508114 markings, 8010546 edges, 12122 markings/sec, 195 secs
lola: sara is running 200 secs || 2592466 markings, 8275622 edges, 16870 markings/sec, 200 secs
lola: sara is running 205 secs || 2662978 markings, 8506231 edges, 14102 markings/sec, 205 secs
lola: sara is running 210 secs || 2729979 markings, 8725274 edges, 13400 markings/sec, 210 secs
lola: sara is running 215 secs || 2789025 markings, 8924478 edges, 11809 markings/sec, 215 secs
lola: sara is running 220 secs || 2851826 markings, 9131383 edges, 12560 markings/sec, 220 secs
lola: sara is running 225 secs || 2911226 markings, 9328964 edges, 11880 markings/sec, 225 secs
lola: sara is running 230 secs || 2974751 markings, 9534136 edges, 12705 markings/sec, 230 secs
lola: sara is running 235 secs || 3060143 markings, 9803238 edges, 17078 markings/sec, 235 secs
lola: sara is running 240 secs || 3131085 markings, 10034447 edges, 14188 markings/sec, 240 secs
lola: sara is running 245 secs || 3190512 markings, 10232559 edges, 11885 markings/sec, 245 secs
lola: sara is running 250 secs || 3254173 markings, 10440838 edges, 12732 markings/sec, 250 secs
lola: sara is running 255 secs || 3312909 markings, 10639852 edges, 11747 markings/sec, 255 secs
lola: sara is running 260 secs || 3369908 markings, 10832046 edges, 11400 markings/sec, 260 secs
lola: sara is running 265 secs || 3425648 markings, 11019358 edges, 11148 markings/sec, 265 secs
lola: sara is running 270 secs || 3490011 markings, 11219649 edges, 12873 markings/sec, 270 secs
lola: sara is running 275 secs || 3571710 markings, 11478914 edges, 16340 markings/sec, 275 secs
lola: sara is running 280 secs || 3641086 markings, 11704652 edges, 13875 markings/sec, 280 secs
lola: sara is running 285 secs || 3701796 markings, 11908465 edges, 12142 markings/sec, 285 secs
lola: sara is running 290 secs || 3763298 markings, 12111651 edges, 12300 markings/sec, 290 secs
lola: sara is running 295 secs || 3824656 markings, 12315381 edges, 12272 markings/sec, 295 secs
lola: sara is running 300 secs || 3882783 markings, 12509897 edges, 11625 markings/sec, 300 secs
lola: sara is running 305 secs || 3939337 markings, 12700611 edges, 11311 markings/sec, 305 secs
lola: sara is running 310 secs || 3991829 markings, 12879552 edges, 10498 markings/sec, 310 secs
lola: sara is running 315 secs || 4072394 markings, 13125888 edges, 16113 markings/sec, 315 secs
lola: sara is running 320 secs || 4150877 markings, 13378343 edges, 15697 markings/sec, 320 secs
lola: sara is running 325 secs || 4215995 markings, 13594757 edges, 13024 markings/sec, 325 secs
lola: sara is running 330 secs || 4282009 markings, 13812191 edges, 13203 markings/sec, 330 secs
lola: sara is running 335 secs || 4346120 markings, 14024328 edges, 12822 markings/sec, 335 secs
lola: sara is running 340 secs || 4407747 markings, 14230508 edges, 12325 markings/sec, 340 secs
lola: sara is running 345 secs || 4467619 markings, 14431396 edges, 11974 markings/sec, 345 secs
lola: sara is running 350 secs || 4524810 markings, 14624948 edges, 11438 markings/sec, 350 secs
lola: sara is running 355 secs || 4576479 markings, 14802141 edges, 10334 markings/sec, 355 secs
lola: sara is running 360 secs || 4656665 markings, 15047704 edges, 16037 markings/sec, 360 secs
lola: sara is running 365 secs || 4734569 markings, 15299368 edges, 15581 markings/sec, 365 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p0 <= 2) AND (p3 + p4 <= 0)) OR (((p16 + p17 <= p125) OR (3 <= p70)) AND (2 <= p3 + p4)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p70)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p125) AND (p71 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 12)
lola: sara is running 0 secs || 71661 markings, 186012 edges, 14332 markings/sec, 0 secs
lola: sara is running 5 secs || 144695 markings, 390129 edges, 14607 markings/sec, 5 secs
lola: sara is running 10 secs || 216329 markings, 584568 edges, 14327 markings/sec, 10 secs
lola: sara is running 15 secs || 286375 markings, 780117 edges, 14009 markings/sec, 15 secs
lola: sara is running 20 secs || 363348 markings, 1005674 edges, 15395 markings/sec, 20 secs
lola: sara is running 25 secs || 439425 markings, 1227603 edges, 15215 markings/sec, 25 secs
lola: sara is running 30 secs || 511567 markings, 1440287 edges, 14428 markings/sec, 30 secs
lola: sara is running 35 secs || 580159 markings, 1641071 edges, 13718 markings/sec, 35 secs
lola: sara is running 40 secs || 640486 markings, 1818260 edges, 12065 markings/sec, 40 secs
lola: sara is running 45 secs || 713927 markings, 2039588 edges, 14688 markings/sec, 45 secs
lola: sara is running 50 secs || 787097 markings, 2261622 edges, 14634 markings/sec, 50 secs
lola: sara is running 55 secs || 860062 markings, 2481670 edges, 14593 markings/sec, 55 secs
lola: sara is running 60 secs || 933218 markings, 2703339 edges, 14631 markings/sec, 60 secs
lola: sara is running 65 secs || 1005626 markings, 2921854 edges, 14482 markings/sec, 65 secs
lola: sara is running 70 secs || 1069093 markings, 3113384 edges, 12693 markings/sec, 70 secs
lola: sara is running 75 secs || 1123706 markings, 3276062 edges, 10923 markings/sec, 75 secs
lola: sara is running 80 secs || 1195094 markings, 3496443 edges, 14278 markings/sec, 80 secs
lola: sara is running 85 secs || 1269777 markings, 3726464 edges, 14937 markings/sec, 85 secs
lola: sara is running 90 secs || 1343605 markings, 3956262 edges, 14766 markings/sec, 90 secs
lola: sara is running 95 secs || 1421221 markings, 4194612 edges, 15523 markings/sec, 95 secs
lola: sara is running 100 secs || 1495772 markings, 4423539 edges, 14910 markings/sec, 100 secs
lola: sara is running 105 secs || 1567956 markings, 4647409 edges, 14437 markings/sec, 105 secs
lola: sara is running 110 secs || 1641603 markings, 4873351 edges, 14729 markings/sec, 110 secs
lola: sara is running 115 secs || 1699629 markings, 5053787 edges, 11605 markings/sec, 115 secs
lola: sara is running 120 secs || 1752453 markings, 5216503 edges, 10565 markings/sec, 120 secs
lola: sara is running 125 secs || 1810743 markings, 5396571 edges, 11658 markings/sec, 125 secs
lola: sara is running 130 secs || 1886289 markings, 5632599 edges, 15109 markings/sec, 130 secs
lola: sara is running 135 secs || 1961866 markings, 5868808 edges, 15115 markings/sec, 135 secs
lola: sara is running 140 secs || 2036648 markings, 6103045 edges, 14956 markings/sec, 140 secs
lola: sara is running 145 secs || 2111128 markings, 6336667 edges, 14896 markings/sec, 145 secs
lola: sara is running 150 secs || 2183691 markings, 6563455 edges, 14513 markings/sec, 150 secs
lola: sara is running 155 secs || 2256484 markings, 6791215 edges, 14559 markings/sec, 155 secs
lola: sara is running 160 secs || 2331291 markings, 7025561 edges, 14961 markings/sec, 160 secs
lola: sara is running 165 secs || 2406255 markings, 7258483 edges, 14993 markings/sec, 165 secs
lola: sara is running 170 secs || 2470584 markings, 7461620 edges, 12866 markings/sec, 170 secs
lola: sara is running 175 secs || 2516590 markings, 7607163 edges, 9201 markings/sec, 175 secs
lola: sara is running 180 secs || 2569888 markings, 7776186 edges, 10660 markings/sec, 180 secs
lola: sara is running 185 secs || 2624313 markings, 7942603 edges, 10885 markings/sec, 185 secs
lola: sara is running 190 secs || 2697809 markings, 8178744 edges, 14699 markings/sec, 190 secs
lola: sara is running 195 secs || 2771797 markings, 8413557 edges, 14798 markings/sec, 195 secs
lola: sara is running 200 secs || 2847715 markings, 8652792 edges, 15184 markings/sec, 200 secs
lola: sara is running 205 secs || 2925570 markings, 8899298 edges, 15571 markings/sec, 205 secs
lola: sara is running 210 secs || 3005551 markings, 9151011 edges, 15996 markings/sec, 210 secs
lola: sara is running 215 secs || 3083505 markings, 9397777 edges, 15591 markings/sec, 215 secs
lola: sara is running 220 secs || 3159903 markings, 9639293 edges, 15280 markings/sec, 220 secs
lola: sara is running 225 secs || 3235102 markings, 9876218 edges, 15040 markings/sec, 225 secs
lola: sara is running 230 secs || 3308170 markings, 10107789 edges, 14614 markings/sec, 230 secs
lola: sara is running 235 secs || 3380358 markings, 10335883 edges, 14438 markings/sec, 235 secs
lola: sara is running 240 secs || 3443045 markings, 10537652 edges, 12537 markings/sec, 240 secs
lola: sara is running 245 secs || 3489015 markings, 10687823 edges, 9194 markings/sec, 245 secs
lola: sara is running 250 secs || 3547406 markings, 10875111 edges, 11678 markings/sec, 250 secs
lola: sara is running 255 secs || 3600579 markings, 11044662 edges, 10635 markings/sec, 255 secs
lola: sara is running 260 secs || 3654122 markings, 11211514 edges, 10709 markings/sec, 260 secs
lola: sara is running 265 secs || 3729424 markings, 11454923 edges, 15060 markings/sec, 265 secs
lola: sara is running 270 secs || 3803322 markings, 11691324 edges, 14780 markings/sec, 270 secs
lola: sara is running 275 secs || 3883461 markings, 11944710 edges, 16028 markings/sec, 275 secs
lola: sara is running 280 secs || 3963493 markings, 12201178 edges, 16006 markings/sec, 280 secs
lola: sara is running 285 secs || 4037407 markings, 12437602 edges, 14783 markings/sec, 285 secs
lola: sara is running 290 secs || 4110067 markings, 12670047 edges, 14532 markings/sec, 290 secs
lola: sara is running 295 secs || 4185659 markings, 12910311 edges, 15118 markings/sec, 295 secs
lola: sara is running 300 secs || 4265761 markings, 13164832 edges, 16020 markings/sec, 300 secs
lola: sara is running 305 secs || 4340806 markings, 13404291 edges, 15009 markings/sec, 305 secs
lola: sara is running 310 secs || 4413496 markings, 13636811 edges, 14538 markings/sec, 310 secs
lola: sara is running 315 secs || 4487053 markings, 13871522 edges, 14711 markings/sec, 315 secs
lola: sara is running 320 secs || 4560679 markings, 14107802 edges, 14725 markings/sec, 320 secs
lola: sara is running 325 secs || 4609982 markings, 14269935 edges, 9861 markings/sec, 325 secs
lola: sara is running 330 secs || 4655593 markings, 14421138 edges, 9122 markings/sec, 330 secs
lola: sara is running 335 secs || 4716215 markings, 14618158 edges, 12124 markings/sec, 335 secs
lola: sara is running 340 secs || 4761168 markings, 14765708 edges, 8991 markings/sec, 340 secs
lola: sara is running 345 secs || 4815938 markings, 14942755 edges, 10954 markings/sec, 345 secs
lola: sara is running 350 secs || 4865121 markings, 15097058 edges, 9837 markings/sec, 350 secs
lola: sara is running 355 secs || 4934056 markings, 15323187 edges, 13787 markings/sec, 355 secs
lola: sara is running 360 secs || 5016740 markings, 15584711 edges, 16537 markings/sec, 360 secs
lola: sara is running 365 secs || 5094556 markings, 15838307 edges, 15563 markings/sec, 365 secs
lola: sara is running 370 secs || 5165251 markings, 16065757 edges, 14139 markings/sec, 370 secs
lola: sara is running 375 secs || 5252755 markings, 16344555 edges, 17501 markings/sec, 375 secs
lola: sara is running 380 secs || 5327680 markings, 16587977 edges, 14985 markings/sec, 380 secs
lola: sara is running 385 secs || 5398183 markings, 16814839 edges, 14101 markings/sec, 385 secs
lola: sara is running 390 secs || 5483262 markings, 17085575 edges, 17016 markings/sec, 390 secs
lola: sara is running 395 secs || 5555217 markings, 17319611 edges, 14391 markings/sec, 395 secs
lola: sara is running 400 secs || 5626265 markings, 17548789 edges, 14210 markings/sec, 400 secs
lola: sara is running 405 secs || 5702101 markings, 17792495 edges, 15167 markings/sec, 405 secs
lola: sara is running 410 secs || 5784660 markings, 18054328 edges, 16512 markings/sec, 410 secs
lola: sara is running 415 secs || 5860619 markings, 18299796 edges, 15192 markings/sec, 415 secs
lola: sara is running 420 secs || 5931252 markings, 18529628 edges, 14127 markings/sec, 420 secs
lola: sara is running 425 secs || 5980906 markings, 18695943 edges, 9931 markings/sec, 425 secs
lola: sara is running 430 secs || 6026938 markings, 18850952 edges, 9206 markings/sec, 430 secs
lola: sara is running 435 secs || 6072668 markings, 19004513 edges, 9146 markings/sec, 435 secs
lola: sara is running 440 secs || 6135223 markings, 19208253 edges, 12511 markings/sec, 440 secs
lola: sara is running 445 secs || 6180103 markings, 19358450 edges, 8976 markings/sec, 445 secs
lola: sara is running 450 secs || 6226495 markings, 19511560 edges, 9278 markings/sec, 450 secs
lola: sara is running 455 secs || 6280007 markings, 19685809 edges, 10702 markings/sec, 455 secs
lola: sara is running 460 secs || 6335350 markings, 19859778 edges, 11069 markings/sec, 460 secs
lola: sara is running 465 secs || 6405328 markings, 20091447 edges, 13996 markings/sec, 465 secs
lola: sara is running 470 secs || 6488594 markings, 20356201 edges, 16653 markings/sec, 470 secs
lola: sara is running 475 secs || 6564008 markings, 20604186 edges, 15083 markings/sec, 475 secs
lola: sara is running 480 secs || 6640660 markings, 20851907 edges, 15330 markings/sec, 480 secs
lola: sara is running 485 secs || 6722267 markings, 21117206 edges, 16321 markings/sec, 485 secs
lola: sara is running 490 secs || 6788940 markings, 21335067 edges, 13335 markings/sec, 490 secs
lola: sara is running 495 secs || 6881187 markings, 21629153 edges, 18449 markings/sec, 495 secs
lola: sara is running 500 secs || 6949526 markings, 21855215 edges, 13668 markings/sec, 500 secs
lola: sara is running 505 secs || 7029142 markings, 22109463 edges, 15923 markings/sec, 505 secs
lola: sara is running 510 secs || 7108146 markings, 22366809 edges, 15801 markings/sec, 510 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p70 <= p125) AND (2 <= p1 + p2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1041 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p125 + 1 <= p71) OR (p123 <= 0)) AND ((p1 + p2 + 1 <= p16 + p17) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2082 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= 0) OR (p70 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no yes no unknown yes unknown yes no unknown no no no yes
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494607741979

--------------------
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-V50P20N10"
export BK_EXAMINATION="ReachabilityCardinality"
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-V50P20N10.tgz
mv BridgeAndVehicles-COL-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-COL-V50P20N10, examination is ReachabilityCardinality"
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-149436126200331"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;