About the Execution of LoLA for GPPP-PT-C0100N0000000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3853.800 | 740790.00 | 1145228.00 | 85.10 | TTTFFTTTT?FFFFTT | 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 192K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.5K 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.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 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 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 lola
Input is GPPP-PT-C0100N0000000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998300306
=====================================================================
--------------------
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-C0100N0000000010-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526725975629
info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C0100N0000000010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C0100N0000000010 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ GPPP-PT-C0100N0000000010 @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 1056
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-C0100N0000000010-ReachabilityCardinality.task
lola: LP says that atomic proposition is always true: (S7P <= NADplus)
lola: LP says that atomic proposition is always true: (PEP <= NADplus)
lola: LP says that atomic proposition is always true: (2 <= NADplus)
lola: LP says that atomic proposition is always false: (2 <= E4P)
lola: LP says that atomic proposition is always false: (3 <= E4P)
lola: LP says that atomic proposition is always false: (2 <= R5P)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= S7P)
lola: LP says that atomic proposition is always false: (2 <= E4P)
lola: LP says that atomic proposition is always true: (3 <= NADplus)
lola: A (G (TRUE)) : E (F (((S7P + 1 <= _2PG) AND (DHAP + 1 <= NADH) AND (Xu5P <= E4P)))) : A (G (())) : E (F (((_1_3_BPG + 1 <= G6P) AND (ADP <= _1_3_BPG) AND (Lac <= 2) AND ((S7P <= Xu5P) OR (R5P <= GAP))))) : A (G ((Pyr <= _1_3_BPG))) : A (G (((2 <= Lac) OR (1 <= GSSG) OR ((1 <= _3PG) AND (2 <= NADH)) OR ((3 <= GSH))))) : A (G (((Pyr <= G6P) OR (1 <= ADP) OR (1 <= NADPH) OR (a2 <= FBP) OR (((3 <= c2) OR (Pyr <= Xu5P)) AND ((GAP <= Lac)))))) : E (F ((((Gluc + 1 <= R5P) OR (b1 + 1 <= _1_3_BPG)) AND ((ADP + 1 <= NADplus) OR (Lac <= 0))))) : E (F (((2 <= DHAP) AND (ATP <= _1_3_BPG)))) : E (F (FALSE)) : A (G (((G6P <= NADPplus) OR (1 <= c1)))) : E (F (FALSE)) : E (F (())) : E (F (())) : E (F (((NADPH <= Lac) AND (1 <= Lac) AND ((2 <= PEP) OR (ADP <= S7P)) AND ((_3PG <= GSSG) OR ((b2 <= S7P) AND (1 <= _1_3_BPG)))))) : A (G (TRUE))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 201 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.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:
========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.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:
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.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:
========================================FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.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: ========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.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: ========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.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: ========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.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: ========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Pyr <= _1_3_BPG)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((Pyr <= _1_3_BPG)))
lola: processed formula length: 25
lola: 23 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (_1_3_BPG + 1 <= Pyr)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-ReachabilityCardinality-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= DHAP) AND (ATP <= _1_3_BPG))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((2 <= DHAP) AND (ATP <= _1_3_BPG))))
lola: processed formula length: 43
lola: 22 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((2 <= DHAP) AND (ATP <= _1_3_BPG))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45 markings, 44 edges
lola: ========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((G6P <= NADPplus) OR (1 <= c1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((G6P <= NADPplus) OR (1 <= c1))))
lola: processed formula length: 41
lola: 23 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NADPplus + 1 <= G6P) AND (c1 <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= Lac) OR (1 <= GSSG) OR ((1 <= _3PG) AND (2 <= NADH)) OR ((3 <= GSH)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((2 <= Lac) OR (1 <= GSSG) OR ((1 <= _3PG) AND (2 <= NADH)) OR ((3 <= GSH)))))
lola: processed formula length: 87
lola: 23 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Lac <= 1) AND (GSSG <= 0) AND ((_3PG <= 0) OR (NADH <= 1)) AND ((GSH <= 2)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000010-ReachabilityCardinality-10-0.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: ========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((S7P + 1 <= _2PG) AND (DHAP + 1 <= NADH) AND (Xu5P <= E4P))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((S7P + 1 <= _2PG) AND (DHAP + 1 <= NADH) AND (Xu5P <= E4P))))
lola: processed formula length: 68
lola: 22 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((S7P + 1 <= _2PG) AND (DHAP + 1 <= NADH) AND (Xu5P <= E4P))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 29 edges
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-ReachabilityCardinality-11-0.sara
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((Gluc + 1 <= R5P) OR (b1 + 1 <= _1_3_BPG)) AND ((ADP + 1 <= NADplus) OR (Lac <= 0)))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((Gluc + 1 <= R5P) OR (b1 + 1 <= _1_3_BPG)) AND ((ADP + 1 <= NADplus) OR (Lac <= 0)))))
lola: processed formula length: 96
lola: 22 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((Gluc + 1 <= R5P) OR (b1 + 1 <= _1_3_BPG)) AND ((ADP + 1 <= NADplus) OR (Lac <= 0)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000010-ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2836597 markings, 9980424 edges, 567319 markings/sec, 0 secs
lola: sara is running 5 secs || 5478786 markings, 19525007 edges, 528438 markings/sec, 5 secs
lola: sara is running 10 secs || 8090875 markings, 28894639 edges, 522418 markings/sec, 10 secs
lola: sara is running 15 secs || 10725842 markings, 38037920 edges, 526993 markings/sec, 15 secs
lola: sara is running 20 secs || 13398743 markings, 47579990 edges, 534580 markings/sec, 20 secs
lola: sara is running 25 secs || 15894579 markings, 56615588 edges, 499167 markings/sec, 25 secs
lola: sara is running 30 secs || 18249436 markings, 65522550 edges, 470971 markings/sec, 30 secs
lola: sara is running 35 secs || 20786315 markings, 74716172 edges, 507376 markings/sec, 35 secs
lola: sara is running 40 secs || 23370368 markings, 84022191 edges, 516811 markings/sec, 40 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23792732 markings, 85585601 edges
lola: ========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1058 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((_1_3_BPG + 1 <= G6P) AND (ADP <= _1_3_BPG) AND (Lac <= 2) AND ((S7P <= Xu5P) OR (R5P <= GAP)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((_1_3_BPG + 1 <= G6P) AND (ADP <= _1_3_BPG) AND (Lac <= 2) AND ((S7P <= Xu5P) OR (R5P <= GAP)))))
lola: processed formula length: 105
lola: 22 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((_1_3_BPG + 1 <= G6P) AND (ADP <= _1_3_BPG) AND (Lac <= 2) AND ((S7P <= Xu5P) OR (R5P <= GAP)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000010-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3305329 markings, 10261750 edges, 661066 markings/sec, 0 secs
lola: sara is running 5 secs || 6872672 markings, 19633473 edges, 713469 markings/sec, 5 secs
lola: sara is running 10 secs || 10034089 markings, 28897654 edges, 632283 markings/sec, 10 secs
lola: sara is running 15 secs || 12968095 markings, 37885299 edges, 586801 markings/sec, 15 secs
lola: sara is running 20 secs || 16033412 markings, 46719172 edges, 613063 markings/sec, 20 secs
lola: sara is running 25 secs || 19063792 markings, 55859966 edges, 606076 markings/sec, 25 secs
lola: sara is running 30 secs || 21626433 markings, 64314364 edges, 512528 markings/sec, 30 secs
lola: sara is running 35 secs || 24120720 markings, 72750224 edges, 498857 markings/sec, 35 secs
lola: sara is running 40 secs || 26563722 markings, 81530821 edges, 488600 markings/sec, 40 secs
lola: sara is running 45 secs || 28891909 markings, 90076533 edges, 465637 markings/sec, 45 secs
lola: sara is running 50 secs || 31332107 markings, 98824789 edges, 488040 markings/sec, 50 secs
lola: sara is running 55 secs || 33828844 markings, 108020852 edges, 499347 markings/sec, 55 secs
lola: sara is running 60 secs || 35909517 markings, 116502207 edges, 416135 markings/sec, 60 secs
lola: sara is running 65 secs || 38274331 markings, 125208648 edges, 472963 markings/sec, 65 secs
lola: sara is running 70 secs || 40580469 markings, 133787083 edges, 461228 markings/sec, 70 secs
lola: sara is running 75 secs || 43053548 markings, 142930768 edges, 494616 markings/sec, 75 secs
lola: sara is running 80 secs || 45257340 markings, 151555552 edges, 440758 markings/sec, 80 secs
lola: sara is running 85 secs || 47551287 markings, 160107470 edges, 458789 markings/sec, 85 secs
lola: sara is running 90 secs || 49916199 markings, 168952922 edges, 472982 markings/sec, 90 secs
lola: sara is running 95 secs || 52291523 markings, 177325320 edges, 475065 markings/sec, 95 secs
lola: sara is running 100 secs || 54305966 markings, 185187797 edges, 402889 markings/sec, 100 secs
lola: sara is running 105 secs || 56010838 markings, 193194866 edges, 340974 markings/sec, 105 secs
lola: sara is running 110 secs || 58066389 markings, 201340777 edges, 411110 markings/sec, 110 secs
lola: sara is running 115 secs || 59905905 markings, 209283852 edges, 367903 markings/sec, 115 secs
lola: sara is running 120 secs || 61868044 markings, 217259468 edges, 392428 markings/sec, 120 secs
lola: sara is running 125 secs || 63972657 markings, 225286748 edges, 420923 markings/sec, 125 secs
lola: sara is running 130 secs || 66624766 markings, 233803626 edges, 530422 markings/sec, 130 secs
lola: sara is running 135 secs || 68921325 markings, 242485024 edges, 459312 markings/sec, 135 secs
lola: sara is running 140 secs || 71066431 markings, 250752471 edges, 429021 markings/sec, 140 secs
lola: sara is running 145 secs || 72789549 markings, 258504621 edges, 344624 markings/sec, 145 secs
lola: sara is running 150 secs || 74702684 markings, 266446851 edges, 382627 markings/sec, 150 secs
lola: sara is running 155 secs || 76602218 markings, 274193191 edges, 379907 markings/sec, 155 secs
lola: sara is running 160 secs || 78504721 markings, 282182401 edges, 380501 markings/sec, 160 secs
lola: sara is running 165 secs || 80896462 markings, 290731147 edges, 478348 markings/sec, 165 secs
lola: sara is running 170 secs || 83176980 markings, 299191543 edges, 456104 markings/sec, 170 secs
lola: sara is running 175 secs || 85003099 markings, 306069668 edges, 365224 markings/sec, 175 secs
lola: sara is running 180 secs || 86866888 markings, 313557366 edges, 372758 markings/sec, 180 secs
lola: sara is running 185 secs || 88757147 markings, 321306625 edges, 378052 markings/sec, 185 secs
lola: sara is running 190 secs || 90564232 markings, 328922772 edges, 361417 markings/sec, 190 secs
lola: sara is running 195 secs || 92538875 markings, 336822656 edges, 394929 markings/sec, 195 secs
lola: sara is running 200 secs || 94659367 markings, 344461600 edges, 424098 markings/sec, 200 secs
lola: sara is running 205 secs || 96731508 markings, 352313615 edges, 414428 markings/sec, 205 secs
lola: sara is running 210 secs || 98994709 markings, 360501764 edges, 452640 markings/sec, 210 secs
lola: sara is running 215 secs || 101066776 markings, 368355228 edges, 414413 markings/sec, 215 secs
lola: sara is running 220 secs || 103135777 markings, 376205530 edges, 413800 markings/sec, 220 secs
lola: sara is running 225 secs || 105195537 markings, 384027436 edges, 411952 markings/sec, 225 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 105796064 markings, 386103936 edges
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NADPH <= Lac) AND (1 <= Lac) AND ((2 <= PEP) OR (ADP <= S7P)) AND ((_3PG <= GSSG) OR ((b2 <= S7P) AND (1 <= _1_3_BPG))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NADPH <= Lac) AND (1 <= Lac) AND ((2 <= PEP) OR (ADP <= S7P)) AND ((_3PG <= GSSG) OR ((b2 <= S7P) AND (1 <= _1_3_BPG))))))
lola: processed formula length: 132
lola: 22 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((NADPH <= Lac) AND (1 <= Lac) AND ((2 <= PEP) OR (ADP <= S7P)) AND ((_3PG <= GSSG) OR ((b2 <= S7P) AND (1 <= _1_3_BPG))))
lola: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000010-ReachabilityCardinality-14-0.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: 1918107 markings, 5251082 edges
lola: ========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2939 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Pyr <= G6P) OR (1 <= ADP) OR (1 <= NADPH) OR (a2 <= FBP) OR (((3 <= c2) OR (Pyr <= Xu5P)) AND ((GAP <= Lac))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((Pyr <= G6P) OR (1 <= ADP) OR (1 <= NADPH) OR (a2 <= FBP) OR (((3 <= c2) OR (Pyr <= Xu5P)) AND ((GAP <= Lac))))))
lola: processed formula length: 125
lola: 23 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((G6P + 1 <= Pyr) AND (ADP <= 0) AND (NADPH <= 0) AND (FBP + 1 <= a2) AND (((c2 <= 2) AND (Xu5P + 1 <= Pyr)) OR ((Lac + 1 <= GAP))))
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000010-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4591942 markings, 8200095 edges, 918388 markings/sec, 0 secs
lola: sara is running 5 secs || 8832286 markings, 15788358 edges, 848069 markings/sec, 5 secs
lola: sara is running 10 secs || 13354012 markings, 23724451 edges, 904345 markings/sec, 10 secs
lola: sara is running 15 secs || 17726482 markings, 31144957 edges, 874494 markings/sec, 15 secs
lola: sara is running 20 secs || 21882671 markings, 38455708 edges, 831238 markings/sec, 20 secs
lola: sara is running 25 secs || 26362066 markings, 46087007 edges, 895879 markings/sec, 25 secs
lola: sara is running 30 secs || 30487523 markings, 53197009 edges, 825091 markings/sec, 30 secs
lola: sara is running 35 secs || 34769493 markings, 60732025 edges, 856394 markings/sec, 35 secs
lola: sara is running 40 secs || 39230808 markings, 68140486 edges, 892263 markings/sec, 40 secs
lola: sara is running 45 secs || 43632728 markings, 75754844 edges, 880384 markings/sec, 45 secs
lola: sara is running 50 secs || 47854543 markings, 82945502 edges, 844363 markings/sec, 50 secs
lola: sara is running 55 secs || 52169364 markings, 90422778 edges, 862964 markings/sec, 55 secs
lola: sara is running 60 secs || 56893477 markings, 98442006 edges, 944823 markings/sec, 60 secs
lola: sara is running 65 secs || 61575905 markings, 106398357 edges, 936486 markings/sec, 65 secs
lola: sara is running 70 secs || 66160776 markings, 114254076 edges, 916974 markings/sec, 70 secs
lola: sara is running 75 secs || 70636286 markings, 121906631 edges, 895102 markings/sec, 75 secs
lola: sara is running 80 secs || 75394739 markings, 129888249 edges, 951691 markings/sec, 80 secs
lola: sara is running 85 secs || 80139277 markings, 138009070 edges, 948908 markings/sec, 85 secs
lola: sara is running 90 secs || 84933843 markings, 146083759 edges, 958913 markings/sec, 90 secs
lola: sara is running 95 secs || 89789472 markings, 154233336 edges, 971126 markings/sec, 95 secs
lola: sara is running 100 secs || 94714475 markings, 162439542 edges, 985001 markings/sec, 100 secs
lola: sara is running 105 secs || 99622086 markings, 170772525 edges, 981522 markings/sec, 105 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 99806178 markings, 171090727 edges
lola: ========================================
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes yes yes yes no no no no no yes yes
lola:
preliminary result: yes yes yes no no yes yes yes yes no no no no no yes yes
lola: memory consumption: 25156 KB
lola: time consumption: 741 seconds
BK_STOP 1526726716419
--------------------
content from 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-C0100N0000000010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000010.tgz
mv GPPP-PT-C0100N0000000010 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 lola"
echo " Input is GPPP-PT-C0100N0000000010, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-blw7-152649998300306"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;