About the Execution of LoLA for GPPP-PT-C1000N0000001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15951.490 | 1288008.00 | 2580471.00 | 12212.90 | ?FTF?TFTTF?TTTF? | 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 GPPP-PT-C1000N0000001000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264500592
=====================================================================
--------------------
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 GPPP-PT-C1000N0000001000-ReachabilityCardinality-0
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-1
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-15
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-3
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-4
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-5
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-6
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-7
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-8
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494727224364
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ GPPP-PT-C1000N0000001000 @ 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C1000N0000001000-ReachabilityCardinality.task
lola: A (G (((Pi <= a1) OR (FBP <= a2) OR ((3 <= a1) AND (a1 <= NADPH)) OR (2 <= b2)))) : A (G (((2 <= a2) OR (R5P <= 0)))) : E (F ((2 <= _1_3_BPG))) : A (G (((((2 <= DHAP) OR (_3PG <= R5P)) AND (Lac <= Pi)) OR ((G6P + 1 <= NADPplus) AND (a2 <= 0))))) : E (F (((3 <= start) AND ((b2 <= 2) OR (S7P + 1 <= a1))))) : E (F ((2 <= NADH))) : E (F ((b2 + 1 <= R5P))) : E (F (((3 <= _1_3_BPG) AND (DHAP <= _2PG) AND (GSSG <= 1) AND (1 <= GSH)))) : A (G ((FBP <= b2))) : E (F (((2 <= b2) AND (c2 + 1 <= NADPplus) AND (DHAP + 1 <= NADH) AND (G6P + 1 <= a2)))) : E (F ((FBP + 1 <= Lac))) : A (G (((3 <= Gluc) OR (c1 <= GAP) OR (NADH <= DHAP) OR ((c1 <= GSH) AND (start <= Pi) AND (b1 <= 0))))) : A (G (((NADplus <= DHAP) OR (_3PG <= NADplus) OR (2 <= Ru5P) OR ((GSH + 1 <= b1) AND ((a2 <= R5P) OR (1 <= b1)))))) : E (F (((_2PG <= c2) AND (1 <= _1_3_BPG) AND (GSSG + 1 <= GSH) AND (NADH <= 2)))) : A (G (((_1_3_BPG <= 2) OR ((2 <= R5P)) OR (b2 + 1 <= Lac) OR (c1 + 1 <= F6P)))) : A (G (((E4P <= 1) OR ((R5P <= Ru5P) AND (a2 <= ADP) AND (_1_3_BPG <= ATP)))))
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 (G (((Pi <= a1) OR (FBP <= a2) OR ((3 <= a1) AND (a1 <= NADPH)) OR (2 <= b2))))
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 84 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2958964 markings, 6844398 edges, 591793 markings/sec, 0 secs
lola: sara is running 5 secs || 5749009 markings, 13447002 edges, 558009 markings/sec, 5 secs
lola: sara is running 10 secs || 8504661 markings, 19999855 edges, 551130 markings/sec, 10 secs
lola: sara is running 15 secs || 11172187 markings, 26380273 edges, 533505 markings/sec, 15 secs
lola: sara is running 20 secs || 13793207 markings, 32652182 edges, 524204 markings/sec, 20 secs
lola: sara is running 25 secs || 16461170 markings, 39038515 edges, 533593 markings/sec, 25 secs
lola: sara is running 30 secs || 19018483 markings, 45202918 edges, 511463 markings/sec, 30 secs
lola: sara is running 35 secs || 21582059 markings, 51383340 edges, 512715 markings/sec, 35 secs
lola: sara is running 40 secs || 24081925 markings, 57412346 edges, 499973 markings/sec, 40 secs
lola: sara is running 45 secs || 26570642 markings, 63364025 edges, 497743 markings/sec, 45 secs
lola: sara is running 50 secs || 29041563 markings, 69326856 edges, 494184 markings/sec, 50 secs
lola: sara is running 55 secs || 31030853 markings, 74164931 edges, 397858 markings/sec, 55 secs
lola: sara is running 60 secs || 33411189 markings, 79921187 edges, 476067 markings/sec, 60 secs
lola: sara is running 65 secs || 35776187 markings, 85632185 edges, 473000 markings/sec, 65 secs
lola: sara is running 70 secs || 38165933 markings, 91396466 edges, 477949 markings/sec, 70 secs
lola: sara is running 75 secs || 40199604 markings, 96290006 edges, 406734 markings/sec, 75 secs
lola: sara is running 80 secs || 42549837 markings, 102024247 edges, 470047 markings/sec, 80 secs
lola: sara is running 85 secs || 44890622 markings, 107685255 edges, 468157 markings/sec, 85 secs
lola: sara is running 90 secs || 47319209 markings, 113543666 edges, 485717 markings/sec, 90 secs
lola: sara is running 95 secs || 49764182 markings, 119482751 edges, 488995 markings/sec, 95 secs
lola: sara is running 100 secs || 52011340 markings, 124939361 edges, 449432 markings/sec, 100 secs
lola: sara is running 105 secs || 54392190 markings, 130678076 edges, 476170 markings/sec, 105 secs
lola: sara is running 110 secs || 56725843 markings, 136378641 edges, 466731 markings/sec, 110 secs
lola: sara is running 115 secs || 58997707 markings, 141869977 edges, 454373 markings/sec, 115 secs
lola: sara is running 120 secs || 61440017 markings, 147755317 edges, 488462 markings/sec, 120 secs
lola: sara is running 125 secs || 63566087 markings, 152966371 edges, 425214 markings/sec, 125 secs
lola: sara is running 130 secs || 65992459 markings, 158814030 edges, 485274 markings/sec, 130 secs
lola: sara is running 135 secs || 68206997 markings, 164243025 edges, 442908 markings/sec, 135 secs
lola: sara is running 140 secs || 70687174 markings, 170221145 edges, 496035 markings/sec, 140 secs
lola: sara is running 145 secs || 72994737 markings, 175877995 edges, 461513 markings/sec, 145 secs
lola: sara is running 150 secs || 75441872 markings, 181778866 edges, 489427 markings/sec, 150 secs
lola: sara is running 155 secs || 77359961 markings, 186481978 edges, 383618 markings/sec, 155 secs
lola: sara is running 160 secs || 79787583 markings, 192329730 edges, 485524 markings/sec, 160 secs
lola: sara is running 165 secs || 82081177 markings, 197955567 edges, 458719 markings/sec, 165 secs
lola: sara is running 170 secs || 84499605 markings, 203774299 edges, 483686 markings/sec, 170 secs
lola: sara is running 175 secs || 86762183 markings, 209335983 edges, 452516 markings/sec, 175 secs
lola: sara is running 180 secs || 89168324 markings, 215173662 edges, 481228 markings/sec, 180 secs
lola: sara is running 185 secs || 91437241 markings, 220692237 edges, 453783 markings/sec, 185 secs
lola: sara is running 190 secs || 93711457 markings, 226259562 edges, 454843 markings/sec, 190 secs
lola: sara is running 195 secs || 96061840 markings, 231930019 edges, 470077 markings/sec, 195 secs
lola: sara is running 200 secs || 98255566 markings, 237314025 edges, 438745 markings/sec, 200 secs
lola: sara is running 205 secs || 100647742 markings, 243068794 edges, 478435 markings/sec, 205 secs
lola: sara is running 210 secs || 102804376 markings, 248369521 edges, 431327 markings/sec, 210 secs
lola: sara is running 215 secs || 104644320 markings, 252873196 edges, 367989 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= a2) OR (R5P <= 0))))
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 84 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 GPPP-PT-C1000N0000001000-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= _1_3_BPG)))
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 84 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-2.sara
lola: The predicate is reachable.
lola: lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
========================================
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: A (G (((((2 <= DHAP) OR (_3PG <= R5P)) AND (Lac <= Pi)) OR ((G6P + 1 <= NADPplus) AND (a2 <= 0)))))
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 84 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-3.sara
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= start) AND ((b2 <= 2) OR (S7P + 1 <= a1)))))
lola: ========================================
lola: SUBTASK
lola: lola: ========================================checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: sara: using 84 bytes per marking, with 0 unused bits
try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-2.sara.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: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4406995 markings, 8783935 edges, 881399 markings/sec, 0 secs
lola: sara is running 5 secs || 8629660 markings, 17229265 edges, 844533 markings/sec, 5 secs
lola: sara is running 10 secs || 13774369 markings, 25598785 edges, 1028942 markings/sec, 10 secs
lola: sara is running 15 secs || 18669170 markings, 33430469 edges, 978960 markings/sec, 15 secs
lola: sara is running 20 secs || 23503421 markings, 41165271 edges, 966850 markings/sec, 20 secs
lola: sara is running 25 secs || 27372408 markings, 48716780 edges, 773797 markings/sec, 25 secs
lola: sara is running 30 secs || 31121301 markings, 56207577 edges, 749779 markings/sec, 30 secs
lola: sara is running 35 secs || 35509799 markings, 64984576 edges, 877700 markings/sec, 35 secs
lola: sara is running 40 secs || 39664829 markings, 73294636 edges, 831006 markings/sec, 40 secs
lola: sara is running 45 secs || 43758916 markings, 81482811 edges, 818817 markings/sec, 45 secs
lola: sara is running 50 secs || 47866257 markings, 89697490 edges, 821468 markings/sec, 50 secs
lola: sara is running 55 secs || 52898247 markings, 97750446 edges, 1006398 markings/sec, 55 secs
lola: sara is running 60 secs || 57489851 markings, 105097013 edges, 918321 markings/sec, 60 secs
lola: sara is running 65 secs || 62023142 markings, 112350279 edges, 906658 markings/sec, 65 secs
lola: sara is running 70 secs || 66162539 markings, 119604429 edges, 827879 markings/sec, 70 secs
lola: sara is running 75 secs || 70067436 markings, 126636552 edges, 780979 markings/sec, 75 secs
lola: sara is running 80 secs || 73904527 markings, 133550417 edges, 767418 markings/sec, 80 secs
lola: sara is running 85 secs || 77764003 markings, 140515527 edges, 771895 markings/sec, 85 secs
lola: sara is running 90 secs || 81631701 markings, 147499021 edges, 773540 markings/sec, 90 secs
lola: sara is running 95 secs || 85565599 markings, 154600100 edges, 786780 markings/sec, 95 secs
lola: sara is running 100 secs || 89503826 markings, 161710870 edges, 787645 markings/sec, 100 secs
lola: sara is running 105 secs || 93165295 markings, 168312529 edges, 732294 markings/sec, 105 secs
lola: sara is running 110 secs || 97098837 markings, 175414796 edges, 786708 markings/sec, 110 secs
lola: sara is running 115 secs || 100948737 markings, 182342134 edges, 769980 markings/sec, 115 secs
lola: sara is running 120 secs || 104802154 markings, 189340828 edges, 770683 markings/sec, 120 secs
lola: sara is running 125 secs || 108677951 markings, 196341722 edges, 775159 markings/sec, 125 secs
lola: sara is running 130 secs || 112548518 markings, 203288393 edges, 774113 markings/sec, 130 secs
lola: sara is running 135 secs || 116423550 markings, 210304753 edges, 775006 markings/sec, 135 secs
lola: sara is running 140 secs || 120275342 markings, 217239628 edges, 770358 markings/sec, 140 secs
lola: sara is running 145 secs || 123860840 markings, 223721278 edges, 717100 markings/sec, 145 secs
lola: sara is running 150 secs || 127717456 markings, 230718536 edges, 771323 markings/sec, 150 secs
lola: sara is running 155 secs || 131524498 markings, 237588481 edges, 761408 markings/sec, 155 secs
lola: sara is running 160 secs || 135370572 markings, 244507819 edges, 769215 markings/sec, 160 secs
lola: sara is running 165 secs || 139225421 markings, 251462753 edges, 770970 markings/sec, 165 secs
lola: sara is running 170 secs || 143114186 markings, 258503544 edges, 777753 markings/sec, 170 secs
lola: sara is running 175 secs || 146936821 markings, 265435710 edges, 764527 markings/sec, 175 secs
lola: sara is running 180 secs || 150807901 markings, 272420490 edges, 774216 markings/sec, 180 secs
lola: sara is running 185 secs || 154653385 markings, 279381067 edges, 769097 markings/sec, 185 secs
lola: sara is running 190 secs || 158546573 markings, 286391277 edges, 778638 markings/sec, 190 secs
lola: sara is running 195 secs || 162378472 markings, 293256768 edges, 766380 markings/sec, 195 secs
lola: sara is running 200 secs || 166153353 markings, 300150548 edges, 754976 markings/sec, 200 secs
lola: sara is running 205 secs || 169992718 markings, 307108648 edges, 767873 markings/sec, 205 secs
lola: sara is running 210 secs || 173903113 markings, 314123858 edges, 782079 markings/sec, 210 secs
lola: sara is running 215 secs || 177704203 markings, 321022054 edges, 760218 markings/sec, 215 secs
lola: sara is running 220 secs || 178678334 markings, 322791715 edges, 194826 markings/sec, 220 secs
lola: sara is running 225 secs || 178691047 markings, 322817143 edges, 2543 markings/sec, 225 secs
lola: sara is running 230 secs || 178718764 markings, 322872581 edges, 5543 markings/sec, 230 secs
lola: sara is running 235 secs || 178725148 markings, 322885351 edges, 1277 markings/sec, 235 secs
lola: sara is running 240 secs || 178755824 markings, 322946712 edges, 6135 markings/sec, 240 secs
lola: sara is running 245 secs || 178777141 markings, 322989350 edges, 4263 markings/sec, 245 secs
lola: sara is running 250 secs || 178804888 markings, 323044848 edges, 5549 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= NADH)))
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 84 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 6 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((b2 + 1 <= R5P)))
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 84 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: ========================================
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 GPPP-PT-C1000N0000001000-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= _1_3_BPG) AND (DHAP <= _2PG) AND (GSSG <= 1) AND (1 <= GSH))))
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 84 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 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FBP <= b2)))
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 84 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 GPPP-PT-C1000N0000001000-ReachabilityCardinality-8.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 9 will run for 436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= b2) AND (c2 + 1 <= NADPplus) AND (DHAP + 1 <= NADH) AND (G6P + 1 <= a2))))
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 84 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 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2880064 markings, 9660618 edges, 576013 markings/sec, 0 secs
lola: sara is running 5 secs || 5651671 markings, 19034821 edges, 554321 markings/sec, 5 secs
lola: sara is running 10 secs || 8414682 markings, 28379646 edges, 552602 markings/sec, 10 secs
lola: sara is running 15 secs || 11173970 markings, 37712045 edges, 551858 markings/sec, 15 secs
lola: sara is running 20 secs || 13264005 markings, 44781719 edges, 418007 markings/sec, 20 secs
lola: sara is running 25 secs || 15977764 markings, 53960069 edges, 542752 markings/sec, 25 secs
lola: sara is running 30 secs || 18746469 markings, 63324727 edges, 553741 markings/sec, 30 secs
lola: sara is running 35 secs || 21459203 markings, 72499993 edges, 542547 markings/sec, 35 secs
lola: sara is running 40 secs || 24156098 markings, 81620575 edges, 539379 markings/sec, 40 secs
lola: sara is running 45 secs || 26855842 markings, 90751864 edges, 539949 markings/sec, 45 secs
lola: sara is running 50 secs || 29182745 markings, 98621841 edges, 465381 markings/sec, 50 secs
lola: sara is running 55 secs || 31785177 markings, 107421006 edges, 520486 markings/sec, 55 secs
lola: sara is running 60 secs || 34065712 markings, 115502978 edges, 456107 markings/sec, 60 secs
lola: sara is running 65 secs || 35951779 markings, 122444105 edges, 377213 markings/sec, 65 secs
lola: sara is running 70 secs || 38203731 markings, 130804807 edges, 450390 markings/sec, 70 secs
lola: sara is running 75 secs || 40414972 markings, 139014262 edges, 442248 markings/sec, 75 secs
lola: sara is running 80 secs || 42671828 markings, 147393169 edges, 451371 markings/sec, 80 secs
lola: sara is running 85 secs || 44264552 markings, 153143291 edges, 318545 markings/sec, 85 secs
lola: sara is running 90 secs || 46351355 markings, 160929270 edges, 417361 markings/sec, 90 secs
lola: sara is running 95 secs || 48514659 markings, 169022517 edges, 432661 markings/sec, 95 secs
lola: sara is running 100 secs || 50623041 markings, 176914082 edges, 421676 markings/sec, 100 secs
lola: sara is running 105 secs || 52745292 markings, 184853618 edges, 424450 markings/sec, 105 secs
lola: sara is running 110 secs || 54854266 markings, 192747389 edges, 421795 markings/sec, 110 secs
lola: sara is running 115 secs || 57053424 markings, 200974798 edges, 439832 markings/sec, 115 secs
lola: sara is running 120 secs || 58976445 markings, 208011459 edges, 384604 markings/sec, 120 secs
lola: sara is running 125 secs || 60650828 markings, 214235900 edges, 334877 markings/sec, 125 secs
lola: sara is running 130 secs || 62411011 markings, 220844284 edges, 352037 markings/sec, 130 secs
lola: sara is running 135 secs || 64497303 markings, 228677010 edges, 417258 markings/sec, 135 secs
lola: sara is running 140 secs || 66566297 markings, 236440526 edges, 413799 markings/sec, 140 secs
lola: sara is running 145 secs || 68601196 markings, 244080270 edges, 406980 markings/sec, 145 secs
lola: sara is running 150 secs || 70680073 markings, 251880831 edges, 415775 markings/sec, 150 secs
lola: sara is running 155 secs || 72771491 markings, 259732828 edges, 418284 markings/sec, 155 secs
lola: sara is running 160 secs || 74974530 markings, 267999518 edges, 440608 markings/sec, 160 secs
lola: sara is running 165 secs || 77171070 markings, 276246162 edges, 439308 markings/sec, 165 secs
lola: sara is running 170 secs || 79314230 markings, 284142921 edges, 428632 markings/sec, 170 secs
lola: sara is running 175 secs || 81357052 markings, 291349486 edges, 408564 markings/sec, 175 secs
lola: sara is running 180 secs || 84127911 markings, 300708408 edges, 554172 markings/sec, 180 secs
lola: sara is running 185 secs || 86853459 markings, 309913971 edges, 545110 markings/sec, 185 secs
lola: sara is running 190 secs || 89583126 markings, 319133654 edges, 545933 markings/sec, 190 secs
lola: sara is running 195 secs || 92271970 markings, 328215920 edges, 537769 markings/sec, 195 secs
lola: sara is running 200 secs || 94974995 markings, 337345263 edges, 540605 markings/sec, 200 secs
lola: sara is running 205 secs || 97685984 markings, 346501762 edges, 542198 markings/sec, 205 secs
lola: sara is running 210 secs || 100357017 markings, 355523404 edges, 534207 markings/sec, 210 secs
lola: sara is running 215 secs || 103044004 markings, 364599602 edges, 537397 markings/sec, 215 secs
lola: sara is running 220 secs || 105683448 markings, 373580538 edges, 527889 markings/sec, 220 secs
lola: sara is running 225 secs || 107961394 markings, 381678901 edges, 455589 markings/sec, 225 secs
lola: sara is running 230 secs || 110086738 markings, 389442583 edges, 425069 markings/sec, 230 secs
lola: sara is running 235 secs || 112116356 markings, 397075339 edges, 405924 markings/sec, 235 secs
lola: sara is running 240 secs || 114112872 markings, 404583555 edges, 399303 markings/sec, 240 secs
lola: sara is running 245 secs || 116275631 markings, 412494373 edges, 432552 markings/sec, 245 secs
lola: sara is running 250 secs || 118585943 markings, 420691295 edges, 462062 markings/sec, 250 secs
lola: sara is running 255 secs || 120872014 markings, 428818493 edges, 457214 markings/sec, 255 secs
lola: sara is running 260 secs || 123039167 markings, 436710746 edges, 433431 markings/sec, 260 secs
lola: sara is running 265 secs || 125128048 markings, 444566318 edges, 417776 markings/sec, 265 secs
lola: sara is running 270 secs || 127171951 markings, 452252774 edges, 408781 markings/sec, 270 secs
lola: sara is running 275 secs || 129369454 markings, 460285159 edges, 439501 markings/sec, 275 secs
lola: sara is running 280 secs || 131705796 markings, 468574834 edges, 467268 markings/sec, 280 secs
lola: sara is running 285 secs || 133994755 markings, 476712252 edges, 457792 markings/sec, 285 secs
lola: sara is running 290 secs || 136199946 markings, 484762432 edges, 441038 markings/sec, 290 secs
lola: sara is running 295 secs || 138302436 markings, 492669204 edges, 420498 markings/sec, 295 secs
lola: sara is running 300 secs || 140400062 markings, 500557714 edges, 419525 markings/sec, 300 secs
lola: sara is running 305 secs || 142554016 markings, 508398141 edges, 430791 markings/sec, 305 secs
lola: sara is running 310 secs || 144460625 markings, 515160585 edges, 381322 markings/sec, 310 secs
lola: sara is running 315 secs || 146856915 markings, 523679604 edges, 479258 markings/sec, 315 secs
lola: sara is running 320 secs || 149162668 markings, 532069262 edges, 461151 markings/sec, 320 secs
lola: sara is running 325 secs || 151363066 markings, 540344280 edges, 440080 markings/sec, 325 secs
lola: sara is running 330 secs || 153545233 markings, 548550672 edges, 436433 markings/sec, 330 secs
lola: sara is running 335 secs || 155870068 markings, 556978113 edges, 464967 markings/sec, 335 secs
lola: sara is running 340 secs || 158508518 markings, 565435409 edges, 527690 markings/sec, 340 secs
lola: sara is running 345 secs || 160648614 markings, 572543697 edges, 428019 markings/sec, 345 secs
lola: sara is running 350 secs || 162981669 markings, 580856537 edges, 466611 markings/sec, 350 secs
lola: sara is running 355 secs || 165250862 markings, 588980634 edges, 453839 markings/sec, 355 secs
lola: sara is running 360 secs || 167390119 markings, 597034524 edges, 427851 markings/sec, 360 secs
lola: sara is running 365 secs || 169494028 markings, 604955238 edges, 420782 markings/sec, 365 secs
lola: sara is running 370 secs || 171582968 markings, 612819670 edges, 417788 markings/sec, 370 secs
lola: sara is running 375 secs || 173814721 markings, 620967331 edges, 446351 markings/sec, 375 secs
lola: sara is running 380 secs || 176152317 markings, 629287149 edges, 467519 markings/sec, 380 secs
lola: sara is running 385 secs || 178385272 markings, 637233637 edges, 446591 markings/sec, 385 secs
lola: sara is running 390 secs || 180277533 markings, 643975891 edges, 378452 markings/sec, 390 secs
lola: sara is running 395 secs || 181679124 markings, 649098891 edges, 280318 markings/sec, 395 secs
lola: sara is running 400 secs || 181682604 markings, 649112003 edges, 696 markings/sec, 400 secs
lola: sara is running 405 secs || 181682680 markings, 649112287 edges, 15 markings/sec, 405 secs
lola: sara is running 410 secs || 181682738 markings, 649112510 edges, 12 markings/sec, 410 secs
lola: sara is running 415 secs || 181692710 markings, 649150084 edges, 1994 markings/sec, 415 secs
lola: sara is running 420 secs || 181705406 markings, 649197843 edges, 2539 markings/sec, 420 secs
lola: sara is running 425 secs || 181708340 markings, 649208913 edges, 587 markings/sec, 425 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FBP + 1 <= Lac)))
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 84 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 11 will run for 523 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= Gluc) OR (c1 <= GAP) OR (NADH <= DHAP) OR ((c1 <= GSH) AND (start <= Pi) AND (b1 <= 0)))))
lola: ========================================
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 84 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 GPPP-PT-C1000N0000001000-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: ========================================
state equation: calling and running sara
lola: subprocess 12 will run for 654 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NADplus <= DHAP) OR (_3PG <= NADplus) OR (2 <= Ru5P) OR ((GSH + 1 <= b1) AND ((a2 <= R5P) OR (1 <= b1))))))
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 84 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 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-11.sara.
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2716735 markings, 7124803 edges, 543347 markings/sec, 0 secs
lola: sara is running 5 secs || 5109484 markings, 14529151 edges, 478550 markings/sec, 5 secs
lola: sara is running 10 secs || 8202322 markings, 22209553 edges, 618568 markings/sec, 10 secs
lola: sara is running 15 secs || 11298148 markings, 29884467 edges, 619165 markings/sec, 15 secs
lola: sara is running 20 secs || 14369652 markings, 37511613 edges, 614301 markings/sec, 20 secs
lola: sara is running 25 secs || 17419658 markings, 45095321 edges, 610001 markings/sec, 25 secs
lola: sara is running 30 secs || 20498924 markings, 52740652 edges, 615853 markings/sec, 30 secs
lola: sara is running 35 secs || 23629388 markings, 60540383 edges, 626093 markings/sec, 35 secs
lola: sara is running 40 secs || 26712933 markings, 68178227 edges, 616709 markings/sec, 40 secs
lola: sara is running 45 secs || 29799968 markings, 75839108 edges, 617407 markings/sec, 45 secs
lola: sara is running 50 secs || 32841794 markings, 83393417 edges, 608365 markings/sec, 50 secs
lola: sara is running 55 secs || 35867714 markings, 90897055 edges, 605184 markings/sec, 55 secs
lola: sara is running 60 secs || 38888242 markings, 98416787 edges, 604106 markings/sec, 60 secs
lola: sara is running 65 secs || 41972193 markings, 106056100 edges, 616790 markings/sec, 65 secs
lola: sara is running 70 secs || 44592139 markings, 112601652 edges, 523989 markings/sec, 70 secs
lola: sara is running 75 secs || 47510644 markings, 119831267 edges, 583701 markings/sec, 75 secs
lola: sara is running 80 secs || 50503650 markings, 127257677 edges, 598601 markings/sec, 80 secs
lola: sara is running 85 secs || 53491016 markings, 134684651 edges, 597473 markings/sec, 85 secs
lola: sara is running 90 secs || 56498977 markings, 142134348 edges, 601592 markings/sec, 90 secs
lola: sara is running 95 secs || 59482212 markings, 149553284 edges, 596647 markings/sec, 95 secs
lola: sara is running 100 secs || 62434778 markings, 156916371 edges, 590513 markings/sec, 100 secs
lola: sara is running 105 secs || 65394569 markings, 164246024 edges, 591958 markings/sec, 105 secs
lola: sara is running 110 secs || 68378812 markings, 171656309 edges, 596849 markings/sec, 110 secs
lola: sara is running 115 secs || 71360346 markings, 179078480 edges, 596307 markings/sec, 115 secs
lola: sara is running 120 secs || 74339543 markings, 186464854 edges, 595839 markings/sec, 120 secs
lola: sara is running 125 secs || 77297006 markings, 193811871 edges, 591493 markings/sec, 125 secs
lola: sara is running 130 secs || 80257403 markings, 201161371 edges, 592079 markings/sec, 130 secs
lola: sara is running 135 secs || 83189763 markings, 208436502 edges, 586472 markings/sec, 135 secs
lola: sara is running 140 secs || 86167113 markings, 215843905 edges, 595470 markings/sec, 140 secs
lola: sara is running 145 secs || 89134306 markings, 223205643 edges, 593439 markings/sec, 145 secs
lola: sara is running 150 secs || 92086558 markings, 230528735 edges, 590450 markings/sec, 150 secs
lola: sara is running 155 secs || 95010359 markings, 237815140 edges, 584760 markings/sec, 155 secs
lola: sara is running 160 secs || 97923933 markings, 245066745 edges, 582715 markings/sec, 160 secs
lola: sara is running 165 secs || 100854765 markings, 252315873 edges, 586166 markings/sec, 165 secs
lola: sara is running 170 secs || 103365612 markings, 258546005 edges, 502169 markings/sec, 170 secs
lola: sara is running 175 secs || 106202962 markings, 265598701 edges, 567470 markings/sec, 175 secs
lola: sara is running 180 secs || 109178164 markings, 273019705 edges, 595040 markings/sec, 180 secs
lola: sara is running 185 secs || 112099608 markings, 280266347 edges, 584289 markings/sec, 185 secs
lola: sara is running 190 secs || 115032187 markings, 287509142 edges, 586516 markings/sec, 190 secs
lola: sara is running 195 secs || 117926503 markings, 294730423 edges, 578863 markings/sec, 195 secs
lola: sara is running 200 secs || 120823762 markings, 301970492 edges, 579452 markings/sec, 200 secs
lola: sara is running 205 secs || 123759229 markings, 309223709 edges, 587093 markings/sec, 205 secs
lola: sara is running 210 secs || 126719147 markings, 316618802 edges, 591984 markings/sec, 210 secs
lola: sara is running 215 secs || 129672853 markings, 323908477 edges, 590741 markings/sec, 215 secs
lola: sara is running 220 secs || 132606201 markings, 331168950 edges, 586670 markings/sec, 220 secs
lola: sara is running 225 secs || 135515952 markings, 338390920 edges, 581950 markings/sec, 225 secs
lola: sara is running 230 secs || 138434777 markings, 345650212 edges, 583765 markings/sec, 230 secs
lola: sara is running 235 secs || 141364003 markings, 352911042 edges, 585845 markings/sec, 235 secs
lola: sara is running 240 secs || 144290587 markings, 360200051 edges, 585317 markings/sec, 240 secs
lola: sara is running 245 secs || 147194417 markings, 367425734 edges, 580766 markings/sec, 245 secs
lola: sara is running 250 secs || 150168853 markings, 374805222 edges, 594887 markings/sec, 250 secs
lola: sara is running 255 secs || 153147480 markings, 382266211 edges, 595725 markings/sec, 255 secs
lola: sara is running 260 secs || 156170026 markings, 389689075 edges, 604509 markings/sec, 260 secs
lola: sara is running 265 secs || 159127171 markings, 397065184 edges, 591429 markings/sec, 265 secs
lola: sara is running 270 secs || 162088938 markings, 404415567 edges, 592353 markings/sec, 270 secs
lola: sara is running 275 secs || 165000706 markings, 411669831 edges, 582354 markings/sec, 275 secs
lola: sara is running 280 secs || 167918542 markings, 418901953 edges, 583567 markings/sec, 280 secs
lola: sara is running 285 secs || 170855568 markings, 426185276 edges, 587405 markings/sec, 285 secs
lola: sara is running 290 secs || 173782542 markings, 433432549 edges, 585395 markings/sec, 290 secs
lola: sara is running 295 secs || 176694564 markings, 440688279 edges, 582404 markings/sec, 295 secs
lola: sara is running 300 secs || 179603159 markings, 447904707 edges, 581719 markings/sec, 300 secs
lola: sara is running 305 secs || 182525658 markings, 455145235 edges, 584500 markings/sec, 305 secs
lola: sara is running 310 secs || 185448354 markings, 462423736 edges, 584539 markings/sec, 310 secs
lola: sara is running 315 secs || 188361791 markings, 469687853 edges, 582687 markings/sec, 315 secs
lola: sara is running 320 secs || 188908644 markings, 470998890 edges, 109371 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 762 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((_2PG <= c2) AND (1 <= _1_3_BPG) AND (GSSG + 1 <= GSH) AND (NADH <= 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 84 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 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1143 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((_1_3_BPG <= 2) OR ((2 <= R5P)) OR (b2 + 1 <= Lac) OR (c1 + 1 <= F6P))))
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 84 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 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-14.sara
lola: The predicate is not invariant.
lola: subprocess 15 will run for 2287 seconds at most (--localtimelimit=-1)
lola: lola: state equation: calling and running sara
========================================
lola: ...considering subproblem: A (G (((E4P <= 1) OR ((R5P <= Ru5P) AND (a2 <= ADP) AND (_1_3_BPG <= ATP)))))
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 84 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: lola: ========================================
========================================
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-14.sara.sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-15.sara.
try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-13.sara.
sara: sara: place or transition ordering is non-deterministicsara: place or transition ordering is non-deterministic
place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2840635 markings, 10391280 edges, 568127 markings/sec, 0 secs
lola: sara is running 5 secs || 5837309 markings, 20036424 edges, 599335 markings/sec, 5 secs
lola: sara is running 10 secs || 8219493 markings, 29806865 edges, 476437 markings/sec, 10 secs
lola: sara is running 15 secs || 10333001 markings, 39589596 edges, 422702 markings/sec, 15 secs
lola: sara is running 20 secs || 12196733 markings, 47532982 edges, 372746 markings/sec, 20 secs
lola: sara is running 25 secs || 14396765 markings, 56433826 edges, 440006 markings/sec, 25 secs
lola: sara is running 30 secs || 16790757 markings, 65685816 edges, 478798 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no yes no unknown yes yes yes no unknown yes no unknown yes no yes
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494728512372
--------------------
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="GPPP-PT-C1000N0000001000"
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/GPPP-PT-C1000N0000001000.tgz
mv GPPP-PT-C1000N0000001000 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 GPPP-PT-C1000N0000001000, 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 r028-blw3-149440264500592"
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 '
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 ;