Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_GPPP-PT-C1000N0000001000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600592
=====================================================================

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


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_GPPP-PT-C1000N0000001000: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_GPPP-PT-C1000N0000001000: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_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 || 2937402 markings, 6792096 edges, 587480 markings/sec, 0 secs
lola: sara is running 5 secs || 5707863 markings, 13346778 edges, 554092 markings/sec, 5 secs
lola: sara is running 10 secs || 8340003 markings, 19599536 edges, 526428 markings/sec, 10 secs
lola: sara is running 15 secs || 10858123 markings, 25618616 edges, 503624 markings/sec, 15 secs
lola: sara is running 20 secs || 13326579 markings, 31514973 edges, 493691 markings/sec, 20 secs
lola: sara is running 25 secs || 15672426 markings, 37168288 edges, 469169 markings/sec, 25 secs
lola: sara is running 30 secs || 18117189 markings, 43037334 edges, 488953 markings/sec, 30 secs
lola: sara is running 35 secs || 20542804 markings, 48858059 edges, 485123 markings/sec, 35 secs
lola: sara is running 40 secs || 22987987 markings, 54756080 edges, 489037 markings/sec, 40 secs
lola: sara is running 45 secs || 25362621 markings, 60482270 edges, 474927 markings/sec, 45 secs
lola: sara is running 50 secs || 27700385 markings, 66123449 edges, 467553 markings/sec, 50 secs
lola: sara is running 55 secs || 29957633 markings, 71566120 edges, 451450 markings/sec, 55 secs
lola: sara is running 60 secs || 32316399 markings, 77253013 edges, 471753 markings/sec, 60 secs
lola: sara is running 65 secs || 34642659 markings, 82856453 edges, 465252 markings/sec, 65 secs
lola: sara is running 70 secs || 36974951 markings, 88490975 edges, 466458 markings/sec, 70 secs
lola: sara is running 75 secs || 39111789 markings, 93704136 edges, 427368 markings/sec, 75 secs
lola: sara is running 80 secs || 41374746 markings, 99165656 edges, 452591 markings/sec, 80 secs
lola: sara is running 85 secs || 43676870 markings, 104708430 edges, 460425 markings/sec, 85 secs
lola: sara is running 90 secs || 45849117 markings, 110012591 edges, 434449 markings/sec, 90 secs
lola: sara is running 95 secs || 48009500 markings, 115231566 edges, 432077 markings/sec, 95 secs
lola: sara is running 100 secs || 50293280 markings, 120730808 edges, 456756 markings/sec, 100 secs
lola: sara is running 105 secs || 52399243 markings, 125887692 edges, 421193 markings/sec, 105 secs
lola: sara is running 110 secs || 54527008 markings, 131008848 edges, 425553 markings/sec, 110 secs
lola: sara is running 115 secs || 56558957 markings, 135976939 edges, 406390 markings/sec, 115 secs
lola: sara is running 120 secs || 58683441 markings, 141100635 edges, 424897 markings/sec, 120 secs
lola: sara is running 125 secs || 60763457 markings, 146172956 edges, 416003 markings/sec, 125 secs
lola: sara is running 130 secs || 62858884 markings, 151237323 edges, 419085 markings/sec, 130 secs
lola: sara is running 135 secs || 64986423 markings, 156423394 edges, 425508 markings/sec, 135 secs
lola: sara is running 140 secs || 67138968 markings, 161628858 edges, 430509 markings/sec, 140 secs
lola: sara is running 145 secs || 69292152 markings, 166880503 edges, 430637 markings/sec, 145 secs
lola: sara is running 150 secs || 71572115 markings, 172391283 edges, 455993 markings/sec, 150 secs
lola: sara is running 155 secs || 73750867 markings, 177716326 edges, 435750 markings/sec, 155 secs
lola: sara is running 160 secs || 76033142 markings, 183227823 edges, 456455 markings/sec, 160 secs
lola: sara is running 165 secs || 78245627 markings, 188641222 edges, 442497 markings/sec, 165 secs
lola: sara is running 170 secs || 80603713 markings, 194333399 edges, 471617 markings/sec, 170 secs
lola: sara is running 175 secs || 82773095 markings, 199650895 edges, 433876 markings/sec, 175 secs
lola: sara is running 180 secs || 85115490 markings, 205287178 edges, 468479 markings/sec, 180 secs
lola: sara is running 185 secs || 87287525 markings, 210620795 edges, 434407 markings/sec, 185 secs
lola: sara is running 190 secs || 89664972 markings, 216338699 edges, 475489 markings/sec, 190 secs
lola: sara is running 195 secs || 91819000 markings, 221631728 edges, 430806 markings/sec, 195 secs
lola: sara is running 200 secs || 94073089 markings, 227129261 edges, 450818 markings/sec, 200 secs
lola: sara is running 205 secs || 96306393 markings, 232529968 edges, 446661 markings/sec, 205 secs
lola: sara is running 210 secs || 98439664 markings, 237762792 edges, 426654 markings/sec, 210 secs
lola: sara is running 215 secs || 100787484 markings, 243406751 edges, 469564 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.
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: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
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: sara: ========================================try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-2.sara.
lola:
...considering subproblem: E (F (((3 <= start) AND ((b2 <= 2) OR (S7P + 1 <= a1)))))
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 equation: calling and running sara
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
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-4.sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-3.sara.

