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

About the Execution of LoLA for GPPP-PT-C1000N0000000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3321.870 87937.00 191289.00 50.00 FTTTFFTTTTTTTFFT 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-C1000N0000000010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264500576
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494725012315


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ GPPP-PT-C1000N0000000010 @ 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-C1000N0000000010-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(Phosphoglycerate_mutase) OR FIREABLE(Transaldolase) OR FIREABLE(Phosphofructokinase)))) : E (F (FIREABLE(Pyruvate_kinase))) : E (F ((NOT FIREABLE(Phosphofructokinase) AND NOT FIREABLE(Glutathione_oxidation) AND ((FIREABLE(G6P_dehydrogenase) AND FIREABLE(Hexokinase)) OR (FIREABLE(Phosphoglycerate_kinase) AND FIREABLE(Enolase))) AND FIREABLE(GAP_dehydrogenase)))) : E (F (FIREABLE(Enolase))) : E (F ((FIREABLE(Pyruvate_kinase) AND FIREABLE(G6P_dehydrogenase) AND FIREABLE(Hexokinase) AND FIREABLE(Ru5P_epimerase)))) : E (F (FIREABLE(Transketolase2))) : E (F (FIREABLE(Phosphoglycerate_mutase))) : E (F ((FIREABLE(Phosphoclucose_isomerase) AND FIREABLE(Phosphoglycerate_mutase) AND (FIREABLE(TIM_forward) OR FIREABLE(Ru5P_isomerase)) AND FIREABLE(Ru5P_isomerase) AND (FIREABLE(Hexokinase) OR (FIREABLE(Transaldolase) AND FIREABLE(generate)))))) : A (G ((NOT FIREABLE(Enolase) OR FIREABLE(GAP_dehydrogenase) OR (NOT FIREABLE(Phosphoclucose_isomerase) AND FIREABLE(TIM_forward) AND FIREABLE(Phosphoglycerate_mutase))))) : E (F ((FIREABLE(Lactate_dehydrogenase) AND (FIREABLE(Ru5P_epimerase) OR FIREABLE(Aldolase) OR NOT FIREABLE(Phosphoclucose_isomerase) OR (FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(G6P_dehydrogenase)))))) : E (F (((FIREABLE(TIM_backward) AND FIREABLE(Transaldolase) AND FIREABLE(Phosphoglycerate_kinase) AND NOT FIREABLE(Glutathione_oxidation) AND FIREABLE(Aldolase)) OR FIREABLE(Phosphoglycerate_mutase)))) : E (F ((FIREABLE(G6P_dehydrogenase) AND FIREABLE(Lactate_dehydrogenase) AND FIREABLE(Lactate_dehydrogenase) AND FIREABLE(GAP_dehydrogenase) AND (FIREABLE(TIM_backward) OR FIREABLE(Transketolase1) OR (FIREABLE(Aldolase) AND FIREABLE(Phosphoglycerate_kinase))) AND NOT FIREABLE(Transaldolase)))) : A (G ((FIREABLE(Hexokinase) OR NOT FIREABLE(G6P_dehydrogenase) OR FIREABLE(Pyruvate_kinase)))) : A (G ((NOT FIREABLE(Transketolase2) OR FIREABLE(Glutathione_oxidation)))) : A (G ((NOT FIREABLE(Enolase) OR NOT FIREABLE(Ru5P_isomerase)))) : A (G ((NOT FIREABLE(Phosphoclucose_isomerase) OR NOT FIREABLE(G6P_dehydrogenase))))
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 ((NOT FIREABLE(Phosphoglycerate_mutase) OR FIREABLE(Transaldolase) OR FIREABLE(Phosphofructokinase))))
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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara========================================

lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Pyruvate_kinase)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(Phosphofructokinase) AND NOT FIREABLE(Glutathione_oxidation) AND ((FIREABLE(G6P_dehydrogenase) AND FIREABLE(Hexokinase)) OR (FIREABLE(Phosphoglycerate_kinase) AND FIREABLE(Enolase))) AND FIREABLE(GAP_dehydrogenase))))
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 29 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-C1000N0000000010-ReachabilityFireability-2.sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Enolase)))
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-C1000N0000000010-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Pyruvate_kinase) AND FIREABLE(G6P_dehydrogenase) AND FIREABLE(Hexokinase) AND FIREABLE(Ru5P_epimerase))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability.sara.
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: 1: error near '': syntax error, unexpected $end, expecting PROBLEM
sara: error while parsing the sara problem file -- aborting [#05]
sara: see manual for a documentation of this error
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Transketolase2)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-5.sara
lola: The predicate is reachable.
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Phosphoglycerate_mutase)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-6.sara
lola: The predicate is reachable.
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Phosphoclucose_isomerase) AND FIREABLE(Phosphoglycerate_mutase) AND (FIREABLE(TIM_forward) OR FIREABLE(Ru5P_isomerase)) AND FIREABLE(Ru5P_isomerase) AND (FIREABLE(Hexokinase) OR (FIREABLE(Transaldolase) AND FIREABLE(generate))))))
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 38 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-7.sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2890573 markings, 7518330 edges, 578115 markings/sec, 0 secs
lola: sara is running 5 secs || 5690963 markings, 14709412 edges, 560078 markings/sec, 5 secs
lola: sara is running 10 secs || 8509500 markings, 21847010 edges, 563707 markings/sec, 10 secs
lola: sara is running 15 secs || 11387173 markings, 28926221 edges, 575535 markings/sec, 15 secs
lola: sara is running 20 secs || 14229565 markings, 35994751 edges, 568478 markings/sec, 20 secs
lola: sara is running 25 secs || 16919186 markings, 42953807 edges, 537924 markings/sec, 25 secs
lola: sara is running 30 secs || 19747543 markings, 49959965 edges, 565671 markings/sec, 30 secs
lola: sara is running 35 secs || 22705483 markings, 57086174 edges, 591588 markings/sec, 35 secs
lola: sara is running 40 secs || 25440036 markings, 64180588 edges, 546911 markings/sec, 40 secs
lola: sara is running 45 secs || 28352428 markings, 71250582 edges, 582478 markings/sec, 45 secs
lola: sara is running 50 secs || 30792215 markings, 77288444 edges, 487957 markings/sec, 50 secs
lola: sara is running 55 secs || 33593170 markings, 84509226 edges, 560191 markings/sec, 55 secs
lola: sara is running 60 secs || 36557023 markings, 91665411 edges, 592771 markings/sec, 60 secs
lola: sara is running 65 secs || 39449472 markings, 98993123 edges, 578490 markings/sec, 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Enolase) OR FIREABLE(GAP_dehydrogenase) OR (NOT FIREABLE(Phosphoclucose_isomerase) AND FIREABLE(TIM_forward) AND FIREABLE(Phosphoglycerate_mutase)))))
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 40 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Lactate_dehydrogenase) AND (FIREABLE(Ru5P_epimerase) OR FIREABLE(Aldolase) OR NOT FIREABLE(Phosphoclucose_isomerase) OR (FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(G6P_dehydrogenase))))))
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 28 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 577 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(TIM_backward) AND FIREABLE(Transaldolase) AND FIREABLE(Phosphoglycerate_kinase) AND NOT FIREABLE(Glutathione_oxidation) AND FIREABLE(Aldolase)) OR FIREABLE(Phosphoglycerate_mutase))))
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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 693 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(G6P_dehydrogenase) AND FIREABLE(Lactate_dehydrogenase) AND FIREABLE(Lactate_dehydrogenase) AND FIREABLE(GAP_dehydrogenase) AND (FIREABLE(TIM_backward) OR FIREABLE(Transketolase1) OR (FIREABLE(Aldolase) AND FIREABLE(Phosphoglycerate_kinase))) AND NOT FIREABLE(Transaldolase))))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 866 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Hexokinase) OR NOT FIREABLE(G6P_dehydrogenase) OR FIREABLE(Pyruvate_kinase))))
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 20 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-12.sara
lola: subprocess 13 will run for 1155 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Transketolase2) OR FIREABLE(Glutathione_oxidation))))
lola: ========================================
lola: SUBTASK
lola: 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-C1000N0000000010-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1733 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Enolase) OR NOT FIREABLE(Ru5P_isomerase))))
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-C1000N0000000010-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-12.sara.
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4208448 markings, 7421984 edges, 841690 markings/sec, 0 secs
lola: sara is running 5 secs || 8143472 markings, 14404628 edges, 787005 markings/sec, 5 secs
lola: sara is running 10 secs || 12137063 markings, 21505050 edges, 798718 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3452 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Phosphoclucose_isomerase) OR NOT FIREABLE(G6P_dehydrogenase))))
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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-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: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes yes yes no no yes yes yes no no yes yes
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494725100252

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