fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r108-blw3-149441612600543
Last Updated
June 27, 2017

About the Execution of LoLA for S_GPPP-PT-C0100N0000001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15923.150 1429570.00 2162792.00 925.20 F?TTFTFFFFFF??F? 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 S_GPPP-PT-C0100N0000001000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600543
=====================================================================


--------------------
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-C0100N0000001000-CTLCardinality-0
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-1
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-15
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-2
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-3
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-4
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-5
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-6
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-7
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-8
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496395117219


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


checking for too many tokens
===========================================================================================
S_GPPP-PT-C0100N0000001000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_GPPP-PT-C0100N0000001000 @ 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-C0100N0000001000-CTLCardinality.task
lola: E (X (A (G (((_2PG <= start) OR (R5P <= E4P)))))) : E ((E (F ((b1 <= R5P))) U (2 <= start))) : A (G (E (((NADH <= _3PG) U (S7P <= _2PG))))) : A (G (((F6P <= 2) OR (NADPH + 1 <= FBP) OR ((R5P <= 0) AND (_1_3_BPG <= 1))))) : A (G (E (X ((G6P <= GSSG))))) : A (F (E (G ((b2 <= 2))))) : A (G (A (((Gluc <= ATP) U (1 <= GAP))))) : E (F (((NADPplus <= GAP) AND (3 <= R5P) AND (GAP <= Pyr) AND (1 <= ADP) AND (c1 + 1 <= Lac) AND (NADplus + 1 <= R5P)))) : A (G ((_3PG <= G6P))) : E (X (A (G (((1 <= Ru5P) OR (NADH <= a1)))))) : E (F ((3 <= Xu5P))) : E (F ((3 <= F6P))) : ((A (G (((ADP <= GSSG) OR (GAP <= R5P)))) OR (A (G ((Lac <= Xu5P))) AND A (F ((2 <= Pyr))))) AND (A (((_2PG <= S7P) U (PEP <= ADP))) AND E (((2 <= NADPplus) U (1 <= c2))))) : A (G ((R5P <= NADplus))) : (NOT(((NADPplus <= Pi) OR A (G ((Pi <= ATP))))) AND (G6P <= c1)) : NOT(A (G (((1 <= ATP) AND (Pi + 1 <= 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: E (X (A (G (((_2PG <= start) OR (R5P <= E4P))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U ((start + 1 <= _2PG) AND (E4P + 1 <= R5P)))))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1752528 markings, 9961391 edges, 350489 markings/sec, 0 secs
lola: 3494797 markings, 19902789 edges, 348454 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((b1 <= R5P))) U (2 <= start)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (b1 <= R5P)) U (2 <= start))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1992565 markings, 9816733 edges, 1997096708160356352 markings/sec, 0 secs
lola: 3711242 markings, 19801685 edges, 343735 markings/sec, 5 secs
lola: 5795262 markings, 30231512 edges, 416804 markings/sec, 10 secs
lola: 7554002 markings, 39651723 edges, 351748 markings/sec, 15 secs
lola: 9046256 markings, 48891217 edges, 298451 markings/sec, 20 secs
lola: 10635124 markings, 58167607 edges, 317774 markings/sec, 25 secs
lola: 12172783 markings, 66523453 edges, 307532 markings/sec, 30 secs
lola: 13902485 markings, 74882501 edges, 345940 markings/sec, 35 secs
lola: 15178827 markings, 82511709 edges, 255268 markings/sec, 40 secs
lola: 16579010 markings, 90493699 edges, 280037 markings/sec, 45 secs
lola: 18170335 markings, 99603500 edges, 318265 markings/sec, 50 secs
lola: 19694554 markings, 109640544 edges, 304844 markings/sec, 55 secs
lola: 21200108 markings, 119744009 edges, 301111 markings/sec, 60 secs
lola: 22495393 markings, 129206901 edges, 259057 markings/sec, 65 secs
lola: 23915697 markings, 138340425 edges, 284061 markings/sec, 70 secs
lola: 25369956 markings, 147074957 edges, 290852 markings/sec, 75 secs
lola: 26647171 markings, 155743757 edges, 255443 markings/sec, 80 secs
lola: 28141733 markings, 164979284 edges, 298912 markings/sec, 85 secs
lola: 29631340 markings, 174792632 edges, 297921 markings/sec, 90 secs
lola: 31082634 markings, 184352541 edges, 290259 markings/sec, 95 secs
lola: 32394576 markings, 193540396 edges, 262388 markings/sec, 100 secs
lola: 33648369 markings, 202698221 edges, 250759 markings/sec, 105 secs
lola: 34879160 markings, 211086052 edges, 246158 markings/sec, 110 secs
lola: 35999726 markings, 219342438 edges, 224113 markings/sec, 115 secs
lola: 37156859 markings, 227867503 edges, 231427 markings/sec, 120 secs
lola: 38264691 markings, 236224731 edges, 221566 markings/sec, 125 secs
lola: 39291679 markings, 244430950 edges, 205398 markings/sec, 130 secs
lola: 40371505 markings, 252953726 edges, 215965 markings/sec, 135 secs
lola: 41696581 markings, 262444913 edges, 265015 markings/sec, 140 secs
lola: 43199354 markings, 271106600 edges, 300555 markings/sec, 145 secs
lola: 44528625 markings, 279983928 edges, 265854 markings/sec, 150 secs
lola: 45927264 markings, 288944638 edges, 279728 markings/sec, 155 secs
lola: 47575284 markings, 298160979 edges, 329604 markings/sec, 160 secs
lola: 48977467 markings, 307480722 edges, 280437 markings/sec, 165 secs
lola: 50412825 markings, 316781072 edges, 287072 markings/sec, 170 secs
lola: 51782516 markings, 325296278 edges, 273938 markings/sec, 175 secs
lola: 53272631 markings, 334571437 edges, 298023 markings/sec, 180 secs
lola: 54761724 markings, 343838728 edges, 297819 markings/sec, 185 secs
lola: 56246474 markings, 353076820 edges, 296950 markings/sec, 190 secs
lola: 57720410 markings, 362256202 edges, 294787 markings/sec, 195 secs
lola: 59194203 markings, 371434327 edges, 294759 markings/sec, 200 secs
lola: 60679196 markings, 380672614 edges, 296999 markings/sec, 205 secs
lola: 62138979 markings, 389757807 edges, 291957 markings/sec, 210 secs
lola: 63631814 markings, 399054012 edges, 298567 markings/sec, 215 secs
lola: 64851216 markings, 406579147 edges, 243880 markings/sec, 220 secs
lola: 65951820 markings, 414337994 edges, 220121 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((NADH <= _3PG) U (S7P <= _2PG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((NADH <= _3PG) U (S7P <= _2PG)))))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((F6P <= 2) OR (NADPH + 1 <= FBP) OR ((R5P <= 0) AND (_1_3_BPG <= 1)))))
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 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-3.sara
lola: lola: SUBRESULT
lola: state equation: calling and running sara
result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((G6P <= GSSG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((G6P <= GSSG)))))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((b2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (3 <= b2))))
lola: processed formula length: 34
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((Gluc <= ATP) U (1 <= GAP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((Gluc <= ATP) U (1 <= GAP)))))
lola: processed formula length: 49
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).

