fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r091-blw7-152650003500252
Last Updated
June 26, 2018

About the Execution of Irma.struct for GPPP-PT-C0001N0000000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
428.360 43599.00 4850.00 178.10 TFTFTTFFFTFFFTFT 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)
.................
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 4.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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 irma4mcc-structural
Input is GPPP-PT-C0001N0000000010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-blw7-152650003500252
=====================================================================


--------------------
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-C0001N0000000010-ReachabilityFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1527196784063


BK_STOP 1527196827662

--------------------
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-C0001N0000000010 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': 235, 'Memory': 111.12, 'Tool': 'lola'}, {'Time': 277, 'Memory': 111.78, 'Tool': 'lola'}, {'Time': 2607, 'Memory': 114.99, 'Tool': 'gspn'}, {'Time': 4979, 'Memory': 315.74, 'Tool': 'itstools'}, {'Time': 5195, 'Memory': 153.62, 'Tool': 'gspn'}, {'Time': 5463, 'Memory': 325.54, 'Tool': 'itstools'}, {'Time': 7121, 'Memory': 7483.46, 'Tool': 'marcie'}, {'Time': 7466, 'Memory': 7482.7, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola GPPP-PT-C0001N0000000010...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
GPPP-PT-C0001N0000000010: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ GPPP-PT-C0001N0000000010 @ 3540 seconds
----- Start make result stderr -----
----- 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, 20 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-C0001N0000000010-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(G6P_dehydrogenase) OR NOT FIREABLE(Pyruvate_kinase) OR (NOT FIREABLE(Phosphoglycerate_mutase) AND NOT FIREABLE(Phosphoglycerate_kinase)) OR NOT FIREABLE(generate) OR NOT FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Transketolase2)))) : E (F ((FIREABLE(Enolase) AND FIREABLE(TIM_forward) AND FIREABLE(Pyruvate_kinase) AND FIREABLE(remove) AND (((FIREABLE(Glutathione_reductose) OR FIREABLE(Phosphofructokinase)) AND FIREABLE(Ru5P_epimerase)) OR (NOT FIREABLE(Transketolase2) AND NOT FIREABLE(Ru5P_isomerase)))))) : A (G ((NOT FIREABLE(GAP_dehydrogenase) OR NOT FIREABLE(Transaldolase) OR NOT FIREABLE(Enolase) OR NOT FIREABLE(GAP_dehydrogenase) OR FIREABLE(Aldolase)))) : E (F ((FIREABLE(Transaldolase) AND FIREABLE(Hexokinase) AND FIREABLE(GAP_dehydrogenase) AND FIREABLE(Phosphoglycerate_mutase)))) : E (F ((NOT FIREABLE(Transketolase2) AND NOT FIREABLE(Transaldolase) AND FIREABLE(Glutathione_oxidation) AND FIREABLE(Lactate_dehydrogenase) AND (FIREABLE(Ru5P_epimerase) OR (FIREABLE(Transketolase1) AND FIREABLE(Aldolase)))))) : A (G ((NOT FIREABLE(remove) OR NOT FIREABLE(Enolase) OR FIREABLE(Hexokinase) OR ((FIREABLE(Transketolase1) OR FIREABLE(Phosphoclucose_isomerase) OR FIREABLE(Phosphofructokinase) OR FIREABLE(GAP_dehydrogenase)) AND (FIREABLE(Lactate_dehydrogenase) OR FIREABLE(G6P_dehydrogenase) OR NOT FIREABLE(GAP_dehydrogenase)))))) : E (F (())) : E (F ((FIREABLE(Phosphofructokinase) AND FIREABLE(Phosphoclucose_isomerase) AND (FIREABLE(GAP_dehydrogenase) OR FIREABLE(Aldolase))))) : E (F ((NOT FIREABLE(TIM_forward) AND (FIREABLE(Ru5P_isomerase) OR FIREABLE(Hexokinase)) AND FIREABLE(Transketolase2) AND (FIREABLE(Aldolase) OR ((FIREABLE(TIM_backward) OR FIREABLE(remove)) AND (FIREABLE(Phosphoglycerate_kinase) OR FIREABLE(Transketolase2))))))) : E (F (FIREABLE(remove))) : A (G (NOT FIREABLE(remove))) : E (F ((FIREABLE(Transaldolase) AND FIREABLE(Ru5P_isomerase) AND FIREABLE(Enolase) AND FIREABLE(Pyruvate_kinase) AND FIREABLE(Aldolase) AND (((FIREABLE(Glutathione_oxidation) OR FIREABLE(Transketolase2)) AND NOT FIREABLE(Hexokinase)) OR FIREABLE(Transketolase1))))) : E (F ((NOT FIREABLE(Phosphoglycerate_mutase) AND NOT FIREABLE(Lactate_dehydrogenase) AND FIREABLE(TIM_forward) AND FIREABLE(Phosphoglycerate_kinase) AND FIREABLE(Phosphoclucose_isomerase)))) : A (G ((NOT FIREABLE(G6P_dehydrogenase) OR NOT FIREABLE(Lactate_dehydrogenase) OR FIREABLE(Phosphoclucose_isomerase) OR NOT FIREABLE(remove)))) : A (G ((NOT FIREABLE(GAP_dehydrogenase) OR NOT FIREABLE(Transketolase2) OR NOT FIREABLE(Pyruvate_kinase) OR NOT FIREABLE(Glutathione_reductose)))) : A (G (()))
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(G6P_dehydrogenase) OR NOT FIREABLE(Pyruvate_kinase) OR (NOT FIREABLE(Phosphoglycerate_mutase) AND NOT FIREABLE(Phosphoglycerate_kinase)) OR NOT FIREABLE(generate) OR NOT FIREABLE(Ru5P_isomerase) 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 80 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 23 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-ReachabilityFireability.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 7027 markings, 12010 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Enolase) AND FIREABLE(TIM_forward) AND FIREABLE(Pyruvate_kinase) AND FIREABLE(remove) AND (((FIREABLE(Glutathione_reductose) OR FIREABLE(Phosphofructokinase)) AND FIREABLE(Ru5P_epimerase)) OR (NOT FIREABLE(Transketolase2) AND NOT FIREABLE(Ru5P_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 80 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 52 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000010-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 12846 markings, 23814 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(GAP_dehydrogenase) OR NOT FIREABLE(Transaldolase) OR NOT FIREABLE(Enolase) OR NOT FIREABLE(GAP_dehydrogenase) OR FIREABLE(Aldolase))))
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 80 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 13 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000010-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 10285 markings, 19174 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Transaldolase) AND FIREABLE(Hexokinase) AND FIREABLE(GAP_dehydrogenase) AND 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 80 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 10 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000010-ReachabilityFireability-3.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(Transketolase2) AND NOT FIREABLE(Transaldolase) AND FIREABLE(Glutathione_oxidation) AND FIREABLE(Lactate_dehydrogenase) AND (FIREABLE(Ru5P_epimerase) OR (FIREABLE(Transketolase1) AND FIREABLE(Aldolase))))))
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 80 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 66 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-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: 403 markings, 415 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(remove) OR NOT FIREABLE(Enolase) OR FIREABLE(Hexokinase) OR ((FIREABLE(Transketolase1) OR FIREABLE(Phosphoclucose_isomerase) OR FIREABLE(Phosphofructokinase) OR FIREABLE(GAP_dehydrogenase)) AND (FIREABLE(Lactate_dehydrogenase) OR FIREABLE(G6P_dehydrogenase) OR NOT FIREABLE(GAP_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 80 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 632 literals and 76 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000010-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 10599 markings, 20771 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000010-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Phosphofructokinase) AND FIREABLE(Phosphoclucose_isomerase) AND (FIREABLE(GAP_dehydrogenase) OR FIREABLE(Aldolase)))))
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 80 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 13 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000010-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 12519 markings, 31714 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(TIM_forward) AND (FIREABLE(Ru5P_isomerase) OR FIREABLE(Hexokinase)) AND FIREABLE(Transketolase2) AND (FIREABLE(Aldolase) OR ((FIREABLE(TIM_backward) OR FIREABLE(remove)) AND (FIREABLE(Phosphoglycerate_kinase) OR 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 80 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 80 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000010-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 9252 markings, 19621 edges
lola: ========================================
lola: subprocess 9 will run for 505 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 80 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-C0001N0000000010-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 67 markings, 66 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (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 80 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-C0001N0000000010-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 67 markings, 66 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Transaldolase) AND FIREABLE(Ru5P_isomerase) AND FIREABLE(Enolase) AND FIREABLE(Pyruvate_kinase) AND FIREABLE(Aldolase) AND (((FIREABLE(Glutathione_oxidation) OR FIREABLE(Transketolase2)) AND NOT FIREABLE(Hexokinase)) OR FIREABLE(Transketolase1)))))
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 80 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 57 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000010-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 23645 markings, 43401 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(Phosphoglycerate_mutase) AND NOT FIREABLE(Lactate_dehydrogenase) AND FIREABLE(TIM_forward) AND FIREABLE(Phosphoglycerate_kinase) AND 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 80 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 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000010-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 11945 markings, 24126 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(G6P_dehydrogenase) OR NOT FIREABLE(Lactate_dehydrogenase) OR FIREABLE(Phosphoclucose_isomerase) 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 80 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 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000010-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 6786 markings, 10778 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(GAP_dehydrogenase) OR NOT FIREABLE(Transketolase2) OR NOT FIREABLE(Pyruvate_kinase) OR NOT FIREABLE(Glutathione_reductose))))
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 80 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 10 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000010-ReachabilityFireability-14.sara
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000010-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes no no no yes no no no yes no yes
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000010-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 stderr -----
----- Finished stdout -----

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-C0001N0000000010"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-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-C0001N0000000010.tgz
mv GPPP-PT-C0001N0000000010 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 irma4mcc-structural"
echo " Input is GPPP-PT-C0001N0000000010, 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 r091-blw7-152650003500252"
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 ;