About the Execution of M4M.struct for GPPP-PT-C0100N0000000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.100 | 338382.00 | 570220.00 | 1366.00 | FTTTTTTFTTFFTT?F | 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 180K
-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 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 8.0K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 16K 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-C0100N0000000100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-blw7-152650007300315
=====================================================================
--------------------
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-C0100N0000000100-ReachabilityFireability-00
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-09
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-10
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-11
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-12
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-13
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-14
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1527614514004
BK_STOP 1527614852386
--------------------
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-C0100N0000000100 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': 582753, 'Memory': 15952.82, 'Tool': 'lola'}, {'Time': 669654, 'Memory': 15952.71, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola GPPP-PT-C0100N0000000100...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
GPPP-PT-C0100N0000000100: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000000100: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ GPPP-PT-C0100N0000000100 @ 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, 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-C0100N0000000100-ReachabilityFireability.task
lola: E (F ((FIREABLE(remove)))) : A (G ((FIREABLE(Phosphofructokinase) OR NOT FIREABLE(remove) OR (NOT FIREABLE(Phosphoglycerate_kinase) AND NOT FIREABLE(Phosphofructokinase) AND FIREABLE(Ru5P_epimerase) AND NOT FIREABLE(Glutathione_oxidation))))) : E (F (FIREABLE(Enolase))) : E (F (FIREABLE(Enolase))) : E (F (((NOT FIREABLE(Aldolase)) AND FIREABLE(Enolase) AND ((FIREABLE(Aldolase) AND FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Pyruvate_kinase)) OR FIREABLE(Phosphofructokinase))))) : A (G (())) : A (G ((NOT FIREABLE(remove) OR NOT FIREABLE(Transketolase1)))) : E (F (())) : E (F ((FIREABLE(GAP_dehydrogenase) AND (FIREABLE(Phosphoclucose_isomerase) OR (NOT FIREABLE(TIM_backward) AND NOT FIREABLE(Transketolase1)))))) : E (F ((FIREABLE(Glutathione_reductose) AND ((FIREABLE(Transaldolase) AND FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Hexokinase)) OR FIREABLE(generate))))) : A (G ((NOT FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(Aldolase) OR (NOT FIREABLE(Phosphoglycerate_mutase) AND NOT FIREABLE(TIM_backward)) OR NOT FIREABLE(Glutathione_reductose)))) : A (G ((NOT FIREABLE(Enolase) OR ((FIREABLE(TIM_forward) OR FIREABLE(Phosphoclucose_isomerase)) AND NOT FIREABLE(TIM_backward) AND FIREABLE(Glutathione_oxidation) AND FIREABLE(Phosphofructokinase))))) : A (G ((NOT FIREABLE(Glutathione_oxidation) OR NOT FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Transketolase1) OR NOT FIREABLE(G6P_dehydrogenase) OR NOT FIREABLE(Lactate_dehydrogenase)))) : A (G (())) : E (F ((FIREABLE(GAP_dehydrogenase) AND FIREABLE(generate) AND FIREABLE(Phosphoglycerate_kinase) AND NOT FIREABLE(Pyruvate_kinase)))) : E (F (FIREABLE(remove)))
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 ((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-C0100N0000000100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Phosphofructokinase) OR NOT FIREABLE(remove) OR (NOT FIREABLE(Phosphoglycerate_kinase) AND NOT FIREABLE(Phosphofructokinase) AND FIREABLE(Ru5P_epimerase) AND NOT FIREABLE(Glutathione_oxidation)))))
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 34 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 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-C0100N0000000100-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
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-C0100N0000000100-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(Aldolase)) AND FIREABLE(Enolase) AND ((FIREABLE(Aldolase) AND FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Pyruvate_kinase)) OR FIREABLE(Phosphofructokinase)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 214 markings, 213 edges
lola: ========================================
lola: subprocess 5 will run for 321 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-C0100N0000000100-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: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(remove) OR NOT FIREABLE(Transketolase1))))
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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 393 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-C0100N0000000100-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(GAP_dehydrogenase) AND (FIREABLE(Phosphoclucose_isomerase) OR (NOT FIREABLE(TIM_backward) AND NOT 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 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 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Glutathione_reductose) AND ((FIREABLE(Transaldolase) AND FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Hexokinase)) OR 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 17 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 409 markings, 408 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(Aldolase) OR (NOT FIREABLE(Phosphoglycerate_mutase) AND NOT FIREABLE(TIM_backward)) 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 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: 215 markings, 214 edges
state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Enolase) OR ((FIREABLE(TIM_forward) OR FIREABLE(Phosphoclucose_isomerase)) AND NOT FIREABLE(TIM_backward) AND FIREABLE(Glutathione_oxidation) AND 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 14 literals and 6 conjunctive subformulas
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-11.sara
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Glutathione_oxidation) OR NOT FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Transketolase1) OR NOT FIREABLE(G6P_dehydrogenase) OR NOT FIREABLE(Lactate_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 10 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1179 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-C0100N0000000100-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: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(GAP_dehydrogenase) AND FIREABLE(generate) AND FIREABLE(Phosphoglycerate_kinase) AND NOT 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 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4240089 markings, 10135278 edges, 848018 markings/sec, 0 secs
lola: sara is running 5 secs || 8317133 markings, 19598746 edges, 815409 markings/sec, 5 secs
lola: sara is running 10 secs || 12684780 markings, 27414486 edges, 873529 markings/sec, 10 secs
lola: sara is running 15 secs || 16861879 markings, 34875590 edges, 835420 markings/sec, 15 secs
lola: sara is running 20 secs || 20963542 markings, 42345369 edges, 820333 markings/sec, 20 secs
lola: sara is running 25 secs || 24992304 markings, 49593637 edges, 805752 markings/sec, 25 secs
lola: sara is running 30 secs || 29122585 markings, 56977926 edges, 826056 markings/sec, 30 secs
lola: sara is running 35 secs || 33257527 markings, 64374269 edges, 826988 markings/sec, 35 secs
lola: sara is running 40 secs || 37341815 markings, 71746186 edges, 816858 markings/sec, 40 secs
lola: sara is running 45 secs || 41519266 markings, 79125796 edges, 835490 markings/sec, 45 secs
lola: sara is running 50 secs || 45563473 markings, 86630780 edges, 808841 markings/sec, 50 secs
lola: sara is running 55 secs || 49782221 markings, 94117775 edges, 843750 markings/sec, 55 secs
lola: sara is running 60 secs || 54072168 markings, 101765520 edges, 857989 markings/sec, 60 secs
lola: sara is running 65 secs || 57849369 markings, 110148027 edges, 755440 markings/sec, 65 secs
lola: sara is running 70 secs || 60988475 markings, 118496984 edges, 627821 markings/sec, 70 secs
lola: sara is running 75 secs || 64045492 markings, 126633079 edges, 611403 markings/sec, 75 secs
lola: sara is running 80 secs || 66979677 markings, 134438325 edges, 586837 markings/sec, 80 secs
lola: sara is running 85 secs || 69930222 markings, 142290709 edges, 590109 markings/sec, 85 secs
lola: sara is running 90 secs || 72847208 markings, 150049859 edges, 583397 markings/sec, 90 secs
lola: sara is running 95 secs || 75804346 markings, 157919096 edges, 591428 markings/sec, 95 secs
lola: sara is running 100 secs || 78757967 markings, 165776217 edges, 590724 markings/sec, 100 secs
lola: sara is running 105 secs || 81689733 markings, 173574547 edges, 586353 markings/sec, 105 secs
lola: sara is running 110 secs || 84626173 markings, 181385449 edges, 587288 markings/sec, 110 secs
lola: sara is running 115 secs || 87551278 markings, 189166257 edges, 585021 markings/sec, 115 secs
lola: sara is running 120 secs || 90484621 markings, 196968433 edges, 586669 markings/sec, 120 secs
lola: sara is running 125 secs || 93422569 markings, 204782448 edges, 587590 markings/sec, 125 secs
lola: sara is running 130 secs || 96374612 markings, 212633925 edges, 590409 markings/sec, 130 secs
lola: sara is running 135 secs || 99326143 markings, 220486988 edges, 590306 markings/sec, 135 secs
lola: sara is running 140 secs || 102269039 markings, 228307873 edges, 588579 markings/sec, 140 secs
lola: sara is running 145 secs || 105215120 markings, 236140372 edges, 589216 markings/sec, 145 secs
lola: sara is running 150 secs || 108157688 markings, 243962937 edges, 588514 markings/sec, 150 secs
lola: sara is running 155 secs || 111106747 markings, 251802333 edges, 589812 markings/sec, 155 secs
lola: sara is running 160 secs || 114063895 markings, 259660615 edges, 591430 markings/sec, 160 secs
lola: sara is running 165 secs || 117023669 markings, 267525285 edges, 591955 markings/sec, 165 secs
lola: sara is running 170 secs || 119981641 markings, 275382439 edges, 591594 markings/sec, 170 secs
lola: sara is running 175 secs || 122868473 markings, 283045865 edges, 577366 markings/sec, 175 secs
lola: sara is running 180 secs || 125838116 markings, 290923838 edges, 593929 markings/sec, 180 secs
lola: sara is running 185 secs || 129178262 markings, 298710604 edges, 668029 markings/sec, 185 secs
lola: sara is running 190 secs || 132520486 markings, 306592874 edges, 668445 markings/sec, 190 secs
lola: sara is running 195 secs || 135935082 markings, 314402724 edges, 682919 markings/sec, 195 secs
lola: sara is running 200 secs || 139351935 markings, 322310414 edges, 683371 markings/sec, 200 secs
lola: sara is running 205 secs || 142810676 markings, 330498445 edges, 691748 markings/sec, 205 secs
lola: sara is running 210 secs || 146145864 markings, 338462679 edges, 667038 markings/sec, 210 secs
lola: sara is running 215 secs || 149603750 markings, 346647444 edges, 691577 markings/sec, 215 secs
lola: sara is running 220 secs || 152967165 markings, 354614050 edges, 672683 markings/sec, 220 secs
lola: sara is running 225 secs || 156472735 markings, 362692314 edges, 701114 markings/sec, 225 secs
lola: sara is running 230 secs || 159974364 markings, 370733374 edges, 700326 markings/sec, 230 secs
lola: sara is running 235 secs || 163457497 markings, 378725039 edges, 696627 markings/sec, 235 secs
lola: sara is running 240 secs || 166868526 markings, 386524296 edges, 682206 markings/sec, 240 secs
lola: sara is running 245 secs || 170370696 markings, 394566673 edges, 700434 markings/sec, 245 secs
lola: sara is running 250 secs || 173884990 markings, 402641278 edges, 702859 markings/sec, 250 secs
lola: sara is running 255 secs || 177337889 markings, 410551908 edges, 690580 markings/sec, 255 secs
lola: sara is running 260 secs || 180719388 markings, 418373129 edges, 676300 markings/sec, 260 secs
lola: sara is running 265 secs || 184021431 markings, 426281262 edges, 660409 markings/sec, 265 secs
lola: sara is running 270 secs || 186742674 markings, 433039589 edges, 544249 markings/sec, 270 secs
lola: sara is running 275 secs || 187628784 markings, 434739451 edges, 177222 markings/sec, 275 secs
lola: sara is running 280 secs || 187640009 markings, 434763639 edges, 2245 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3245 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-C0100N0000000100-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-15.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: RESULT
lola:
SUMMARY: no yes yes yes yes yes yes no yes yes no no yes yes unknown no
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-C0100N0000000100"
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-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 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-C0100N0000000100, 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-152650007300315"
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 '
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 ;