fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LoLA for S_GPPP-PT-C1000N0000000100

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15949.330 663993.00 1240229.00 5320.10 ?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 S_GPPP-PT-C1000N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600583
=====================================================================

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


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


checking for too many tokens
===========================================================================================
S_GPPP-PT-C1000N0000000100: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_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 || 4065970 markings, 8912798 edges, 813194 markings/sec, 0 secs
lola: sara is running 5 secs || 8084288 markings, 17735137 edges, 803664 markings/sec, 5 secs
lola: sara is running 10 secs || 12080922 markings, 26511781 edges, 799327 markings/sec, 10 secs
lola: sara is running 15 secs || 15991055 markings, 35099371 edges, 782027 markings/sec, 15 secs
lola: sara is running 20 secs || 19899527 markings, 43683724 edges, 781694 markings/sec, 20 secs
lola: sara is running 25 secs || 23923197 markings, 52526823 edges, 804734 markings/sec, 25 secs
lola: sara is running 30 secs || 27918280 markings, 61328557 edges, 799017 markings/sec, 30 secs
lola: sara is running 35 secs || 31956366 markings, 70244679 edges, 807617 markings/sec, 35 secs
lola: sara is running 40 secs || 35856893 markings, 78892963 edges, 780105 markings/sec, 40 secs
lola: sara is running 45 secs || 39853093 markings, 87783213 edges, 799240 markings/sec, 45 secs
lola: sara is running 50 secs || 43826854 markings, 96658062 edges, 794752 markings/sec, 50 secs
lola: sara is running 55 secs || 47712314 markings, 105363424 edges, 777092 markings/sec, 55 secs
lola: sara is running 60 secs || 51019926 markings, 114246407 edges, 661522 markings/sec, 60 secs
lola: sara is running 65 secs || 53917021 markings, 123219176 edges, 579419 markings/sec, 65 secs
lola: sara is running 70 secs || 56780605 markings, 132088752 edges, 572717 markings/sec, 70 secs
lola: sara is running 75 secs || 59657868 markings, 141000793 edges, 575453 markings/sec, 75 secs
lola: sara is running 80 secs || 62533041 markings, 149906502 edges, 575035 markings/sec, 80 secs
lola: sara is running 85 secs || 65415896 markings, 158836116 edges, 576571 markings/sec, 85 secs
lola: sara is running 90 secs || 68311489 markings, 167805130 edges, 579119 markings/sec, 90 secs
lola: sara is running 95 secs || 71218979 markings, 176811012 edges, 581498 markings/sec, 95 secs
lola: sara is running 100 secs || 74158212 markings, 185915620 edges, 587847 markings/sec, 100 secs
lola: sara is running 105 secs || 77061343 markings, 194908150 edges, 580626 markings/sec, 105 secs
lola: sara is running 110 secs || 79982808 markings, 203957301 edges, 584293 markings/sec, 110 secs
lola: sara is running 115 secs || 82904065 markings, 213007209 edges, 584251 markings/sec, 115 secs
lola: sara is running 120 secs || 85821771 markings, 222049900 edges, 583541 markings/sec, 120 secs
lola: sara is running 125 secs || 88750299 markings, 231129965 edges, 585706 markings/sec, 125 secs
lola: sara is running 130 secs || 91726697 markings, 240362114 edges, 595280 markings/sec, 130 secs
lola: sara is running 135 secs || 94692654 markings, 249565757 edges, 593191 markings/sec, 135 secs
lola: sara is running 140 secs || 97502439 markings, 258289463 edges, 561957 markings/sec, 140 secs
lola: sara is running 145 secs || 100275679 markings, 266904389 edges, 554648 markings/sec, 145 secs
lola: sara is running 150 secs || 103233854 markings, 276103295 edges, 591635 markings/sec, 150 secs
lola: sara is running 155 secs || 106199303 markings, 285328892 edges, 593090 markings/sec, 155 secs
lola: sara is running 160 secs || 109174594 markings, 294591062 edges, 595058 markings/sec, 160 secs
lola: sara is running 165 secs || 112131325 markings, 303802011 edges, 591346 markings/sec, 165 secs
lola: sara is running 170 secs || 115111084 markings, 313090612 edges, 595952 markings/sec, 170 secs
lola: sara is running 175 secs || 118073357 markings, 322325008 edges, 592455 markings/sec, 175 secs
lola: sara is running 180 secs || 121050567 markings, 331617625 edges, 595442 markings/sec, 180 secs
lola: sara is running 185 secs || 123999837 markings, 340790062 edges, 589854 markings/sec, 185 secs
lola: sara is running 190 secs || 126784315 markings, 349409583 edges, 556896 markings/sec, 190 secs
lola: sara is running 195 secs || 129543513 markings, 357951502 edges, 551840 markings/sec, 195 secs
lola: sara is running 200 secs || 132307267 markings, 366507764 edges, 552751 markings/sec, 200 secs
lola: sara is running 205 secs || 135084238 markings, 375104968 edges, 555394 markings/sec, 205 secs
lola: sara is running 210 secs || 137877886 markings, 383754084 edges, 558730 markings/sec, 210 secs
lola: sara is running 215 secs || 140690417 markings, 392461527 edges, 562506 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: state equation: write sara problem file to GPPP-PT-C1000N0000000100-ReachabilityCardinality-2.sara
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: state equation: calling and running sara
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: 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: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-2.sara.
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
sara: place or transition ordering is non-deterministic
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 || 5085997 markings, 7343594 edges, 1017199 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
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: 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: lola: ...considering subproblem: A (G ((G6P <= 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: calling and running sara
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-C1000N0000000100-ReachabilityCardinality-6.sara
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
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-5.sara.
lola: state equation: calling and running 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 || 4352038 markings, 9356023 edges, 870408 markings/sec, 0 secs
lola: sara is running 5 secs || 8358742 markings, 18315013 edges, 801341 markings/sec, 5 secs
lola: sara is running 10 secs || 11091392 markings, 26505984 edges, 546530 markings/sec, 10 secs
lola: sara is running 15 secs || 14055263 markings, 34426446 edges, 592774 markings/sec, 15 secs
lola: sara is running 20 secs || 17507872 markings, 41933009 edges, 690522 markings/sec, 20 secs
lola: sara is running 25 secs || 21490062 markings, 49930580 edges, 796438 markings/sec, 25 secs
lola: sara is running 30 secs || 26066536 markings, 58134054 edges, 915295 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 || 3736774 markings, 8569066 edges, 747355 markings/sec, 0 secs
lola: sara is running 5 secs || 7413776 markings, 17026546 edges, 735400 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: state equation: calling and running sara
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: 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: sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-9.sara.========================================

lola: state equation: calling and running sara
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
sara: try reading problem file GPPP-PT-C1000N0000000100-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
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 || 3673821 markings, 8836813 edges, 734764 markings/sec, 0 secs
lola: sara is running 5 secs || 7227174 markings, 17412716 edges, 710671 markings/sec, 5 secs
lola: sara is running 10 secs || 10647944 markings, 25760277 edges, 684154 markings/sec, 10 secs
lola: sara is running 15 secs || 14047746 markings, 34047919 edges, 679960 markings/sec, 15 secs
lola: sara is running 20 secs || 17477381 markings, 42356056 edges, 685927 markings/sec, 20 secs
lola: sara is running 25 secs || 20865898 markings, 50548331 edges, 677703 markings/sec, 25 secs
lola: sara is running 30 secs || 24246273 markings, 58715940 edges, 676075 markings/sec, 30 secs
lola: sara is running 35 secs || 27598800 markings, 66814466 edges, 670505 markings/sec, 35 secs
lola: sara is running 40 secs || 30958407 markings, 74927796 edges, 671921 markings/sec, 40 secs
lola: sara is running 45 secs || 34343043 markings, 83099321 edges, 676927 markings/sec, 45 secs
lola: sara is running 50 secs || 37734191 markings, 91284150 edges, 678230 markings/sec, 50 secs
lola: sara is running 55 secs || 41087973 markings, 99376103 edges, 670756 markings/sec, 55 secs
lola: sara is running 60 secs || 44484776 markings, 107569839 edges, 679361 markings/sec, 60 secs
lola: sara is running 65 secs || 47872877 markings, 115740132 edges, 677620 markings/sec, 65 secs
lola: sara is running 70 secs || 51209905 markings, 123784299 edges, 667406 markings/sec, 70 secs
lola: sara is running 75 secs || 54544747 markings, 131820775 edges, 666968 markings/sec, 75 secs
lola: sara is running 80 secs || 57855455 markings, 139796248 edges, 662142 markings/sec, 80 secs
lola: sara is running 85 secs || 61162869 markings, 147761433 edges, 661483 markings/sec, 85 secs
lola: sara is running 90 secs || 64432981 markings, 155633880 edges, 654022 markings/sec, 90 secs
lola: sara is running 95 secs || 67755568 markings, 163631286 edges, 664517 markings/sec, 95 secs
lola: sara is running 100 secs || 71081794 markings, 171634976 edges, 665245 markings/sec, 100 secs
lola: sara is running 105 secs || 74360913 markings, 179522318 edges, 655824 markings/sec, 105 secs
lola: sara is running 110 secs || 77635492 markings, 187396408 edges, 654916 markings/sec, 110 secs
lola: sara is running 115 secs || 80956292 markings, 195380313 edges, 664160 markings/sec, 115 secs
lola: sara is running 120 secs || 84260038 markings, 203320606 edges, 660749 markings/sec, 120 secs
lola: sara is running 125 secs || 87534760 markings, 211188280 edges, 654944 markings/sec, 125 secs
lola: sara is running 130 secs || 90771339 markings, 218961101 edges, 647316 markings/sec, 130 secs
lola: sara is running 135 secs || 94003869 markings, 226722015 edges, 646506 markings/sec, 135 secs
lola: sara is running 140 secs || 97319677 markings, 234682585 edges, 663162 markings/sec, 140 secs
lola: sara is running 145 secs || 100632055 markings, 242632735 edges, 662476 markings/sec, 145 secs
lola: sara is running 150 secs || 103928018 markings, 250540769 edges, 659193 markings/sec, 150 secs
lola: sara is running 155 secs || 107158578 markings, 258288135 edges, 646112 markings/sec, 155 secs
lola: sara is running 160 secs || 110420554 markings, 266109403 edges, 652395 markings/sec, 160 secs
lola: sara is running 165 secs || 113646799 markings, 273842128 edges, 645249 markings/sec, 165 secs
lola: sara is running 170 secs || 116883878 markings, 281598947 edges, 647416 markings/sec, 170 secs
lola: sara is running 175 secs || 120127333 markings, 289397572 edges, 648691 markings/sec, 175 secs
lola: sara is running 180 secs || 123388410 markings, 297236810 edges, 652215 markings/sec, 180 secs
lola: sara is running 185 secs || 126637057 markings, 305047615 edges, 649729 markings/sec, 185 secs
lola: sara is running 190 secs || 129825728 markings, 312688881 edges, 637734 markings/sec, 190 secs
lola: sara is running 195 secs || 132991905 markings, 320265410 edges, 633235 markings/sec, 195 secs
lola: sara is running 200 secs || 136192789 markings, 327924009 edges, 640177 markings/sec, 200 secs
lola: sara is running 205 secs || 139355316 markings, 335487518 edges, 632505 markings/sec, 205 secs
lola: sara is running 210 secs || 142555461 markings, 343140111 edges, 640029 markings/sec, 210 secs
lola: sara is running 215 secs || 145732157 markings, 350733845 edges, 635339 markings/sec, 215 secs
lola: sara is running 220 secs || 148970641 markings, 358475483 edges, 647697 markings/sec, 220 secs
lola: sara is running 225 secs || 152175964 markings, 366134612 edges, 641065 markings/sec, 225 secs
lola: sara is running 230 secs || 155393981 markings, 373822484 edges, 643603 markings/sec, 230 secs
lola: sara is running 235 secs || 158583413 markings, 381439150 edges, 637886 markings/sec, 235 secs
lola: sara is running 240 secs || 161746838 markings, 388990732 edges, 632685 markings/sec, 240 secs
lola: sara is running 245 secs || 164932937 markings, 396595462 edges, 637220 markings/sec, 245 secs
lola: sara is running 250 secs || 168075347 markings, 404092292 edges, 628482 markings/sec, 250 secs
lola: sara is running 255 secs || 171246604 markings, 411657015 edges, 634251 markings/sec, 255 secs
lola: sara is running 260 secs || 174419107 markings, 419223012 edges, 634501 markings/sec, 260 secs
lola: sara is running 265 secs || 177605753 markings, 426821245 edges, 637329 markings/sec, 265 secs
lola: sara is running 270 secs || 180770960 markings, 434365761 edges, 633041 markings/sec, 270 secs
lola: sara is running 275 secs || 183985169 markings, 442027161 edges, 642842 markings/sec, 275 secs
lola: sara is running 280 secs || 187201286 markings, 449691181 edges, 643223 markings/sec, 280 secs
lola: sara is running 285 secs || 190407352 markings, 457329250 edges, 641213 markings/sec, 285 secs
lola: sara is running 290 secs || 193311329 markings, 464232811 edges, 580795 markings/sec, 290 secs
lola: sara is running 295 secs || 193337283 markings, 464295798 edges, 5191 markings/sec, 295 secs
lola: sara is running 300 secs || 193356275 markings, 464341852 edges, 3798 markings/sec, 300 secs
lola: sara is running 305 secs || 193362803 markings, 464357673 edges, 1306 markings/sec, 305 secs
lola: sara is running 310 secs || 193362895 markings, 464357892 edges, 18 markings/sec, 310 secs
lola: sara is running 315 secs || 193362987 markings, 464358132 edges, 18 markings/sec, 315 secs
lola: sara is running 320 secs || 193370430 markings, 464376140 edges, 1489 markings/sec, 320 secs
lola: sara is running 325 secs || 193370513 markings, 464376341 edges, 17 markings/sec, 325 secs
lola: sara is running 330 secs || 193429911 markings, 464520368 edges, 11880 markings/sec, 330 secs
lola: sara is running 335 secs || 193441085 markings, 464547456 edges, 2235 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 || 5291800 markings, 7197835 edges, 1058360 markings/sec, 0 secs
lola: sara is running 5 secs || 10870337 markings, 13431782 edges, 1115707 markings/sec, 5 secs
lola: sara is running 10 secs || 17424225 markings, 20004938 edges, 1310778 markings/sec, 10 secs
lola: sara is running 15 secs || 23716915 markings, 26315067 edges, 1258538 markings/sec, 15 secs
lola: sara is running 20 secs || 29931326 markings, 32550271 edges, 1242882 markings/sec, 20 secs
lola: sara is running 25 secs || 36007108 markings, 38650598 edges, 1215156 markings/sec, 25 secs
lola: sara is running 30 secs || 42260494 markings, 44940396 edges, 1250677 markings/sec, 30 secs
lola: sara is running 35 secs || 48624529 markings, 51394986 edges, 1272807 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 1438 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 2876 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 1496400521338

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

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

Sequence of Actions to be Executed by the VM

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

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