lola: 4176471 markings, 7840980 edges, 3224512187133329408 markings/sec, 0 secs
lola: 7964435 markings, 15152133 edges, 757593 markings/sec, 5 secs
lola: 11591575 markings, 22188335 edges, 725428 markings/sec, 10 secs
lola: 15069828 markings, 28963730 edges, 695651 markings/sec, 15 secs
lola: 18417682 markings, 35490143 edges, 669571 markings/sec, 20 secs
lola: 21725781 markings, 41946207 edges, 661620 markings/sec, 25 secs
lola: 24949073 markings, 48258377 edges, 644658 markings/sec, 30 secs
lola: 28033372 markings, 54288595 edges, 616860 markings/sec, 35 secs
lola: 31066275 markings, 60230143 edges, 606581 markings/sec, 40 secs
lola: 33911449 markings, 65807799 edges, 569035 markings/sec, 45 secs
lola: 36691511 markings, 71261165 edges, 556012 markings/sec, 50 secs
lola: 39704398 markings, 77174192 edges, 602577 markings/sec, 55 secs
lola: 42553721 markings, 82768875 edges, 569865 markings/sec, 60 secs
lola: 45425961 markings, 88422073 edges, 574448 markings/sec, 65 secs
lola: 48168068 markings, 93804984 edges, 548421 markings/sec, 70 secs
lola: 50834029 markings, 99039065 edges, 533192 markings/sec, 75 secs
lola: 53413984 markings, 104112676 edges, 515991 markings/sec, 80 secs
lola: 56021930 markings, 109248009 edges, 521589 markings/sec, 85 secs
lola: 58559623 markings, 114234174 edges, 507539 markings/sec, 90 secs
lola: 61136029 markings, 119304616 edges, 515281 markings/sec, 95 secs
lola: 63733313 markings, 124419884 edges, 519457 markings/sec, 100 secs
lola: 66254333 markings, 129379932 edges, 504204 markings/sec, 105 secs
lola: 68721918 markings, 134246435 edges, 493517 markings/sec, 110 secs
lola: 71174060 markings, 139068269 edges, 490428 markings/sec, 115 secs
lola: 73647360 markings, 143947188 edges, 494660 markings/sec, 120 secs
lola: 76024997 markings, 148624530 edges, 475527 markings/sec, 125 secs
lola: 78513199 markings, 153534628 edges, 497640 markings/sec, 130 secs
lola: 80891619 markings, 158214997 edges, 475684 markings/sec, 135 secs
lola: 83285939 markings, 162942085 edges, 478864 markings/sec, 140 secs
lola: 85668586 markings, 167631710 edges, 476529 markings/sec, 145 secs
lola: 88047665 markings, 172326063 edges, 475816 markings/sec, 150 secs
lola: 90535464 markings, 177228146 edges, 497560 markings/sec, 155 secs
lola: 92953509 markings, 181996379 edges, 483609 markings/sec, 160 secs
lola: 95416220 markings, 186868429 edges, 492542 markings/sec, 165 secs
lola: 97800691 markings, 191557795 edges, 476894 markings/sec, 170 secs
lola: 100192584 markings, 196284469 edges, 478379 markings/sec, 175 secs
lola: 102521521 markings, 200872105 edges, 465787 markings/sec, 180 secs
lola: 104919724 markings, 205606376 edges, 479641 markings/sec, 185 secs
lola: 107276716 markings, 210270788 edges, 471398 markings/sec, 190 secs
lola: 109648632 markings, 214937298 edges, 474383 markings/sec, 195 secs
lola: 112082543 markings, 219750462 edges, 486782 markings/sec, 200 secs
lola: 114467019 markings, 224448736 edges, 476895 markings/sec, 205 secs
lola: 116840027 markings, 229133477 edges, 474602 markings/sec, 210 secs
lola: 119233664 markings, 233869557 edges, 478727 markings/sec, 215 secs
lola: 121537011 markings, 238408006 edges, 460669 markings/sec, 220 secs
lola: 123847334 markings, 242975036 edges, 462065 markings/sec, 225 secs
lola: 126270269 markings, 247767640 edges, 484587 markings/sec, 230 secs
lola: 128599284 markings, 252355507 edges, 465803 markings/sec, 235 secs
lola: 130977887 markings, 257055956 edges, 475721 markings/sec, 240 secs
lola: 133315811 markings, 261684989 edges, 467585 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NADPplus <= GAP) AND (3 <= R5P) AND (GAP <= Pyr) AND (1 <= ADP) AND (c1 + 1 <= Lac) AND (NADplus + 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 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2479030 markings, 9396480 edges, 495806 markings/sec, 0 secs
lola: sara is running 5 secs || 4690116 markings, 17911787 edges, 442217 markings/sec, 5 secs
lola: sara is running 10 secs || 6620169 markings, 25932516 edges, 386011 markings/sec, 10 secs
lola: sara is running 15 secs || 8248383 markings, 33350365 edges, 325643 markings/sec, 15 secs
lola: sara is running 20 secs || 9763452 markings, 40213822 edges, 303014 markings/sec, 20 secs
lola: sara is running 25 secs || 11850305 markings, 48083667 edges, 417371 markings/sec, 25 secs
lola: sara is running 30 secs || 13699285 markings, 56043000 edges, 369796 markings/sec, 30 secs
lola: sara is running 35 secs || 15367903 markings, 63353287 edges, 333724 markings/sec, 35 secs
lola: sara is running 40 secs || 17062180 markings, 70491547 edges, 338855 markings/sec, 40 secs
lola: sara is running 45 secs || 18547195 markings, 77475000 edges, 297003 markings/sec, 45 secs
lola: sara is running 50 secs || 19980512 markings, 84098658 edges, 286663 markings/sec, 50 secs
lola: sara is running 55 secs || 22355695 markings, 92434567 edges, 475037 markings/sec, 55 secs
lola: sara is running 60 secs || 24216394 markings, 100333148 edges, 372140 markings/sec, 60 secs
lola: sara is running 65 secs || 25914859 markings, 107940342 edges, 339693 markings/sec, 65 secs
lola: sara is running 70 secs || 27586283 markings, 115324662 edges, 334285 markings/sec, 70 secs
lola: sara is running 75 secs || 29224316 markings, 122317190 edges, 327607 markings/sec, 75 secs
lola: sara is running 80 secs || 30781309 markings, 129309973 edges, 311399 markings/sec, 80 secs
lola: sara is running 85 secs || 32123463 markings, 135550684 edges, 268431 markings/sec, 85 secs
lola: sara is running 90 secs || 33941974 markings, 142496716 edges, 363702 markings/sec, 90 secs
lola: sara is running 95 secs || 36128842 markings, 150485628 edges, 437374 markings/sec, 95 secs
lola: sara is running 100 secs || 37940018 markings, 158103524 edges, 362235 markings/sec, 100 secs
lola: sara is running 105 secs || 39581684 markings, 165538040 edges, 328333 markings/sec, 105 secs
lola: sara is running 110 secs || 41214090 markings, 172806502 edges, 326481 markings/sec, 110 secs
lola: sara is running 115 secs || 42765489 markings, 179713687 edges, 310280 markings/sec, 115 secs
lola: sara is running 120 secs || 44326798 markings, 186392217 edges, 312262 markings/sec, 120 secs
lola: sara is running 125 secs || 45906958 markings, 193231957 edges, 316032 markings/sec, 125 secs
lola: sara is running 130 secs || 47258457 markings, 199590441 edges, 270300 markings/sec, 130 secs
lola: sara is running 135 secs || 48560388 markings, 205666842 edges, 260386 markings/sec, 135 secs
lola: sara is running 140 secs || 50782710 markings, 213453989 edges, 444464 markings/sec, 140 secs
lola: sara is running 145 secs || 52873546 markings, 221064854 edges, 418167 markings/sec, 145 secs
lola: sara is running 150 secs || 54654983 markings, 228578510 edges, 356287 markings/sec, 150 secs
lola: sara is running 155 secs || 56298561 markings, 235950715 edges, 328716 markings/sec, 155 secs
lola: sara is running 160 secs || 57916494 markings, 242972496 edges, 323587 markings/sec, 160 secs
lola: sara is running 165 secs || 59523839 markings, 250445965 edges, 321469 markings/sec, 165 secs
lola: sara is running 170 secs || 61125605 markings, 257477151 edges, 320353 markings/sec, 170 secs
lola: sara is running 175 secs || 62677318 markings, 264101847 edges, 310343 markings/sec, 175 secs
lola: sara is running 180 secs || 64235705 markings, 270885604 edges, 311677 markings/sec, 180 secs
lola: sara is running 185 secs || 65587893 markings, 277100439 edges, 270438 markings/sec, 185 secs
lola: sara is running 190 secs || 66885835 markings, 283086101 edges, 259588 markings/sec, 190 secs
lola: sara is running 195 secs || 68749952 markings, 290028539 edges, 372823 markings/sec, 195 secs
lola: sara is running 200 secs || 70784556 markings, 297682581 edges, 406921 markings/sec, 200 secs
lola: sara is running 205 secs || 72834272 markings, 305201622 edges, 409943 markings/sec, 205 secs
lola: sara is running 210 secs || 74593513 markings, 312591273 edges, 351848 markings/sec, 210 secs
lola: sara is running 215 secs || 76183419 markings, 319752453 edges, 317981 markings/sec, 215 secs
lola: sara is running 220 secs || 77816512 markings, 326934553 edges, 326619 markings/sec, 220 secs
lola: sara is running 225 secs || 79360651 markings, 333988667 edges, 308828 markings/sec, 225 secs
lola: sara is running 230 secs || 80920750 markings, 341001756 edges, 312020 markings/sec, 230 secs
lola: sara is running 235 secs || 82485797 markings, 347890151 edges, 313009 markings/sec, 235 secs
lola: sara is running 240 secs || 83987032 markings, 354325546 edges, 300247 markings/sec, 240 secs
lola: sara is running 245 secs || 85432316 markings, 360795962 edges, 289057 markings/sec, 245 secs
lola: sara is running 250 secs || 86982153 markings, 367509804 edges, 309967 markings/sec, 250 secs
lola: sara is running 255 secs || 88238846 markings, 373484821 edges, 251339 markings/sec, 255 secs
lola: sara is running 260 secs || 89850507 markings, 379982912 edges, 322332 markings/sec, 260 secs
lola: sara is running 265 secs || 92008359 markings, 387601578 edges, 431570 markings/sec, 265 secs
lola: sara is running 270 secs || 94086712 markings, 395117278 edges, 415671 markings/sec, 270 secs
lola: sara is running 275 secs || 95924009 markings, 402519145 edges, 367459 markings/sec, 275 secs
lola: sara is running 280 secs || 97694659 markings, 409834646 edges, 354130 markings/sec, 280 secs
lola: sara is running 285 secs || 99251406 markings, 416941179 edges, 311349 markings/sec, 285 secs
lola: sara is running 290 secs || 100862867 markings, 424146682 edges, 322292 markings/sec, 290 secs
lola: sara is running 295 secs || 102389577 markings, 430869307 edges, 305342 markings/sec, 295 secs
lola: sara is running 300 secs || 104008962 markings, 438282452 edges, 323877 markings/sec, 300 secs
lola: sara is running 305 secs || 105543254 markings, 445212408 edges, 306858 markings/sec, 305 secs
lola: sara is running 310 secs || 107062094 markings, 451821552 edges, 303768 markings/sec, 310 secs
lola: sara is running 315 secs || 108591918 markings, 458350474 edges, 305965 markings/sec, 315 secs
lola: sara is running 320 secs || 110050741 markings, 464906508 edges, 291765 markings/sec, 320 secs
lola: sara is running 325 secs || 111546559 markings, 471413512 edges, 299164 markings/sec, 325 secs
lola: sara is running 330 secs || 112776967 markings, 477221561 edges, 246082 markings/sec, 330 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((_3PG <= G6P)))
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-C0100N0000001000-CTLCardinality-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 385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((1 <= Ru5P) OR (NADH <= a1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U ((Ru5P <= 0) AND (a1 + 1 <= NADH)))))
lola: processed formula length: 53
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1808495 markings, 10280246 edges, 361683 markings/sec, 0 secs
lola: 3582334 markings, 20401997 edges, 354768 markings/sec, 5 secs
lola: 5134081 markings, 30281174 edges, 310349 markings/sec, 10 secs
lola: 6755909 markings, 40147460 edges, 324366 markings/sec, 15 secs
lola: 8535904 markings, 50061614 edges, 355999 markings/sec, 20 secs
lola: 9964965 markings, 59262159 edges, 285812 markings/sec, 25 secs
lola: 11404152 markings, 68341830 edges, 287837 markings/sec, 30 secs
lola: 12753149 markings, 77157761 edges, 269799 markings/sec, 35 secs
lola: 14212946 markings, 86092780 edges, 291959 markings/sec, 40 secs
lola: 15645380 markings, 94661117 edges, 286487 markings/sec, 45 secs
lola: 16935547 markings, 102894235 edges, 258033 markings/sec, 50 secs
lola: 18396674 markings, 112289745 edges, 292225 markings/sec, 55 secs
lola: 19895924 markings, 122346162 edges, 299850 markings/sec, 60 secs
lola: 21386869 markings, 132371616 edges, 298189 markings/sec, 65 secs
lola: 22680030 markings, 142070669 edges, 258632 markings/sec, 70 secs
lola: 24039181 markings, 151816127 edges, 271830 markings/sec, 75 secs
lola: 25571041 markings, 161773763 edges, 306372 markings/sec, 80 secs
lola: 26833097 markings, 170707261 edges, 252411 markings/sec, 85 secs
lola: 27917200 markings, 179049624 edges, 216821 markings/sec, 90 secs
lola: 29128280 markings, 187689333 edges, 242216 markings/sec, 95 secs
lola: 30231042 markings, 196043594 edges, 220552 markings/sec, 100 secs
lola: 31428414 markings, 204629684 edges, 239474 markings/sec, 105 secs
lola: 32648188 markings, 213240989 edges, 243955 markings/sec, 110 secs
lola: 33673073 markings, 220761755 edges, 204977 markings/sec, 115 secs
lola: 34799998 markings, 228656073 edges, 225385 markings/sec, 120 secs
lola: 36115468 markings, 237586760 edges, 263094 markings/sec, 125 secs
lola: 37479917 markings, 246740108 edges, 272890 markings/sec, 130 secs
lola: 38839344 markings, 255857333 edges, 271885 markings/sec, 135 secs
lola: 40005793 markings, 264588361 edges, 233290 markings/sec, 140 secs
lola: 41168946 markings, 273241237 edges, 232631 markings/sec, 145 secs
lola: 42570616 markings, 282351151 edges, 280334 markings/sec, 150 secs
lola: 43835425 markings, 290916711 edges, 252962 markings/sec, 155 secs
lola: 44877280 markings, 298655297 edges, 208371 markings/sec, 160 secs
lola: 45906297 markings, 306302616 edges, 205803 markings/sec, 165 secs
lola: 46980090 markings, 314072366 edges, 214759 markings/sec, 170 secs
lola: 47934964 markings, 321496153 edges, 190975 markings/sec, 175 secs
lola: 49059595 markings, 329376118 edges, 224926 markings/sec, 180 secs
lola: 50159262 markings, 337145433 edges, 219933 markings/sec, 185 secs
lola: 51100278 markings, 344019573 edges, 188203 markings/sec, 190 secs
lola: 52097691 markings, 351134869 edges, 199483 markings/sec, 195 secs
lola: 53357772 markings, 359691117 edges, 252016 markings/sec, 200 secs
lola: 54735862 markings, 368933660 edges, 275618 markings/sec, 205 secs
lola: 56109436 markings, 378144225 edges, 274715 markings/sec, 210 secs
lola: 57329679 markings, 387091617 edges, 244049 markings/sec, 215 secs
lola: 58499520 markings, 395868905 edges, 233968 markings/sec, 220 secs
lola: 59897008 markings, 405055184 edges, 279498 markings/sec, 225 secs
lola: 61213715 markings, 413858142 edges, 263341 markings/sec, 230 secs
lola: 62289641 markings, 421775113 edges, 215185 markings/sec, 235 secs
lola: 63320201 markings, 429527839 edges, 206112 markings/sec, 240 secs
lola: 64416401 markings, 437435637 edges, 219240 markings/sec, 245 secs
lola: 65403254 markings, 445064121 edges, 197371 markings/sec, 250 secs
lola: 66538883 markings, 453059849 edges, 227126 markings/sec, 255 secs
lola: 67660436 markings, 460983716 edges, 224311 markings/sec, 260 secs
lola: 68628211 markings, 468071189 edges, 193555 markings/sec, 265 secs
lola: 69662598 markings, 475379333 edges, 206877 markings/sec, 270 secs
lola: 70785387 markings, 483786717 edges, 224558 markings/sec, 275 secs
lola: 71918105 markings, 492518384 edges, 226544 markings/sec, 280 secs
lola: 73047857 markings, 501223122 edges, 225950 markings/sec, 285 secs
lola: 74136329 markings, 509819538 edges, 217694 markings/sec, 290 secs
lola: 75124071 markings, 518215278 edges, 197548 markings/sec, 295 secs
lola: 76100357 markings, 526517591 edges, 195257 markings/sec, 300 secs
lola: 77272624 markings, 535319210 edges, 234453 markings/sec, 305 secs
lola: 78424186 markings, 543969278 edges, 230312 markings/sec, 310 secs
lola: 79295722 markings, 551176617 edges, 174307 markings/sec, 315 secs
lola: 80087722 markings, 558036191 edges, 158400 markings/sec, 320 secs
lola: 80933216 markings, 565046895 edges, 169099 markings/sec, 325 secs
lola: 81803672 markings, 572213072 edges, 174091 markings/sec, 330 secs
lola: 82627461 markings, 579270631 edges, 164758 markings/sec, 335 secs
lola: 83466965 markings, 586321335 edges, 167901 markings/sec, 340 secs
lola: 84386826 markings, 593719994 edges, 183972 markings/sec, 345 secs
lola: 85274692 markings, 600820619 edges, 177573 markings/sec, 350 secs
lola: 86037587 markings, 607137306 edges, 152579 markings/sec, 355 secs
lola: 86807581 markings, 613537129 edges, 153999 markings/sec, 360 secs
lola: 87751173 markings, 620790714 edges, 188718 markings/sec, 365 secs
lola: 89115047 markings, 629938836 edges, 272775 markings/sec, 370 secs
lola: 90464348 markings, 638986422 edges, 269860 markings/sec, 375 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 385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= Xu5P)))
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: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-10.sara
lola: subprocess 11 will run for 462 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= F6P)))
lola: ========================================
lola: SUBTASK
lola: lola: lola: checking reachability
========================================state equation: calling and running sara

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-C0100N0000001000-CTLCardinality-11.sara
sara: lola: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-10.sara.
SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 12 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((ADP <= GSSG) OR (GAP <= R5P)))) OR (A (G ((Lac <= Xu5P))) AND A (F ((2 <= Pyr))))) AND (A (((_2PG <= S7P) U (PEP <= ADP))) AND E (((2 <= NADPplus) U (1 <= c2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((ADP <= GSSG) OR (GAP <= R5P))))
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-C0100N0000001000-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 13 will run for 771 seconds at most (--localtimelimit=-1)
lola: ========================================
lola:
========================================
lola: ...considering subproblem: A (G ((Lac <= Xu5P)))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-13.sara
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 13 will run for 771 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((R5P <= NADplus)))
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-C0100N0000001000-CTLCardinality-13.sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3406674 markings, 9722359 edges, 681335 markings/sec, 0 secs
lola: sara is running 5 secs || 6381418 markings, 19521025 edges, 594949 markings/sec, 5 secs
lola: sara is running 10 secs || 9299653 markings, 28543411 edges, 583647 markings/sec, 10 secs
lola: sara is running 15 secs || 12007275 markings, 36056245 edges, 541524 markings/sec, 15 secs
lola: sara is running 20 secs || 14594973 markings, 43252370 edges, 517540 markings/sec, 20 secs
lola: sara is running 25 secs || 17209599 markings, 50537035 edges, 522925 markings/sec, 25 secs
lola: sara is running 30 secs || 19761524 markings, 57639399 edges, 510385 markings/sec, 30 secs
lola: sara is running 35 secs || 22257747 markings, 64595117 edges, 499245 markings/sec, 35 secs
lola: sara is running 40 secs || 24705983 markings, 71412881 edges, 489647 markings/sec, 40 secs
lola: sara is running 45 secs || 27087852 markings, 78058113 edges, 476374 markings/sec, 45 secs
lola: sara is running 50 secs || 29548936 markings, 84906434 edges, 492217 markings/sec, 50 secs
lola: sara is running 55 secs || 31953775 markings, 91612068 edges, 480968 markings/sec, 55 secs
lola: sara is running 60 secs || 34334967 markings, 98250073 edges, 476238 markings/sec, 60 secs
lola: sara is running 65 secs || 36709310 markings, 104886413 edges, 474869 markings/sec, 65 secs
lola: sara is running 70 secs || 39077065 markings, 111483950 edges, 473551 markings/sec, 70 secs
lola: sara is running 75 secs || 41420398 markings, 118012267 edges, 468667 markings/sec, 75 secs
lola: sara is running 80 secs || 43688519 markings, 124348525 edges, 453624 markings/sec, 80 secs
lola: sara is running 85 secs || 45956736 markings, 130670102 edges, 453643 markings/sec, 85 secs
lola: sara is running 90 secs || 48313951 markings, 137248909 edges, 471443 markings/sec, 90 secs
lola: sara is running 95 secs || 50710394 markings, 143943624 edges, 479289 markings/sec, 95 secs
lola: sara is running 100 secs || 53108242 markings, 150619491 edges, 479570 markings/sec, 100 secs
lola: sara is running 105 secs || 55446863 markings, 157150578 edges, 467724 markings/sec, 105 secs
lola: sara is running 110 secs || 57765049 markings, 163624131 edges, 463637 markings/sec, 110 secs
lola: sara is running 115 secs || 60053795 markings, 170014940 edges, 457749 markings/sec, 115 secs
lola: sara is running 120 secs || 62372835 markings, 176490415 edges, 463808 markings/sec, 120 secs
lola: sara is running 125 secs || 64737944 markings, 183094979 edges, 473022 markings/sec, 125 secs
lola: sara is running 130 secs || 67037715 markings, 189516174 edges, 459954 markings/sec, 130 secs
lola: sara is running 135 secs || 69348119 markings, 195941644 edges, 462081 markings/sec, 135 secs
lola: sara is running 140 secs || 71640628 markings, 202342140 edges, 458502 markings/sec, 140 secs
lola: sara is running 145 secs || 73908100 markings, 208694314 edges, 453494 markings/sec, 145 secs
lola: sara is running 150 secs || 76189086 markings, 215059777 edges, 456197 markings/sec, 150 secs
lola: sara is running 155 secs || 78443959 markings, 221352053 edges, 450975 markings/sec, 155 secs
lola: sara is running 160 secs || 80751050 markings, 227790538 edges, 461418 markings/sec, 160 secs
lola: sara is running 165 secs || 83076947 markings, 234281435 edges, 465179 markings/sec, 165 secs
lola: sara is running 170 secs || 85402461 markings, 240770996 edges, 465103 markings/sec, 170 secs
lola: sara is running 175 secs || 87713694 markings, 247220269 edges, 462247 markings/sec, 175 secs
lola: sara is running 180 secs || 90009207 markings, 253625268 edges, 459103 markings/sec, 180 secs
lola: sara is running 185 secs || 92277700 markings, 259954306 edges, 453699 markings/sec, 185 secs

lola: sara is running 190 secs || 94502378 markings, 266187922 edges, 444936 markings/sec, 190 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1058 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(((NADPplus <= Pi) OR A (G ((Pi <= ATP))))) AND (G6P <= c1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1058 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Pi + 1 <= NADPplus)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pi + 1 <= NADPplus)
lola: processed formula length: 20
lola: 6 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2117 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ATP + 1 <= Pi)))
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-C0100N0000001000-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2116 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((1 <= ATP) AND (Pi + 1 <= ATP)))))
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 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no no no unknown unknown no unknown yes yes no yes no no
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496396546789

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