fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LoLA for GPPP-PT-C1000N0000000100

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15951.860 664832.00 1250196.00 8005.40 ?TF?TFTTTTFTFFFT 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-C1000N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264500583
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494726054342


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ GPPP-PT-C1000N0000000100 @ 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-C1000N0000000100-ReachabilityCardinality.task
lola: A (G (((S7P <= c1) OR (2 <= PEP)))) : A (G (((NADPH <= c1) OR (1 <= NADH) OR ((GSH <= NADPH) AND (start <= R5P)) OR (_2PG <= start)))) : E (F ((((a1 <= 2) OR (GAP <= 0)) AND (3 <= Xu5P)))) : E (F ((((NADPplus <= Ru5P) OR (NADH <= DHAP)) AND (GSSG <= start)))) : E (F (((b1 <= 2) AND (b1 + 1 <= Xu5P) AND (Ru5P <= 1)))) : E (F ((((2 <= b1) OR (_3PG <= PEP) OR (FBP <= 2)) AND ((NADplus <= 1) OR ((3 <= Gluc) AND (1 <= _2PG)))))) : A (G ((G6P <= NADPplus))) : E (F (((_2PG <= start) AND (3 <= _2PG)))) : A (G (((NADH <= 0) OR (FBP <= 2) OR ((Pyr <= 0) AND ((GSH <= Gluc) OR (R5P <= NADH)))))) : E (F (((S7P + 1 <= E4P) AND (NADPplus + 1 <= c1) AND ((GAP <= GSH) OR (3 <= GSH) OR (2 <= _2PG))))) : A (G (((1 <= Pyr) OR (G6P <= NADH) OR ((2 <= S7P) AND (FBP <= _1_3_BPG)) OR (1 <= NADPplus)))) : E (F (((b2 + 1 <= _1_3_BPG) AND ((a2 <= 1) OR (b2 <= 2))))) : E (F (((3 <= FBP) AND (3 <= NADplus) AND ((1 <= NADPplus) OR (1 <= GSSG)) AND ((1 <= GSH) OR (3 <= ADP))))) : E (F (((1 <= NADplus) AND (2 <= S7P) AND ((3 <= _2PG) OR (1 <= GSH)) AND ((Gluc <= GSH) OR (Xu5P <= GSSG) OR (Lac + 1 <= Xu5P))))) : E (F ((((NADPplus <= 0) AND (Xu5P <= 1)) OR ((_3PG + 1 <= Pi) AND (ATP + 1 <= _3PG))))) : E (F (((NADplus <= NADPplus) AND (2 <= NADPH) AND (Ru5P <= 1) AND ((2 <= Xu5P) OR (2 <= b2) OR (1 <= G6P)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((S7P <= c1) OR (2 <= PEP))))
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-C1000N0000000100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4092182 markings, 8970451 edges, 818436 markings/sec, 0 secs
lola: sara is running 5 secs || 8128637 markings, 17832676 edges, 807291 markings/sec, 5 secs
lola: sara is running 10 secs || 12186692 markings, 26744002 edges, 811611 markings/sec, 10 secs
lola: sara is running 15 secs || 16145463 markings, 35438536 edges, 791754 markings/sec, 15 secs
lola: sara is running 20 secs || 20076280 markings, 44071999 edges, 786163 markings/sec, 20 secs
lola: sara is running 25 secs || 24020463 markings, 52740842 edges, 788837 markings/sec, 25 secs
lola: sara is running 30 secs || 28047177 markings, 61611963 edges, 805343 markings/sec, 30 secs
lola: sara is running 35 secs || 32007035 markings, 70356903 edges, 791972 markings/sec, 35 secs
lola: sara is running 40 secs || 35977693 markings, 79158665 edges, 794132 markings/sec, 40 secs
lola: sara is running 45 secs || 39845203 markings, 87765855 edges, 773502 markings/sec, 45 secs
lola: sara is running 50 secs || 43750769 markings, 96485083 edges, 781113 markings/sec, 50 secs
lola: sara is running 55 secs || 47620124 markings, 105152606 edges, 773871 markings/sec, 55 secs
lola: sara is running 60 secs || 50918275 markings, 113931624 edges, 659630 markings/sec, 60 secs
lola: sara is running 65 secs || 53773588 markings, 122775005 edges, 571063 markings/sec, 65 secs
lola: sara is running 70 secs || 56606965 markings, 131550841 edges, 566675 markings/sec, 70 secs
lola: sara is running 75 secs || 59463383 markings, 140398309 edges, 571284 markings/sec, 75 secs
lola: sara is running 80 secs || 62336018 markings, 149296174 edges, 574527 markings/sec, 80 secs
lola: sara is running 85 secs || 65224746 markings, 158244005 edges, 577746 markings/sec, 85 secs
lola: sara is running 90 secs || 68127365 markings, 167234814 edges, 580524 markings/sec, 90 secs
lola: sara is running 95 secs || 71017294 markings, 176186291 edges, 577986 markings/sec, 95 secs
lola: sara is running 100 secs || 73924519 markings, 185191727 edges, 581445 markings/sec, 100 secs
lola: sara is running 105 secs || 76800994 markings, 194101672 edges, 575295 markings/sec, 105 secs
lola: sara is running 110 secs || 79698568 markings, 203077132 edges, 579515 markings/sec, 110 secs
lola: sara is running 115 secs || 82620043 markings, 212127169 edges, 584295 markings/sec, 115 secs
lola: sara is running 120 secs || 85552010 markings, 221213686 edges, 586393 markings/sec, 120 secs
lola: sara is running 125 secs || 88497109 markings, 230344760 edges, 589020 markings/sec, 125 secs
lola: sara is running 130 secs || 91453781 markings, 239515435 edges, 591334 markings/sec, 130 secs
lola: sara is running 135 secs || 94413023 markings, 248697845 edges, 591848 markings/sec, 135 secs
lola: sara is running 140 secs || 97387981 markings, 257933184 edges, 594992 markings/sec, 140 secs
lola: sara is running 145 secs || 100356990 markings, 267159134 edges, 593802 markings/sec, 145 secs
lola: sara is running 150 secs || 103311772 markings, 276344980 edges, 590956 markings/sec, 150 secs
lola: sara is running 155 secs || 106276640 markings, 285568556 edges, 592974 markings/sec, 155 secs
lola: sara is running 160 secs || 109245384 markings, 294810436 edges, 593749 markings/sec, 160 secs
lola: sara is running 165 secs || 112205388 markings, 304031530 edges, 592001 markings/sec, 165 secs
lola: sara is running 170 secs || 115183430 markings, 313314807 edges, 595608 markings/sec, 170 secs
lola: sara is running 175 secs || 118153194 markings, 322578731 edges, 593953 markings/sec, 175 secs
lola: sara is running 180 secs || 121113851 markings, 331813741 edges, 592131 markings/sec, 180 secs
lola: sara is running 185 secs || 124005623 markings, 340807987 edges, 578354 markings/sec, 185 secs
lola: sara is running 190 secs || 126766717 markings, 349355064 edges, 552219 markings/sec, 190 secs
lola: sara is running 195 secs || 129520421 markings, 357879964 edges, 550741 markings/sec, 195 secs
lola: sara is running 200 secs || 132276054 markings, 366411067 edges, 551127 markings/sec, 200 secs
lola: sara is running 205 secs || 135045596 markings, 374985258 edges, 553908 markings/sec, 205 secs
lola: sara is running 210 secs || 137829924 markings, 383605498 edges, 556866 markings/sec, 210 secs
lola: sara is running 215 secs || 140616122 markings, 392231673 edges, 557240 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NADPH <= c1) OR (1 <= NADH) OR ((GSH <= NADPH) AND (start <= R5P)) OR (_2PG <= start))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality.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 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((a1 <= 2) OR (GAP <= 0)) AND (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 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NADPplus <= Ru5P) OR (NADH <= DHAP)) AND (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: lola: RUNNING
========================================
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((b1 <= 2) AND (b1 + 1 <= Xu5P) AND (Ru5P <= 1))))
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-C1000N0000000100-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 5129052 markings, 7413288 edges, 1025810 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= b1) OR (_3PG <= PEP) OR (FBP <= 2)) AND ((NADplus <= 1) OR ((3 <= Gluc) AND (1 <= _2PG))))))
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: 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 15 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-5.sara
lola: The predicate is reachable.
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G6P <= NADPplus)))
lola: lola: ========================================
lola: ========================================
SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: 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-C1000N0000000100-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((_2PG <= start) AND (3 <= _2PG))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-5.sara.
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 4301429 markings, 9246526 edges, 860286 markings/sec, 0 secs
lola: sara is running 5 secs || 8244432 markings, 18036479 edges, 788601 markings/sec, 5 secs
lola: sara is running 10 secs || 11040985 markings, 26357084 edges, 559311 markings/sec, 10 secs
lola: sara is running 15 secs || 13674898 markings, 33599075 edges, 526783 markings/sec, 15 secs
lola: sara is running 20 secs || 16819676 markings, 40427687 edges, 628956 markings/sec, 20 secs
lola: sara is running 25 secs || 20489689 markings, 48138371 edges, 734003 markings/sec, 25 secs
lola: sara is running 30 secs || 25021305 markings, 56260301 edges, 906323 markings/sec, 30 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 409 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NADH <= 0) OR (FBP <= 2) OR ((Pyr <= 0) AND ((GSH <= Gluc) OR (R5P <= NADH))))))
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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3663795 markings, 8402154 edges, 732759 markings/sec, 0 secs
lola: sara is running 5 secs || 7271958 markings, 16699606 edges, 721633 markings/sec, 5 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((S7P + 1 <= E4P) AND (NADPplus + 1 <= c1) AND ((GAP <= GSH) OR (3 <= GSH) OR (2 <= _2PG)))))
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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Pyr) OR (G6P <= NADH) OR ((2 <= S7P) AND (FBP <= _1_3_BPG)) OR (1 <= 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((b2 + 1 <= _1_3_BPG) AND ((a2 <= 1) OR (b2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3624779 markings, 8718474 edges, 724956 markings/sec, 0 secs
lola: sara is running 5 secs || 7206476 markings, 17362766 edges, 716339 markings/sec, 5 secs
lola: sara is running 10 secs || 10577475 markings, 25587222 edges, 674200 markings/sec, 10 secs
lola: sara is running 15 secs || 13917796 markings, 33731895 edges, 668064 markings/sec, 15 secs
lola: sara is running 20 secs || 17315431 markings, 41963093 edges, 679527 markings/sec, 20 secs
lola: sara is running 25 secs || 20685413 markings, 50110863 edges, 673996 markings/sec, 25 secs
lola: sara is running 30 secs || 24056139 markings, 58254803 edges, 674145 markings/sec, 30 secs
lola: sara is running 35 secs || 27425219 markings, 66393657 edges, 673816 markings/sec, 35 secs
lola: sara is running 40 secs || 30810220 markings, 74568589 edges, 677000 markings/sec, 40 secs
lola: sara is running 45 secs || 34148244 markings, 82627060 edges, 667605 markings/sec, 45 secs
lola: sara is running 50 secs || 37513151 markings, 90748368 edges, 672981 markings/sec, 50 secs
lola: sara is running 55 secs || 40859918 markings, 98823146 edges, 669353 markings/sec, 55 secs
lola: sara is running 60 secs || 44191121 markings, 106857864 edges, 666241 markings/sec, 60 secs
lola: sara is running 65 secs || 47513543 markings, 114868982 edges, 664484 markings/sec, 65 secs
lola: sara is running 70 secs || 50829909 markings, 122862925 edges, 663273 markings/sec, 70 secs
lola: sara is running 75 secs || 54160125 markings, 130888098 edges, 666043 markings/sec, 75 secs
lola: sara is running 80 secs || 57497280 markings, 138927768 edges, 667431 markings/sec, 80 secs
lola: sara is running 85 secs || 60842945 markings, 146985799 edges, 669133 markings/sec, 85 secs
lola: sara is running 90 secs || 64184169 markings, 155030688 edges, 668245 markings/sec, 90 secs
lola: sara is running 95 secs || 67503245 markings, 163019524 edges, 663815 markings/sec, 95 secs
lola: sara is running 100 secs || 70810627 markings, 170977680 edges, 661476 markings/sec, 100 secs
lola: sara is running 105 secs || 74111317 markings, 178917240 edges, 660138 markings/sec, 105 secs
lola: sara is running 110 secs || 77447456 markings, 186940579 edges, 667228 markings/sec, 110 secs
lola: sara is running 115 secs || 80757791 markings, 194898960 edges, 662067 markings/sec, 115 secs
lola: sara is running 120 secs || 84062987 markings, 202842791 edges, 661039 markings/sec, 120 secs
lola: sara is running 125 secs || 87384066 markings, 210822918 edges, 664216 markings/sec, 125 secs
lola: sara is running 130 secs || 90675371 markings, 218728381 edges, 658261 markings/sec, 130 secs
lola: sara is running 135 secs || 93964896 markings, 226627575 edges, 657905 markings/sec, 135 secs
lola: sara is running 140 secs || 97232225 markings, 234470493 edges, 653466 markings/sec, 140 secs
lola: sara is running 145 secs || 100078354 markings, 241320393 edges, 569226 markings/sec, 145 secs
lola: sara is running 150 secs || 103210449 markings, 248883808 edges, 626419 markings/sec, 150 secs
lola: sara is running 155 secs || 106470185 markings, 256704109 edges, 651947 markings/sec, 155 secs
lola: sara is running 160 secs || 109745896 markings, 264561092 edges, 655142 markings/sec, 160 secs
lola: sara is running 165 secs || 112944172 markings, 272227947 edges, 639655 markings/sec, 165 secs
lola: sara is running 170 secs || 116191553 markings, 280011784 edges, 649476 markings/sec, 170 secs
lola: sara is running 175 secs || 119344067 markings, 287563520 edges, 630503 markings/sec, 175 secs
lola: sara is running 180 secs || 122516103 markings, 295160525 edges, 634407 markings/sec, 180 secs
lola: sara is running 185 secs || 125683072 markings, 302742986 edges, 633394 markings/sec, 185 secs
lola: sara is running 190 secs || 128850471 markings, 310324491 edges, 633480 markings/sec, 190 secs
lola: sara is running 195 secs || 132068262 markings, 318026070 edges, 643558 markings/sec, 195 secs
lola: sara is running 200 secs || 135298766 markings, 325756375 edges, 646101 markings/sec, 200 secs
lola: sara is running 205 secs || 138544560 markings, 333521695 edges, 649159 markings/sec, 205 secs
lola: sara is running 210 secs || 141628215 markings, 340891975 edges, 616731 markings/sec, 210 secs
lola: sara is running 215 secs || 144780835 markings, 348427310 edges, 630524 markings/sec, 215 secs
lola: sara is running 220 secs || 148051565 markings, 356247113 edges, 654146 markings/sec, 220 secs
lola: sara is running 225 secs || 151333905 markings, 364093030 edges, 656468 markings/sec, 225 secs
lola: sara is running 230 secs || 154602875 markings, 371904508 edges, 653794 markings/sec, 230 secs
lola: sara is running 235 secs || 157854466 markings, 379671927 edges, 650318 markings/sec, 235 secs
lola: sara is running 240 secs || 161106941 markings, 387439472 edges, 650495 markings/sec, 240 secs
lola: sara is running 245 secs || 164344192 markings, 395168092 edges, 647450 markings/sec, 245 secs
lola: sara is running 250 secs || 167523060 markings, 402753261 edges, 635774 markings/sec, 250 secs
lola: sara is running 255 secs || 170629128 markings, 410160024 edges, 621214 markings/sec, 255 secs
lola: sara is running 260 secs || 173687928 markings, 417450308 edges, 611760 markings/sec, 260 secs
lola: sara is running 265 secs || 176829092 markings, 424938329 edges, 628233 markings/sec, 265 secs
lola: sara is running 270 secs || 179860792 markings, 432159020 edges, 606340 markings/sec, 270 secs
lola: sara is running 275 secs || 182973239 markings, 439573768 edges, 622489 markings/sec, 275 secs
lola: sara is running 280 secs || 186111113 markings, 447048122 edges, 627575 markings/sec, 280 secs
lola: sara is running 285 secs || 189192991 markings, 454420888 edges, 616376 markings/sec, 285 secs
lola: sara is running 290 secs || 192407999 markings, 462091413 edges, 643002 markings/sec, 290 secs
lola: sara is running 295 secs || 193309695 markings, 464228843 edges, 180339 markings/sec, 295 secs
lola: sara is running 300 secs || 193356536 markings, 464342487 edges, 9368 markings/sec, 300 secs
lola: sara is running 305 secs || 193395846 markings, 464437770 edges, 7862 markings/sec, 305 secs
lola: sara is running 310 secs || 193403145 markings, 464455393 edges, 1460 markings/sec, 310 secs
lola: sara is running 315 secs || 193406110 markings, 464462677 edges, 593 markings/sec, 315 secs
lola: sara is running 320 secs || 193413087 markings, 464479583 edges, 1395 markings/sec, 320 secs
lola: sara is running 325 secs || 193442189 markings, 464550228 edges, 5820 markings/sec, 325 secs
lola: sara is running 330 secs || 193452466 markings, 464574978 edges, 2055 markings/sec, 330 secs
lola: sara is running 335 secs || 193485539 markings, 464655157 edges, 6615 markings/sec, 335 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 729 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= FBP) AND (3 <= NADplus) AND ((1 <= NADPplus) OR (1 <= GSSG)) AND ((1 <= GSH) OR (3 <= ADP)))))
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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 972 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= NADplus) AND (2 <= S7P) AND ((3 <= _2PG) OR (1 <= GSH)) AND ((Gluc <= GSH) OR (Xu5P <= GSSG) OR (Lac + 1 <= 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 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 5376209 markings, 7317694 edges, 1075242 markings/sec, 0 secs
lola: sara is running 5 secs || 11139789 markings, 13702269 edges, 1152716 markings/sec, 5 secs
lola: sara is running 10 secs || 17753460 markings, 20334942 edges, 1322734 markings/sec, 10 secs
lola: sara is running 15 secs || 24132228 markings, 26731858 edges, 1275754 markings/sec, 15 secs
lola: sara is running 20 secs || 30496219 markings, 33117244 edges, 1272798 markings/sec, 20 secs
lola: sara is running 25 secs || 36849138 markings, 39496745 edges, 1270584 markings/sec, 25 secs
lola: sara is running 30 secs || 43231759 markings, 45919945 edges, 1276524 markings/sec, 30 secs
lola: sara is running 35 secs || 49602289 markings, 52376922 edges, 1274106 markings/sec, 35 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NADPplus <= 0) AND (Xu5P <= 1)) OR ((_3PG + 1 <= Pi) AND (ATP + 1 <= _3PG)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2875 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NADplus <= NADPplus) AND (2 <= NADPH) AND (Ru5P <= 1) AND ((2 <= Xu5P) OR (2 <= b2) OR (1 <= G6P)))))
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 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: unknown yes yes yes no yes no no no yes no unknown yes no yes yes
lola: ========================================
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494726719174

--------------------
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-C1000N0000000100"
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-C1000N0000000100.tgz
mv GPPP-PT-C1000N0000000100 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-C1000N0000000100, 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-149440264500583"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;