About the Execution of LoLA for GPPP-PT-C0100N0000100000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15952.920 | 1078924.00 | 2071382.00 | 10254.00 | TFFTF?FT?FTTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is GPPP-PT-C0100N0000100000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264500565
=====================================================================
--------------------
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-C0100N0000100000-ReachabilityCardinality-0
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-1
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-15
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-3
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-4
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-5
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-6
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-7
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-8
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494724238379
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ GPPP-PT-C0100N0000100000 @ 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-C0100N0000100000-ReachabilityCardinality.task
lola: E (F ((3 <= Lac))) : E (F (((3 <= ADP) AND ((3 <= b1) OR (start <= NADPH)) AND (Pi <= Gluc)))) : A (G (((_1_3_BPG <= 0) OR (S7P <= NADPplus) OR ((Pi + 1 <= G6P) AND (Gluc <= S7P))))) : E (F (((GAP <= 2) AND (NADPplus <= 0) AND (Ru5P <= 0)))) : A (G ((3 <= NADPplus))) : E (F ((((Pyr + 1 <= NADPplus) OR ((Ru5P <= GAP) AND (2 <= _1_3_BPG))) AND (2 <= Lac)))) : E (F ((((2 <= F6P) AND (1 <= PEP) AND ((NADH <= Xu5P) OR (2 <= a1))) OR ((2 <= Lac) AND (1 <= _1_3_BPG) AND (_2PG + 1 <= E4P))))) : A (G ((3 <= GSSG))) : A (G (((S7P <= 2) OR (2 <= GSSG)))) : E (F ((((2 <= a2) OR (Xu5P <= NADPH) OR ((2 <= FBP) AND (2 <= NADH))) AND (3 <= S7P)))) : A (G (((Xu5P <= 2) OR (2 <= Ru5P) OR (1 <= _2PG)))) : A (G ((E4P <= NADplus))) : A (G ((((start <= 2) OR (GSH <= 0)) AND ((ADP <= 0) OR (_1_3_BPG <= 1))))) : E (F (((2 <= S7P) AND (a2 <= _3PG) AND (3 <= NADH) AND (2 <= G6P) AND (((DHAP <= GSSG) AND (NADPplus <= Pyr)) OR (GSSG <= start))))) : E (F ((GSSG + 1 <= Lac))) : A (G (((Pyr + 1 <= Pi) OR (c1 <= 0) OR (_1_3_BPG <= 1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= 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: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= ADP) AND ((3 <= b1) OR (start <= NADPH)) AND (Pi <= Gluc))))
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 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara.
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3535550 markings, 9410470 edges, 707110 markings/sec, 0 secs
lola: sara is running 5 secs || 6813968 markings, 18551581 edges, 655684 markings/sec, 5 secs
lola: sara is running 10 secs || 10273140 markings, 27369776 edges, 691834 markings/sec, 10 secs
lola: sara is running 15 secs || 13274701 markings, 34561115 edges, 600312 markings/sec, 15 secs
lola: sara is running 20 secs || 15899730 markings, 40859946 edges, 525006 markings/sec, 20 secs
lola: sara is running 25 secs || 18499291 markings, 47097278 edges, 519912 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((_1_3_BPG <= 0) OR (S7P <= NADPplus) OR ((Pi + 1 <= G6P) AND (Gluc <= S7P)))))
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-C0100N0000100000-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3050350 markings, 8344697 edges, 610070 markings/sec, 0 secs
lola: sara is running 5 secs || 5637066 markings, 16516656 edges, 517343 markings/sec, 5 secs
lola: sara is running 10 secs || 8165174 markings, 23645383 edges, 505622 markings/sec, 10 secs
lola: sara is running 15 secs || 10547753 markings, 31511337 edges, 476516 markings/sec, 15 secs
lola: sara is running 20 secs || 13176952 markings, 38032147 edges, 525840 markings/sec, 20 secs
lola: sara is running 25 secs || 15394374 markings, 45625959 edges, 443484 markings/sec, 25 secs
lola: sara is running 30 secs || 17984088 markings, 52835015 edges, 517943 markings/sec, 30 secs
lola: sara is running 35 secs || 20447589 markings, 59253075 edges, 492700 markings/sec, 35 secs
lola: sara is running 40 secs || 22785176 markings, 66924169 edges, 467517 markings/sec, 40 secs
lola: sara is running 45 secs || 25298694 markings, 73818023 edges, 502704 markings/sec, 45 secs
lola: sara is running 50 secs || 27815116 markings, 79612101 edges, 503284 markings/sec, 50 secs
lola: sara is running 55 secs || 29904906 markings, 86815020 edges, 417958 markings/sec, 55 secs
lola: sara is running 60 secs || 32478598 markings, 94442829 edges, 514738 markings/sec, 60 secs
lola: sara is running 65 secs || 35065160 markings, 100488407 edges, 517312 markings/sec, 65 secs
lola: sara is running 70 secs || 37437457 markings, 106756559 edges, 474459 markings/sec, 70 secs
lola: sara is running 75 secs || 39741318 markings, 114230351 edges, 460772 markings/sec, 75 secs
lola: sara is running 80 secs || 42197614 markings, 121478373 edges, 491259 markings/sec, 80 secs
lola: sara is running 85 secs || 44772503 markings, 127303385 edges, 514978 markings/sec, 85 secs
lola: sara is running 90 secs || 47145599 markings, 133055221 edges, 474619 markings/sec, 90 secs
lola: sara is running 95 secs || 49271681 markings, 140226421 edges, 425216 markings/sec, 95 secs
lola: sara is running 100 secs || 51782965 markings, 147566183 edges, 502257 markings/sec, 100 secs
lola: sara is running 105 secs || 54324091 markings, 154056697 edges, 508225 markings/sec, 105 secs
lola: sara is running 110 secs || 56775451 markings, 159562092 edges, 490272 markings/sec, 110 secs
lola: sara is running 115 secs || 59055675 markings, 165924689 edges, 456045 markings/sec, 115 secs
lola: sara is running 120 secs || 61395301 markings, 173283465 edges, 467925 markings/sec, 120 secs
lola: sara is running 125 secs || 63834469 markings, 180359175 edges, 487834 markings/sec, 125 secs
lola: sara is running 130 secs || 66342040 markings, 186520424 edges, 501514 markings/sec, 130 secs
lola: sara is running 135 secs || 68763207 markings, 191963732 edges, 484233 markings/sec, 135 secs
lola: sara is running 140 secs || 71025883 markings, 197909171 edges, 452535 markings/sec, 140 secs
lola: sara is running 145 secs || 73208310 markings, 204986892 edges, 436485 markings/sec, 145 secs
lola: sara is running 150 secs || 75708029 markings, 212281397 edges, 499944 markings/sec, 150 secs
lola: sara is running 155 secs || 78107089 markings, 218773618 edges, 479812 markings/sec, 155 secs
lola: sara is running 160 secs || 80588423 markings, 224188192 edges, 496267 markings/sec, 160 secs
lola: sara is running 165 secs || 82846096 markings, 229390143 edges, 451535 markings/sec, 165 secs
lola: sara is running 170 secs || 85061859 markings, 235972013 edges, 443153 markings/sec, 170 secs
lola: sara is running 175 secs || 87470091 markings, 243270918 edges, 481646 markings/sec, 175 secs
lola: sara is running 180 secs || 89801577 markings, 249983499 edges, 466297 markings/sec, 180 secs
lola: sara is running 185 secs || 92265252 markings, 256509978 edges, 492735 markings/sec, 185 secs
lola: sara is running 190 secs || 94729158 markings, 261901475 edges, 492781 markings/sec, 190 secs
lola: sara is running 195 secs || 97006720 markings, 267132632 edges, 455512 markings/sec, 195 secs
lola: sara is running 200 secs || 99215519 markings, 273401464 edges, 441760 markings/sec, 200 secs
lola: sara is running 205 secs || 101515990 markings, 280537467 edges, 460094 markings/sec, 205 secs
lola: sara is running 210 secs || 103985538 markings, 287685954 edges, 493910 markings/sec, 210 secs
lola: sara is running 215 secs || 106289557 markings, 294292776 edges, 460804 markings/sec, 215 secs
lola: sara is running 220 secs || 108804011 markings, 299724835 edges, 502891 markings/sec, 220 secs
lola: sara is running 225 secs || 111114570 markings, 304939935 edges, 462112 markings/sec, 225 secs
lola: sara is running 230 secs || 113394317 markings, 310299096 edges, 455949 markings/sec, 230 secs
lola: sara is running 235 secs || 115452239 markings, 317039595 edges, 411584 markings/sec, 235 secs
lola: sara is running 240 secs || 118086526 markings, 324553151 edges, 526857 markings/sec, 240 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((GAP <= 2) AND (NADPplus <= 0) AND (Ru5P <= 0))))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4017689 markings, 7815098 edges, 803538 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= NADPplus)))
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-C0100N0000100000-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3565569 markings, 7595820 edges, 713114 markings/sec, 0 secs
lola: sara is running 5 secs || 6488758 markings, 14394266 edges, 584638 markings/sec, 5 secs
lola: sara is running 10 secs || 9027384 markings, 20996658 edges, 507725 markings/sec, 10 secs
lola: sara is running 15 secs || 11549182 markings, 27558796 edges, 504360 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((Pyr + 1 <= NADPplus) OR ((Ru5P <= GAP) AND (2 <= _1_3_BPG))) AND (2 <= 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 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 6 will run for 323 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= F6P) AND (1 <= PEP) AND ((NADH <= Xu5P) OR (2 <= a1))) OR ((2 <= Lac) AND (1 <= _1_3_BPG) AND (_2PG + 1 <= E4P)))))
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: ========================================
lola: state equation: Generated DNF with 9 literals and 3 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-C0100N0000100000-ReachabilityCardinality-6.sara
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= GSSG)))
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: ========================================
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((S7P <= 2) OR (2 <= GSSG))))
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-C0100N0000100000-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 460 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= a2) OR (Xu5P <= NADPH) OR ((2 <= FBP) AND (2 <= NADH))) AND (3 <= S7P))))
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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Xu5P <= 2) OR (2 <= Ru5P) OR (1 <= _2PG))))
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 3 literals and 1 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-C0100N0000100000-ReachabilityCardinality-10.sara
lola: subprocess 11 will run for 645 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((E4P <= 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: calling and running sara
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-11.sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3596308 markings, 9580227 edges, 719262 markings/sec, 0 secs
lola: sara is running 5 secs || 6998557 markings, 19066493 edges, 680450 markings/sec, 5 secs
lola: sara is running 10 secs || 10500603 markings, 27914173 edges, 700409 markings/sec, 10 secs
lola: sara is running 15 secs || 13528185 markings, 35169253 edges, 605516 markings/sec, 15 secs
lola: sara is running 20 secs || 16248493 markings, 41696572 edges, 544062 markings/sec, 20 secs
lola: sara is running 25 secs || 18845983 markings, 47929290 edges, 519498 markings/sec, 25 secs
lola: sara is running 30 secs || 21528189 markings, 54364957 edges, 536441 markings/sec, 30 secs
lola: sara is running 35 secs || 24188249 markings, 60747443 edges, 532012 markings/sec, 35 secs
lola: sara is running 40 secs || 26817856 markings, 67056880 edges, 525921 markings/sec, 40 secs
lola: sara is running 45 secs || 29424414 markings, 73311193 edges, 521312 markings/sec, 45 secs
lola: sara is running 50 secs || 32009279 markings, 79513418 edges, 516973 markings/sec, 50 secs
lola: sara is running 55 secs || 34534084 markings, 85571441 edges, 504961 markings/sec, 55 secs
lola: sara is running 60 secs || 37078624 markings, 91676908 edges, 508908 markings/sec, 60 secs
lola: sara is running 65 secs || 39597618 markings, 97721335 edges, 503799 markings/sec, 65 secs
lola: sara is running 70 secs || 42107732 markings, 103743799 edges, 502023 markings/sec, 70 secs
lola: sara is running 75 secs || 44610999 markings, 109750051 edges, 500653 markings/sec, 75 secs
lola: sara is running 80 secs || 47110373 markings, 115746980 edges, 499875 markings/sec, 80 secs
lola: sara is running 85 secs || 49563622 markings, 121633244 edges, 490650 markings/sec, 85 secs
lola: sara is running 90 secs || 52057181 markings, 127616417 edges, 498712 markings/sec, 90 secs
lola: sara is running 95 secs || 54515256 markings, 133514313 edges, 491615 markings/sec, 95 secs
lola: sara is running 100 secs || 56996091 markings, 139466648 edges, 496167 markings/sec, 100 secs
lola: sara is running 105 secs || 59439436 markings, 145329409 edges, 488669 markings/sec, 105 secs
lola: sara is running 110 secs || 61938830 markings, 151326080 edges, 499879 markings/sec, 110 secs
lola: sara is running 115 secs || 64324833 markings, 157050913 edges, 477201 markings/sec, 115 secs
lola: sara is running 120 secs || 66805047 markings, 163001773 edges, 496043 markings/sec, 120 secs
lola: sara is running 125 secs || 69318406 markings, 169032232 edges, 502672 markings/sec, 125 secs
lola: sara is running 130 secs || 71844473 markings, 175093898 edges, 505213 markings/sec, 130 secs
lola: sara is running 135 secs || 74376288 markings, 181167905 edges, 506363 markings/sec, 135 secs
lola: sara is running 140 secs || 76873835 markings, 187160301 edges, 499509 markings/sec, 140 secs
lola: sara is running 145 secs || 79363000 markings, 193132799 edges, 497833 markings/sec, 145 secs
lola: sara is running 150 secs || 81847644 markings, 199094019 edges, 496929 markings/sec, 150 secs
lola: sara is running 155 secs || 84354865 markings, 205109895 edges, 501444 markings/sec, 155 secs
lola: sara is running 160 secs || 86842084 markings, 211077326 edges, 497444 markings/sec, 160 secs
lola: sara is running 165 secs || 89312925 markings, 217005676 edges, 494168 markings/sec, 165 secs
lola: sara is running 170 secs || 91814842 markings, 223008600 edges, 500383 markings/sec, 170 secs
lola: sara is running 175 secs || 94349297 markings, 229089510 edges, 506891 markings/sec, 175 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 760 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((start <= 2) OR (GSH <= 0)) AND ((ADP <= 0) OR (_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 4 literals and 2 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-C0100N0000100000-ReachabilityCardinality-12.sara
lola: subprocess 13 will run for 1014 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ========================================...considering subproblem: E (F (((2 <= S7P) AND (a2 <= _3PG) AND (3 <= NADH) AND (2 <= G6P) AND (((DHAP <= GSSG) AND (NADPplus <= Pyr)) OR (GSSG <= start)))))
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 11 literals and 2 conjunctive subformulas
lola: state equation: calling and running sara
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-13.sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2363112 markings, 8041989 edges, 472622 markings/sec, 0 secs
lola: sara is running 5 secs || 4635080 markings, 15751561 edges, 454394 markings/sec, 5 secs
lola: sara is running 10 secs || 6833843 markings, 23125047 edges, 439753 markings/sec, 10 secs
lola: sara is running 15 secs || 9008596 markings, 30447882 edges, 434951 markings/sec, 15 secs
lola: sara is running 20 secs || 11253686 markings, 37807983 edges, 449018 markings/sec, 20 secs
lola: sara is running 25 secs || 13448021 markings, 45060380 edges, 438867 markings/sec, 25 secs
lola: sara is running 30 secs || 15629188 markings, 52269066 edges, 436233 markings/sec, 30 secs
lola: sara is running 35 secs || 17865664 markings, 59443758 edges, 447295 markings/sec, 35 secs
lola: sara is running 40 secs || 19969848 markings, 66471589 edges, 420837 markings/sec, 40 secs
lola: sara is running 45 secs || 22227819 markings, 73636086 edges, 451594 markings/sec, 45 secs
lola: sara is running 50 secs || 24379570 markings, 80597403 edges, 430350 markings/sec, 50 secs
lola: sara is running 55 secs || 26436488 markings, 87363853 edges, 411384 markings/sec, 55 secs
lola: sara is running 60 secs || 28679199 markings, 94599865 edges, 448542 markings/sec, 60 secs
lola: sara is running 65 secs || 30930180 markings, 101705960 edges, 450196 markings/sec, 65 secs
lola: sara is running 70 secs || 33014376 markings, 108395007 edges, 416839 markings/sec, 70 secs
lola: sara is running 75 secs || 35165802 markings, 115286537 edges, 430285 markings/sec, 75 secs
lola: sara is running 80 secs || 37319571 markings, 122169248 edges, 430754 markings/sec, 80 secs
lola: sara is running 85 secs || 39391514 markings, 128887242 edges, 414389 markings/sec, 85 secs
lola: sara is running 90 secs || 41412029 markings, 135485198 edges, 404103 markings/sec, 90 secs
lola: sara is running 95 secs || 43462687 markings, 141828781 edges, 410132 markings/sec, 95 secs
lola: sara is running 100 secs || 45601539 markings, 148522149 edges, 427770 markings/sec, 100 secs
lola: sara is running 105 secs || 47735277 markings, 155299603 edges, 426748 markings/sec, 105 secs
lola: sara is running 110 secs || 49838037 markings, 162011163 edges, 420552 markings/sec, 110 secs
lola: sara is running 115 secs || 51853104 markings, 168668114 edges, 403013 markings/sec, 115 secs
lola: sara is running 120 secs || 53912359 markings, 174882788 edges, 411851 markings/sec, 120 secs
lola: sara is running 125 secs || 55944021 markings, 181325736 edges, 406332 markings/sec, 125 secs
lola: sara is running 130 secs || 57986698 markings, 187939399 edges, 408535 markings/sec, 130 secs
lola: sara is running 135 secs || 59975140 markings, 194117042 edges, 397688 markings/sec, 135 secs
lola: sara is running 140 secs || 61965028 markings, 200329030 edges, 397978 markings/sec, 140 secs
lola: sara is running 145 secs || 63931189 markings, 206800793 edges, 393232 markings/sec, 145 secs
lola: sara is running 150 secs || 65858185 markings, 212598661 edges, 385399 markings/sec, 150 secs
lola: sara is running 155 secs || 67903808 markings, 219049723 edges, 409125 markings/sec, 155 secs
lola: sara is running 160 secs || 69870344 markings, 225391056 edges, 393307 markings/sec, 160 secs
lola: sara is running 165 secs || 72018174 markings, 231965635 edges, 429566 markings/sec, 165 secs
lola: sara is running 170 secs || 74014689 markings, 238514457 edges, 399303 markings/sec, 170 secs
lola: sara is running 175 secs || 76029511 markings, 244533314 edges, 402964 markings/sec, 175 secs
lola: sara is running 180 secs || 78115224 markings, 251177737 edges, 417143 markings/sec, 180 secs
lola: sara is running 185 secs || 80052700 markings, 257120902 edges, 387495 markings/sec, 185 secs
lola: sara is running 190 secs || 82063650 markings, 263479550 edges, 402190 markings/sec, 190 secs
lola: sara is running 195 secs || 84004930 markings, 269620255 edges, 388256 markings/sec, 195 secs
lola: sara is running 200 secs || 86029378 markings, 275895413 edges, 404890 markings/sec, 200 secs
lola: sara is running 205 secs || 87967765 markings, 282014194 edges, 387677 markings/sec, 205 secs
lola: sara is running 210 secs || 89980937 markings, 288246966 edges, 402634 markings/sec, 210 secs
lola: sara is running 215 secs || 91867100 markings, 294200353 edges, 377233 markings/sec, 215 secs
lola: sara is running 220 secs || 93903981 markings, 300488903 edges, 407376 markings/sec, 220 secs
lola: sara is running 225 secs || 95785113 markings, 306295996 edges, 376226 markings/sec, 225 secs
lola: sara is running 230 secs || 97758339 markings, 312561406 edges, 394645 markings/sec, 230 secs
lola: sara is running 235 secs || 99651477 markings, 318389271 edges, 378628 markings/sec, 235 secs
lola: sara is running 240 secs || 101673520 markings, 324889575 edges, 404409 markings/sec, 240 secs
lola: sara is running 245 secs || 103626979 markings, 330777092 edges, 390692 markings/sec, 245 secs
lola: sara is running 250 secs || 105579158 markings, 337220750 edges, 390436 markings/sec, 250 secs
lola: sara is running 255 secs || 107589183 markings, 343116019 edges, 402005 markings/sec, 255 secs
lola: sara is running 260 secs || 109471090 markings, 349304128 edges, 376381 markings/sec, 260 secs
lola: sara is running 265 secs || 111502971 markings, 355306608 edges, 406376 markings/sec, 265 secs
lola: sara is running 270 secs || 113401860 markings, 361140364 edges, 379778 markings/sec, 270 secs
lola: sara is running 275 secs || 115349496 markings, 367360010 edges, 389527 markings/sec, 275 secs
lola: sara is running 280 secs || 117214211 markings, 373011529 edges, 372943 markings/sec, 280 secs
lola: sara is running 285 secs || 119073266 markings, 379257469 edges, 371811 markings/sec, 285 secs
lola: sara is running 290 secs || 121085323 markings, 385013020 edges, 402411 markings/sec, 290 secs
lola: sara is running 295 secs || 122935487 markings, 390729835 edges, 370033 markings/sec, 295 secs
lola: sara is running 300 secs || 124838531 markings, 396845218 edges, 380609 markings/sec, 300 secs
lola: sara is running 305 secs || 126694899 markings, 402365900 edges, 371274 markings/sec, 305 secs
lola: sara is running 310 secs || 128478091 markings, 408250483 edges, 356638 markings/sec, 310 secs
lola: sara is running 315 secs || 130215510 markings, 413372671 edges, 347484 markings/sec, 315 secs
lola: sara is running 320 secs || 131996337 markings, 418823479 edges, 356165 markings/sec, 320 secs
lola: sara is running 325 secs || 133783815 markings, 424783267 edges, 357496 markings/sec, 325 secs
lola: sara is running 330 secs || 135863713 markings, 430807933 edges, 415980 markings/sec, 330 secs
lola: sara is running 335 secs || 137791165 markings, 436711469 edges, 385490 markings/sec, 335 secs
lola: sara is running 340 secs || 139819412 markings, 443354911 edges, 405649 markings/sec, 340 secs
lola: sara is running 345 secs || 141864368 markings, 449335772 edges, 408991 markings/sec, 345 secs
lola: sara is running 350 secs || 143838909 markings, 455549914 edges, 394908 markings/sec, 350 secs
lola: sara is running 355 secs || 145856238 markings, 461788038 edges, 403466 markings/sec, 355 secs
lola: sara is running 360 secs || 147776130 markings, 467554975 edges, 383978 markings/sec, 360 secs
lola: sara is running 365 secs || 149645528 markings, 473737994 edges, 373880 markings/sec, 365 secs
lola: sara is running 370 secs || 151778499 markings, 479941230 edges, 426594 markings/sec, 370 secs
lola: sara is running 375 secs || 153539973 markings, 485387294 edges, 352295 markings/sec, 375 secs
lola: sara is running 380 secs || 155331995 markings, 491316597 edges, 358404 markings/sec, 380 secs
lola: sara is running 385 secs || 157445108 markings, 497414573 edges, 422623 markings/sec, 385 secs
lola: sara is running 390 secs || 159215003 markings, 502862525 edges, 353979 markings/sec, 390 secs
lola: sara is running 395 secs || 161059977 markings, 508974058 edges, 368995 markings/sec, 395 secs
lola: sara is running 400 secs || 163224142 markings, 515229323 edges, 432833 markings/sec, 400 secs
lola: sara is running 405 secs || 165003254 markings, 520683226 edges, 355822 markings/sec, 405 secs
lola: sara is running 410 secs || 166835955 markings, 526688062 edges, 366540 markings/sec, 410 secs
lola: sara is running 415 secs || 168885316 markings, 532752365 edges, 409872 markings/sec, 415 secs
lola: sara is running 420 secs || 170616636 markings, 537990942 edges, 346264 markings/sec, 420 secs
lola: sara is running 425 secs || 172411648 markings, 543590739 edges, 359002 markings/sec, 425 secs
lola: sara is running 430 secs || 174335781 markings, 549726748 edges, 384827 markings/sec, 430 secs
lola: sara is running 435 secs || 176188198 markings, 555082279 edges, 370483 markings/sec, 435 secs
lola: sara is running 440 secs || 177962111 markings, 560542080 edges, 354783 markings/sec, 440 secs
lola: sara is running 445 secs || 179763427 markings, 566664845 edges, 360263 markings/sec, 445 secs
lola: sara is running 450 secs || 181781504 markings, 572321705 edges, 403615 markings/sec, 450 secs
lola: sara is running 455 secs || 183644237 markings, 578045444 edges, 372547 markings/sec, 455 secs
lola: sara is running 460 secs || 185503673 markings, 584193337 edges, 371887 markings/sec, 460 secs
lola: sara is running 465 secs || 187341781 markings, 589558606 edges, 367622 markings/sec, 465 secs
lola: sara is running 470 secs || 189228870 markings, 595192706 edges, 377418 markings/sec, 470 secs
lola: sara is running 475 secs || 191181908 markings, 601152135 edges, 390608 markings/sec, 475 secs
lola: sara is running 480 secs || 193106602 markings, 607492001 edges, 384939 markings/sec, 480 secs
lola: sara is running 485 secs || 193823967 markings, 609465520 edges, 143473 markings/sec, 485 secs
lola: sara is running 490 secs || 193826983 markings, 609473754 edges, 603 markings/sec, 490 secs
lola: sara is running 495 secs || 193878904 markings, 609616792 edges, 10384 markings/sec, 495 secs
lola: sara is running 500 secs || 193894202 markings, 609658274 edges, 3060 markings/sec, 500 secs
lola: sara is running 505 secs || 193911146 markings, 609704521 edges, 3389 markings/sec, 505 secs
lola: sara is running 510 secs || 193918310 markings, 609724570 edges, 1433 markings/sec, 510 secs
lola: sara is running 515 secs || 193946796 markings, 609803275 edges, 5697 markings/sec, 515 secs
lola: sara is running 520 secs || 193949149 markings, 609809600 edges, 471 markings/sec, 520 secs
lola: sara is running 525 secs || 193952764 markings, 609819832 edges, 723 markings/sec, 525 secs
lola: sara is running 530 secs || 193952832 markings, 609820035 edges, 14 markings/sec, 530 secs
lola: sara is running 535 secs || 193955890 markings, 609828211 edges, 612 markings/sec, 535 secs
lola: sara is running 540 secs || 193963887 markings, 609849682 edges, 1599 markings/sec, 540 secs
lola: sara is running 545 secs || 193968511 markings, 609862700 edges, 925 markings/sec, 545 secs
lola: sara is running 550 secs || 193976119 markings, 609884169 edges, 1522 markings/sec, 550 secs
lola: sara is running 555 secs || 193976193 markings, 609884389 edges, 15 markings/sec, 555 secs
lola: sara is running 560 secs || 193991568 markings, 609926288 edges, 3075 markings/sec, 560 secs
lola: sara is running 565 secs || 194048525 markings, 610082853 edges, 11391 markings/sec, 565 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((GSSG + 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: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 2464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Pyr + 1 <= Pi) OR (c1 <= 0) OR (_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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: RESULT
lola:
SUMMARY: yes no unknown no yes yes yes yes yes no no yes no unknown no yes
lola: ========================================
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494725317303
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000100000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000100000.tgz
mv GPPP-PT-C0100N0000100000 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is GPPP-PT-C0100N0000100000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-blw3-149440264500565"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;