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)
................
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
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 r095-blw7-152650007300343
=====================================================================

--------------------
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-00
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-09
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

=== Now, execution of the tool begins

BK_START 1527627801680


BK_STOP 1527628023764

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using GPPP-PT-C1000N0000000010 as instance name.
Using GPPP as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 23577, 'Memory': 7707.49, 'Tool': 'marcie'}, {'Time': 26000, 'Memory': 7707.49, 'Tool': 'marcie'}, {'Time': 87228, 'Memory': 3351.25, 'Tool': 'lola'}, {'Time': 87937, 'Memory': 3321.87, 'Tool': 'lola'}, {'Time': 111778, 'Memory': 3173.28, 'Tool': 'itstools'}, {'Time': 114418, 'Memory': 3138.17, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 3.6997073419010054x far from the best tool marcie.
ReachabilityFireability lola GPPP-PT-C1000N0000000010...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
GPPP-PT-C1000N0000000010: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ GPPP-PT-C1000N0000000010 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 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: E (F (((NOT FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Lactate_dehydrogenase)) AND FIREABLE(Pyruvate_kinase) AND (FIREABLE(G6P_dehydrogenase) OR FIREABLE(Transaldolase) OR NOT FIREABLE(Pyruvate_kinase)) AND FIREABLE(Lactate_dehydrogenase)))) : E (F ((FIREABLE(Enolase) AND (FIREABLE(Transketolase1) OR FIREABLE(Aldolase) OR (FIREABLE(remove) AND FIREABLE(Phosphoclucose_isomerase)) OR FIREABLE(Aldolase) OR (FIREABLE(TIM_backward) AND FIREABLE(Hexokinase)))))) : E (F (FIREABLE(remove))) : A (G ((FIREABLE(remove) OR FIREABLE(Glutathione_reductose) OR NOT FIREABLE(Transketolase2)))) : E (F (((FIREABLE(GAP_dehydrogenase) OR (NOT FIREABLE(generate) AND NOT FIREABLE(Glutathione_oxidation))) AND (FIREABLE(remove) OR FIREABLE(Enolase))))) : A (G (NOT FIREABLE(Pyruvate_kinase))) : E (F ((NOT FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(Glutathione_oxidation) AND (NOT FIREABLE(Ru5P_epimerase) OR NOT FIREABLE(Glutathione_reductose)) AND FIREABLE(Lactate_dehydrogenase)))) : E (F ((FIREABLE(remove) AND FIREABLE(TIM_forward) AND (FIREABLE(Hexokinase) OR NOT FIREABLE(Ru5P_epimerase)) AND (NOT FIREABLE(Phosphoglycerate_kinase) OR NOT FIREABLE(G6P_dehydrogenase)) AND FIREABLE(Hexokinase)))) : A (G ((FIREABLE(Phosphoglycerate_mutase) OR FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(TIM_forward) OR NOT FIREABLE(Lactate_dehydrogenase) OR FIREABLE(Phosphofructokinase)))) : E (F ((FIREABLE(Pyruvate_kinase) AND FIREABLE(Transketolase1) AND (FIREABLE(Aldolase) OR FIREABLE(Transketolase2)) AND (NOT FIREABLE(Aldolase)) AND (NOT FIREABLE(remove) OR NOT FIREABLE(TIM_forward) OR FIREABLE(Phosphoclucose_isomerase))))) : E (F (FIREABLE(remove))) : A (G ((FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(generate) OR NOT FIREABLE(Enolase) OR NOT FIREABLE(Pyruvate_kinase)))) : A (G (((FIREABLE(TIM_backward)) OR NOT FIREABLE(remove)))) : E (F (((FIREABLE(remove) AND FIREABLE(Glutathione_oxidation)) OR FIREABLE(Enolase)))) : E (F (FIREABLE(Enolase))) : E (F (((NOT FIREABLE(GAP_dehydrogenase) OR NOT FIREABLE(Ru5P_epimerase)) AND (FIREABLE(GAP_dehydrogenase) OR FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Aldolase)) AND FIREABLE(Pyruvate_kinase))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Lactate_dehydrogenase)) AND FIREABLE(Pyruvate_kinase) AND (FIREABLE(G6P_dehydrogenase) OR FIREABLE(Transaldolase) OR NOT FIREABLE(Pyruvate_kinase)) AND FIREABLE(Lactate_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 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52892 markings, 111276 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Enolase) AND (FIREABLE(Transketolase1) OR FIREABLE(Aldolase) OR (FIREABLE(remove) AND FIREABLE(Phosphoclucose_isomerase)) OR FIREABLE(Aldolase) OR (FIREABLE(TIM_backward) AND FIREABLE(Hexokinase))))))
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 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(remove)))
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-C1000N0000000010-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability.sara.
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(remove) OR FIREABLE(Glutathione_reductose) OR NOT FIREABLE(Transketolase2))))
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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(GAP_dehydrogenase) OR (NOT FIREABLE(generate) AND NOT FIREABLE(Glutathione_oxidation))) AND (FIREABLE(remove) OR 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 18 literals and 4 conjunctive subformulas
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-3.sara.
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(Pyruvate_kinase)))
lola: ========================================
lola: SUBTASK
lola: sara: place or transition ordering is non-deterministic
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: SUBRESULT
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-5.sara
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(Glutathione_oxidation) AND (NOT FIREABLE(Ru5P_epimerase) OR NOT FIREABLE(Glutathione_reductose)) AND FIREABLE(Lactate_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 40 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.

lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(remove) AND FIREABLE(TIM_forward) AND (FIREABLE(Hexokinase) OR NOT FIREABLE(Ru5P_epimerase)) AND (NOT FIREABLE(Phosphoglycerate_kinase) OR NOT FIREABLE(G6P_dehydrogenase)) AND FIREABLE(Hexokinase))))
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 110 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-7.sara
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 || 4151636 markings, 8549077 edges, 830327 markings/sec, 0 secs
lola: sara is running 5 secs || 7481510 markings, 16990732 edges, 665975 markings/sec, 5 secs
lola: sara is running 10 secs || 11259936 markings, 25035494 edges, 755685 markings/sec, 10 secs
lola: sara is running 15 secs || 14329609 markings, 32833824 edges, 613935 markings/sec, 15 secs
lola: sara is running 20 secs || 18077675 markings, 40552399 edges, 749613 markings/sec, 20 secs
lola: sara is running 25 secs || 21483758 markings, 48198792 edges, 681217 markings/sec, 25 secs
lola: sara is running 30 secs || 24613117 markings, 55923897 edges, 625872 markings/sec, 30 secs
lola: sara is running 35 secs || 27684944 markings, 63126070 edges, 614365 markings/sec, 35 secs
lola: sara is running 40 secs || 30487250 markings, 70271078 edges, 560461 markings/sec, 40 secs
lola: sara is running 45 secs || 34319599 markings, 77672458 edges, 766470 markings/sec, 45 secs
lola: sara is running 50 secs || 37475461 markings, 85135059 edges, 631172 markings/sec, 50 secs
lola: sara is running 55 secs || 40543502 markings, 92568550 edges, 613608 markings/sec, 55 secs
lola: sara is running 60 secs || 43685997 markings, 99730654 edges, 628499 markings/sec, 60 secs
lola: sara is running 65 secs || 47016154 markings, 106823179 edges, 666031 markings/sec, 65 secs
lola: sara is running 70 secs || 49987405 markings, 113618421 edges, 594250 markings/sec, 70 secs
lola: sara is running 75 secs || 52568560 markings, 120751884 edges, 516231 markings/sec, 75 secs
lola: sara is running 80 secs || 55185263 markings, 127990966 edges, 523341 markings/sec, 80 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 56304744 markings, 131050265 edges
lola: ========================================
lola: subprocess 8 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Phosphoglycerate_mutase) OR FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(TIM_forward) OR NOT FIREABLE(Lactate_dehydrogenase) 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 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: lola: state equation: calling and running sara
result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 255 markings, 254 edges
lola: ========================================
lola: subprocess 9 will run for 493 seconds at most (--localtimelimit=-1)
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-8.sara.
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Pyruvate_kinase) AND FIREABLE(Transketolase1) AND (FIREABLE(Aldolase) OR FIREABLE(Transketolase2)) AND (NOT FIREABLE(Aldolase)) AND (NOT FIREABLE(remove) OR NOT FIREABLE(TIM_forward) OR FIREABLE(Phosphoclucose_isomerase)))))
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: place or transition ordering is non-deterministic
lola: state equation: Generated DNF with 33 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-9.sara

lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 575 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(remove)))
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-C1000N0000000010-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 690 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(generate) OR NOT FIREABLE(Enolase) OR NOT 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4813656 markings, 8260772 edges, 962731 markings/sec, 0 secs
lola: sara is running 5 secs || 8885912 markings, 15968532 edges, 814451 markings/sec, 5 secs
lola: sara is running 10 secs || 13254483 markings, 23460409 edges, 873714 markings/sec, 10 secs
lola: sara is running 15 secs || 17245672 markings, 30611915 edges, 798238 markings/sec, 15 secs
lola: sara is running 20 secs || 21433804 markings, 37823006 edges, 837626 markings/sec, 20 secs
lola: sara is running 25 secs || 24974457 markings, 44481816 edges, 708131 markings/sec, 25 secs
lola: sara is running 30 secs || 29222884 markings, 51467711 edges, 849685 markings/sec, 30 secs
lola: sara is running 35 secs || 33407779 markings, 58472520 edges, 836979 markings/sec, 35 secs
lola: sara is running 40 secs || 36970658 markings, 64834224 edges, 712576 markings/sec, 40 secs
lola: sara is running 45 secs || 40331849 markings, 71727325 edges, 672238 markings/sec, 45 secs
lola: sara is running 50 secs || 43555844 markings, 78610864 edges, 644799 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 44399935 markings, 80442883 edges
lola: ========================================
lola: subprocess 12 will run for 848 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(TIM_backward)) OR NOT FIREABLE(remove))))
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-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4707310 markings, 8258906 edges, 941462 markings/sec, 0 secs
lola: sara is running 5 secs || 9123986 markings, 15995107 edges, 883335 markings/sec, 5 secs
lola: sara is running 10 secs || 13399344 markings, 23478085 edges, 855072 markings/sec, 10 secs
lola: sara is running 15 secs || 17480910 markings, 30688523 edges, 816313 markings/sec, 15 secs
lola: sara is running 20 secs || 21713287 markings, 37627280 edges, 846475 markings/sec, 20 secs
lola: sara is running 25 secs || 25200251 markings, 44418559 edges, 697393 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 27785396 markings, 49622705 edges
lola: ========================================
lola: subprocess 13 will run for 1120 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(remove) AND FIREABLE(Glutathione_oxidation)) OR 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 14 will run for 1680 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 15 will run for 3360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(GAP_dehydrogenase) OR NOT FIREABLE(Ru5P_epimerase)) AND (FIREABLE(GAP_dehydrogenase) OR FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Aldolase)) AND 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: SUBRESULT
lola: state equation: Generated DNF with 63 literals and 13 conjunctive subformulas
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes no yes no no no no yes yes yes yes yes
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-0 TRUE 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 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-3 FALSE 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 FALSE 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 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-10 FALSE 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 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-13 TRUE 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 stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- 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="mcc4mcc-structural"
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
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
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 r095-blw7-152650007300343"
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 ;