sara: place or transition ordering is non-deterministic
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 || 4443659 markings, 8857263 edges, 888732 markings/sec, 0 secs
lola: sara is running 5 secs || 8667707 markings, 17305358 edges, 844810 markings/sec, 5 secs
lola: sara is running 10 secs || 13838225 markings, 25700958 edges, 1034104 markings/sec, 10 secs
lola: sara is running 15 secs || 18387869 markings, 32980389 edges, 909929 markings/sec, 15 secs
lola: sara is running 20 secs || 22846509 markings, 40114213 edges, 891728 markings/sec, 20 secs
lola: sara is running 25 secs || 26445841 markings, 46863645 edges, 719866 markings/sec, 25 secs
lola: sara is running 30 secs || 29302731 markings, 52577425 edges, 571378 markings/sec, 30 secs
lola: sara is running 35 secs || 33484316 markings, 60933609 edges, 836317 markings/sec, 35 secs
lola: sara is running 40 secs || 37520722 markings, 69006421 edges, 807281 markings/sec, 40 secs
lola: sara is running 45 secs || 41359950 markings, 76684876 edges, 767846 markings/sec, 45 secs
lola: sara is running 50 secs || 45119914 markings, 84204804 edges, 751993 markings/sec, 50 secs
lola: sara is running 55 secs || 49158123 markings, 91766248 edges, 807642 markings/sec, 55 secs
lola: sara is running 60 secs || 53498512 markings, 98710871 edges, 868078 markings/sec, 60 secs
lola: sara is running 65 secs || 57583939 markings, 105247556 edges, 817085 markings/sec, 65 secs
lola: sara is running 70 secs || 60994413 markings, 110704314 edges, 682095 markings/sec, 70 secs
lola: sara is running 75 secs || 64888161 markings, 117307477 edges, 778750 markings/sec, 75 secs
lola: sara is running 80 secs || 68529378 markings, 123859606 edges, 728243 markings/sec, 80 secs
lola: sara is running 85 secs || 72128329 markings, 130355027 edges, 719790 markings/sec, 85 secs
lola: sara is running 90 secs || 75751694 markings, 136886581 edges, 724673 markings/sec, 90 secs
lola: sara is running 95 secs || 79402922 markings, 143473747 edges, 730246 markings/sec, 95 secs
lola: sara is running 100 secs || 83060618 markings, 150088140 edges, 731539 markings/sec, 100 secs
lola: sara is running 105 secs || 86669716 markings, 156593447 edges, 721820 markings/sec, 105 secs
lola: sara is running 110 secs || 90427382 markings, 163371348 edges, 751533 markings/sec, 110 secs
lola: sara is running 115 secs || 94219038 markings, 170197683 edges, 758331 markings/sec, 115 secs
lola: sara is running 120 secs || 97998788 markings, 177027108 edges, 755950 markings/sec, 120 secs
lola: sara is running 125 secs || 101719067 markings, 183733278 edges, 744056 markings/sec, 125 secs
lola: sara is running 130 secs || 105501768 markings, 190557125 edges, 756540 markings/sec, 130 secs
lola: sara is running 135 secs || 109246343 markings, 197334340 edges, 748915 markings/sec, 135 secs
lola: sara is running 140 secs || 113040958 markings, 204196986 edges, 758923 markings/sec, 140 secs
lola: sara is running 145 secs || 116729746 markings, 210828448 edges, 737758 markings/sec, 145 secs
lola: sara is running 150 secs || 120385970 markings, 217460087 edges, 731245 markings/sec, 150 secs
lola: sara is running 155 secs || 124129890 markings, 224259479 edges, 748784 markings/sec, 155 secs
lola: sara is running 160 secs || 127939282 markings, 231136569 edges, 761878 markings/sec, 160 secs
lola: sara is running 165 secs || 131672734 markings, 237884997 edges, 746690 markings/sec, 165 secs
lola: sara is running 170 secs || 135434672 markings, 244636056 edges, 752388 markings/sec, 170 secs
lola: sara is running 175 secs || 139136060 markings, 251319744 edges, 740278 markings/sec, 175 secs
lola: sara is running 180 secs || 142903485 markings, 258148921 edges, 753485 markings/sec, 180 secs
lola: sara is running 185 secs || 146666449 markings, 264895820 edges, 752593 markings/sec, 185 secs
lola: sara is running 190 secs || 149558712 markings, 270105798 edges, 578453 markings/sec, 190 secs
lola: sara is running 195 secs || 153298394 markings, 276960565 edges, 747936 markings/sec, 195 secs
lola: sara is running 200 secs || 157045353 markings, 283702193 edges, 749392 markings/sec, 200 secs
lola: sara is running 205 secs || 160820784 markings, 290463666 edges, 755086 markings/sec, 205 secs
lola: sara is running 210 secs || 164515285 markings, 297203823 edges, 738900 markings/sec, 210 secs
lola: sara is running 215 secs || 168315701 markings, 304064106 edges, 760083 markings/sec, 215 secs
lola: sara is running 220 secs || 172145876 markings, 310954267 edges, 766035 markings/sec, 220 secs
lola: sara is running 225 secs || 175913532 markings, 317792529 edges, 753531 markings/sec, 225 secs
lola: sara is running 230 secs || 178665660 markings, 322766363 edges, 550426 markings/sec, 230 secs
lola: sara is running 235 secs || 178673321 markings, 322781689 edges, 1532 markings/sec, 235 secs
lola: sara is running 240 secs || 178673434 markings, 322781915 edges, 23 markings/sec, 240 secs
lola: sara is running 245 secs || 178716513 markings, 322868081 edges, 8616 markings/sec, 245 secs
lola: sara is running 250 secs || 178760154 markings, 322955374 edges, 8728 markings/sec, 250 secs
lola: sara is running 255 secs || 178771530 markings, 322978128 edges, 2275 markings/sec, 255 secs
lola: sara is running 260 secs || 178808082 markings, 323051238 edges, 7310 markings/sec, 260 secs
lola: sara is running 265 secs || 178813154 markings, 323061383 edges, 1014 markings/sec, 265 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 276 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 304 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: 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: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-5.sara
lola: state equation: calling and running 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: ========================================
lola: subprocess 7 will run for 338 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 380 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
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-5.sara.
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
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 9 will run for 434 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 || 2786877 markings, 9345223 edges, 557375 markings/sec, 0 secs
lola: sara is running 5 secs || 5477046 markings, 18443723 edges, 538034 markings/sec, 5 secs
lola: sara is running 10 secs || 8142662 markings, 27459566 edges, 533123 markings/sec, 10 secs
lola: sara is running 15 secs || 10821276 markings, 36519113 edges, 535723 markings/sec, 15 secs
lola: sara is running 20 secs || 13465093 markings, 45462200 edges, 528763 markings/sec, 20 secs
lola: sara is running 25 secs || 16091572 markings, 54344780 edges, 525296 markings/sec, 25 secs
lola: sara is running 30 secs || 18756612 markings, 63358621 edges, 533008 markings/sec, 30 secs
lola: sara is running 35 secs || 21384465 markings, 72246292 edges, 525571 markings/sec, 35 secs
lola: sara is running 40 secs || 23955944 markings, 80944048 edges, 514296 markings/sec, 40 secs
lola: sara is running 45 secs || 26569642 markings, 89784155 edges, 522740 markings/sec, 45 secs
lola: sara is running 50 secs || 29169002 markings, 98575598 edges, 519872 markings/sec, 50 secs
lola: sara is running 55 secs || 31708237 markings, 107145860 edges, 507847 markings/sec, 55 secs
lola: sara is running 60 secs || 34000856 markings, 115281879 edges, 458524 markings/sec, 60 secs
lola: sara is running 65 secs || 35796559 markings, 121867604 edges, 359141 markings/sec, 65 secs
lola: sara is running 70 secs || 38082479 markings, 130354463 edges, 457184 markings/sec, 70 secs
lola: sara is running 75 secs || 40271192 markings, 138480277 edges, 437743 markings/sec, 75 secs
lola: sara is running 80 secs || 42508275 markings, 146785707 edges, 447417 markings/sec, 80 secs
lola: sara is running 85 secs || 44174398 markings, 152786604 edges, 333225 markings/sec, 85 secs
lola: sara is running 90 secs || 46168387 markings, 160244452 edges, 398798 markings/sec, 90 secs
lola: sara is running 95 secs || 48337691 markings, 168360131 edges, 433861 markings/sec, 95 secs
lola: sara is running 100 secs || 50467832 markings, 176333123 edges, 426028 markings/sec, 100 secs
lola: sara is running 105 secs || 52578257 markings, 184228441 edges, 422085 markings/sec, 105 secs
lola: sara is running 110 secs || 54694875 markings, 192150826 edges, 423324 markings/sec, 110 secs
lola: sara is running 115 secs || 56872540 markings, 200297781 edges, 435533 markings/sec, 115 secs
lola: sara is running 120 secs || 58810464 markings, 207406094 edges, 387585 markings/sec, 120 secs
lola: sara is running 125 secs || 60204626 markings, 212560722 edges, 278832 markings/sec, 125 secs
lola: sara is running 130 secs || 62315335 markings, 220485065 edges, 422142 markings/sec, 130 secs
lola: sara is running 135 secs || 64327545 markings, 228039685 edges, 402442 markings/sec, 135 secs
lola: sara is running 140 secs || 66278363 markings, 235359505 edges, 390164 markings/sec, 140 secs
lola: sara is running 145 secs || 68198727 markings, 242569267 edges, 384073 markings/sec, 145 secs
lola: sara is running 150 secs || 70187520 markings, 250031586 edges, 397759 markings/sec, 150 secs
lola: sara is running 155 secs || 72269195 markings, 257846974 edges, 416335 markings/sec, 155 secs
lola: sara is running 160 secs || 74261846 markings, 265323816 edges, 398530 markings/sec, 160 secs
lola: sara is running 165 secs || 76408180 markings, 273381976 edges, 429267 markings/sec, 165 secs
lola: sara is running 170 secs || 78536348 markings, 281371943 edges, 425634 markings/sec, 170 secs
lola: sara is running 175 secs || 80233578 markings, 287495506 edges, 339446 markings/sec, 175 secs
lola: sara is running 180 secs || 82877698 markings, 296485554 edges, 528824 markings/sec, 180 secs
lola: sara is running 185 secs || 85599409 markings, 305678570 edges, 544342 markings/sec, 185 secs
lola: sara is running 190 secs || 88347306 markings, 314960380 edges, 549579 markings/sec, 190 secs
lola: sara is running 195 secs || 90339514 markings, 321688857 edges, 398442 markings/sec, 195 secs
lola: sara is running 200 secs || 93036673 markings, 330798331 edges, 539432 markings/sec, 200 secs
lola: sara is running 205 secs || 95696775 markings, 339783277 edges, 532020 markings/sec, 205 secs
lola: sara is running 210 secs || 98392847 markings, 348889703 edges, 539214 markings/sec, 210 secs
lola: sara is running 215 secs || 101033074 markings, 357806954 edges, 528045 markings/sec, 215 secs
lola: sara is running 220 secs || 103708841 markings, 366844585 edges, 535153 markings/sec, 220 secs
lola: sara is running 225 secs || 106215259 markings, 375471200 edges, 501284 markings/sec, 225 secs
lola: sara is running 230 secs || 108518734 markings, 383660276 edges, 460695 markings/sec, 230 secs
lola: sara is running 235 secs || 110689843 markings, 391710673 edges, 434222 markings/sec, 235 secs
lola: sara is running 240 secs || 112804224 markings, 399662141 edges, 422876 markings/sec, 240 secs
lola: sara is running 245 secs || 114885304 markings, 407488408 edges, 416216 markings/sec, 245 secs
lola: sara is running 250 secs || 117202292 markings, 415785071 edges, 463398 markings/sec, 250 secs
lola: sara is running 255 secs || 119533950 markings, 424061608 edges, 466332 markings/sec, 255 secs
lola: sara is running 260 secs || 121767072 markings, 432000483 edges, 446624 markings/sec, 260 secs
lola: sara is running 265 secs || 123852426 markings, 439769153 edges, 417071 markings/sec, 265 secs
lola: sara is running 270 secs || 125917688 markings, 447535932 edges, 413052 markings/sec, 270 secs
lola: sara is running 275 secs || 127938852 markings, 455136843 edges, 404233 markings/sec, 275 secs
lola: sara is running 280 secs || 130214809 markings, 463287085 edges, 455191 markings/sec, 280 secs
lola: sara is running 285 secs || 132516414 markings, 471456595 edges, 460321 markings/sec, 285 secs
lola: sara is running 290 secs || 134766031 markings, 479454214 edges, 449923 markings/sec, 290 secs
lola: sara is running 295 secs || 136894432 markings, 487374130 edges, 425680 markings/sec, 295 secs
lola: sara is running 300 secs || 138994490 markings, 495271781 edges, 420012 markings/sec, 300 secs
lola: sara is running 305 secs || 141041458 markings, 502969746 edges, 409394 markings/sec, 305 secs
lola: sara is running 310 secs || 143247939 markings, 510862393 edges, 441296 markings/sec, 310 secs
lola: sara is running 315 secs || 145506555 markings, 518878965 edges, 451723 markings/sec, 315 secs
lola: sara is running 320 secs || 147798454 markings, 527026873 edges, 458380 markings/sec, 320 secs
lola: sara is running 325 secs || 149997948 markings, 535210472 edges, 439899 markings/sec, 325 secs
lola: sara is running 330 secs || 152165204 markings, 543360825 edges, 433451 markings/sec, 330 secs
lola: sara is running 335 secs || 154283966 markings, 551328813 edges, 423752 markings/sec, 335 secs
lola: sara is running 340 secs || 156637337 markings, 559702729 edges, 470674 markings/sec, 340 secs
lola: sara is running 345 secs || 158989658 markings, 567206686 edges, 470464 markings/sec, 345 secs
lola: sara is running 350 secs || 161211954 markings, 574550879 edges, 444459 markings/sec, 350 secs
lola: sara is running 355 secs || 163513836 markings, 582752627 edges, 460376 markings/sec, 355 secs
lola: sara is running 360 secs || 165726824 markings, 590772561 edges, 442598 markings/sec, 360 secs
lola: sara is running 365 secs || 167791290 markings, 598544824 edges, 412893 markings/sec, 365 secs
lola: sara is running 370 secs || 169829904 markings, 606219727 edges, 407723 markings/sec, 370 secs
lola: sara is running 375 secs || 171830721 markings, 613752375 edges, 400163 markings/sec, 375 secs
lola: sara is running 380 secs || 174012328 markings, 621670647 edges, 436321 markings/sec, 380 secs
lola: sara is running 385 secs || 176230892 markings, 629566840 edges, 443713 markings/sec, 385 secs
lola: sara is running 390 secs || 178369672 markings, 637178073 edges, 427756 markings/sec, 390 secs
lola: sara is running 395 secs || 180489764 markings, 644732070 edges, 424018 markings/sec, 395 secs
lola: sara is running 400 secs || 181706756 markings, 649202955 edges, 243398 markings/sec, 400 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 439 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 526 seconds at most (--localtimelimit=-1)
lola: ========================================
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: 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: subprocess 12 will run for 658 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-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2734803 markings, 7165585 edges, 546961 markings/sec, 0 secs
lola: sara is running 5 secs || 5130055 markings, 14579200 edges, 479050 markings/sec, 5 secs
lola: sara is running 10 secs || 8226854 markings, 22266316 edges, 619360 markings/sec, 10 secs
lola: sara is running 15 secs || 11351569 markings, 30024915 edges, 624943 markings/sec, 15 secs
lola: sara is running 20 secs || 14400085 markings, 37605267 edges, 609703 markings/sec, 20 secs
lola: sara is running 25 secs || 17490134 markings, 45269517 edges, 618010 markings/sec, 25 secs
lola: sara is running 30 secs || 20585817 markings, 52975590 edges, 619137 markings/sec, 30 secs
lola: sara is running 35 secs || 23738911 markings, 60780583 edges, 630619 markings/sec, 35 secs
lola: sara is running 40 secs || 26843903 markings, 68500342 edges, 620998 markings/sec, 40 secs
lola: sara is running 45 secs || 29915446 markings, 76128749 edges, 614309 markings/sec, 45 secs
lola: sara is running 50 secs || 32947565 markings, 83659977 edges, 606424 markings/sec, 50 secs
lola: sara is running 55 secs || 35968051 markings, 91161807 edges, 604097 markings/sec, 55 secs
lola: sara is running 60 secs || 38961171 markings, 98597034 edges, 598624 markings/sec, 60 secs
lola: sara is running 65 secs || 42009109 markings, 106187358 edges, 609588 markings/sec, 65 secs
lola: sara is running 70 secs || 45046687 markings, 113710865 edges, 607516 markings/sec, 70 secs
lola: sara is running 75 secs || 48085259 markings, 121253856 edges, 607714 markings/sec, 75 secs
lola: sara is running 80 secs || 51093081 markings, 128727766 edges, 601564 markings/sec, 80 secs
lola: sara is running 85 secs || 54101168 markings, 136216941 edges, 601617 markings/sec, 85 secs
lola: sara is running 90 secs || 57094252 markings, 143634415 edges, 598617 markings/sec, 90 secs
lola: sara is running 95 secs || 60081382 markings, 151047542 edges, 597426 markings/sec, 95 secs
lola: sara is running 100 secs || 63078570 markings, 158476916 edges, 599438 markings/sec, 100 secs
lola: sara is running 105 secs || 66035734 markings, 165842907 edges, 591433 markings/sec, 105 secs
lola: sara is running 110 secs || 69038732 markings, 173293830 edges, 600600 markings/sec, 110 secs
lola: sara is running 115 secs || 72059165 markings, 180800303 edges, 604087 markings/sec, 115 secs
lola: sara is running 120 secs || 75046233 markings, 188256201 edges, 597414 markings/sec, 120 secs
lola: sara is running 125 secs || 78065533 markings, 195715854 edges, 603860 markings/sec, 125 secs
lola: sara is running 130 secs || 81033686 markings, 203127937 edges, 593631 markings/sec, 130 secs
lola: sara is running 135 secs || 84017810 markings, 210480208 edges, 596825 markings/sec, 135 secs
lola: sara is running 140 secs || 86980845 markings, 217864945 edges, 592607 markings/sec, 140 secs
lola: sara is running 145 secs || 89946087 markings, 225231471 edges, 593048 markings/sec, 145 secs
lola: sara is running 150 secs || 92908465 markings, 232592447 edges, 592476 markings/sec, 150 secs
lola: sara is running 155 secs || 95868175 markings, 239940576 edges, 591942 markings/sec, 155 secs
lola: sara is running 160 secs || 98804867 markings, 247281827 edges, 587338 markings/sec, 160 secs
lola: sara is running 165 secs || 101749626 markings, 254555039 edges, 588952 markings/sec, 165 secs
lola: sara is running 170 secs || 104700595 markings, 261898811 edges, 590194 markings/sec, 170 secs
lola: sara is running 175 secs || 107713825 markings, 269363594 edges, 602646 markings/sec, 175 secs
lola: sara is running 180 secs || 110696163 markings, 276767612 edges, 596468 markings/sec, 180 secs
lola: sara is running 185 secs || 113669432 markings, 284142250 edges, 594654 markings/sec, 185 secs
lola: sara is running 190 secs || 116636527 markings, 291524125 edges, 593419 markings/sec, 190 secs
lola: sara is running 195 secs || 119585700 markings, 298849589 edges, 589835 markings/sec, 195 secs
lola: sara is running 200 secs || 122516841 markings, 306156166 edges, 586228 markings/sec, 200 secs
lola: sara is running 205 secs || 125485083 markings, 313510729 edges, 593648 markings/sec, 205 secs
lola: sara is running 210 secs || 128443009 markings, 320894355 edges, 591585 markings/sec, 210 secs
lola: sara is running 215 secs || 131413801 markings, 328230396 edges, 594158 markings/sec, 215 secs
lola: sara is running 220 secs || 134365938 markings, 335556817 edges, 590427 markings/sec, 220 secs
lola: sara is running 225 secs || 137290820 markings, 342808622 edges, 584976 markings/sec, 225 secs
lola: sara is running 230 secs || 140212835 markings, 350070169 edges, 584403 markings/sec, 230 secs
lola: sara is running 235 secs || 143126375 markings, 357330241 edges, 582708 markings/sec, 235 secs
lola: sara is running 240 secs || 146041270 markings, 364560363 edges, 582979 markings/sec, 240 secs
lola: sara is running 245 secs || 149012922 markings, 371943326 edges, 594330 markings/sec, 245 secs
lola: sara is running 250 secs || 151978362 markings, 379345260 edges, 593088 markings/sec, 250 secs
lola: sara is running 255 secs || 154983752 markings, 386744216 edges, 601078 markings/sec, 255 secs
lola: sara is running 260 secs || 157735068 markings, 393580449 edges, 550263 markings/sec, 260 secs
lola: sara is running 265 secs || 160710199 markings, 400998721 edges, 595026 markings/sec, 265 secs
lola: sara is running 270 secs || 163681582 markings, 408373380 edges, 594277 markings/sec, 270 secs
lola: sara is running 275 secs || 166630887 markings, 415693346 edges, 589861 markings/sec, 275 secs
lola: sara is running 280 secs || 169568842 markings, 423006445 edges, 587591 markings/sec, 280 secs
lola: sara is running 285 secs || 172516530 markings, 430298248 edges, 589538 markings/sec, 285 secs
lola: sara is running 290 secs || 175477971 markings, 437695474 edges, 592288 markings/sec, 290 secs
lola: sara is running 295 secs || 178422178 markings, 445051867 edges, 588841 markings/sec, 295 secs
lola: sara is running 300 secs || 181366472 markings, 452379332 edges, 588859 markings/sec, 300 secs
lola: sara is running 305 secs || 184310779 markings, 459681990 edges, 588861 markings/sec, 305 secs
lola: sara is running 310 secs || 187261371 markings, 466979275 edges, 590118 markings/sec, 310 secs
lola: sara is running 315 secs || 188944135 markings, 471124551 edges, 336553 markings/sec, 315 secs
lola: sara is running 320 secs || 188951832 markings, 471151911 edges, 1539 markings/sec, 320 secs
lola: sara is running 325 secs || 188966155 markings, 471204061 edges, 2865 markings/sec, 325 secs
lola: sara is running 330 secs || 188985274 markings, 471271970 edges, 3824 markings/sec, 330 secs
lola: sara is running 335 secs || 188993894 markings, 471303021 edges, 1724 markings/sec, 335 secs
lola: sara is running 340 secs || 189046807 markings, 471425407 edges, 10583 markings/sec, 340 secs
lola: sara is running 345 secs || 189053761 markings, 471434159 edges, 1391 markings/sec, 345 secs
lola: sara is running 350 secs || 189053842 markings, 471434322 edges, 16 markings/sec, 350 secs
lola: sara is running 355 secs || 189053916 markings, 471434469 edges, 15 markings/sec, 355 secs
lola: sara is running 360 secs || 189100194 markings, 471504679 edges, 9256 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 755 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: ========================================
lola: subprocess 14 will run for 1133 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: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2267 seconds at most (--localtimelimit=-1)
lola: ========================================
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: 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: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2862365 markings, 10463683 edges, 572473 markings/sec, 0 secs
lola: sara is running 5 secs || 5898822 markings, 20225356 edges, 607291 markings/sec, 5 secs
lola: sara is running 10 secs || 8279609 markings, 30102556 edges, 476157 markings/sec, 10 secs
lola: sara is running 15 secs || 10416442 markings, 39954774 edges, 427367 markings/sec, 15 secs
lola: sara is running 20 secs || 12658967 markings, 49442979 edges, 448505 markings/sec, 20 secs
lola: sara is running 25 secs || 14989737 markings, 58763177 edges, 466154 markings/sec, 25 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 1496402315360

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_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/S_GPPP-PT-C1000N0000001000.tgz
mv S_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 S_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 r108-blw3-149441612600592"
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 ;