About the Execution of LoLA for NeighborGrid-PT-d4n3m2c23
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15917.520 | 2052659.00 | 2141887.00 | 1273.50 | FFTTTFTFTTFFFT?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 644K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 469K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeighborGrid-PT-d4n3m2c23, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469200227
=====================================================================
--------------------
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 NeighborGrid-PT-d4n3m2c23-CTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527021776690
info: Time: 3600 - MCC
===========================================================================================
prep: translating NeighborGrid-PT-d4n3m2c23 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating NeighborGrid-PT-d4n3m2c23 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ NeighborGrid-PT-d4n3m2c23 @ 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: 1713/65536 symbol table entries, 509 collisions
lola: preprocessing...
lola: Size of bit vector: 2592
lola: finding significant places
lola: 81 places, 1632 transitions, 80 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 81 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: A (((1 <= p_0_1_1_0) U ((p_1_2_0_1 <= 0) OR ((3 <= p_0_0_1_1) AND (p_2_2_1_0 <= p_2_0_2_1))))) : E (X (NOT(E (X ((p_1_2_1_2 <= p_0_2_2_0)))))) : (E (F (A (X ((p_0_2_0_1 <= p_1_1_1_1))))) AND E (G (((p_1_1_1_0 <= p_1_0_2_0) AND (2 <= p_0_2_1_1) AND ((p_0_2_2_0 <= p_2_0_0_1) OR (3 <= p_0_1_0_0)))))) : E (G (E (F (((p_1_1_0_0 <= p_1_2_1_2) OR (p_1_2_0_0 <= p_2_2_2_0)))))) : A (X (E (X ((1 <= p_2_1_2_2))))) : A (G (((p_0_2_1_1 <= p_2_0_0_2) OR (p_1_0_2_1 <= p_0_0_0_1) OR (p_2_0_0_0 <= p_0_1_1_2) OR (1 <= p_2_2_2_0)))) : NOT(E (X (A (G ((p_2_2_1_1 <= p_1_1_1_1)))))) : A (G (A (F ((p_0_0_1_0 <= 2))))) : E (G ((2 <= p_2_0_1_1))) : (E (G (E (X ((3 <= p_0_0_0_0))))) AND E (G (((p_2_2_2_0 <= p_1_0_1_1) OR (p_1_1_2_2 <= p_1_2_2_0) OR (p_0_0_0_0 <= 1))))) : (A (F (A (X ((3 <= p_1_0_2_0))))) OR NOT(A (((2 <= p_1_2_1_2) U (p_2_1_1_1 <= p_1_0_1_2))))) : (NOT((E (G ((p_0_1_0_1 <= p_1_1_0_0))) OR (((p_2_1_1_1 <= p_0_1_1_2) OR (p_0_1_2_1 <= p_1_2_2_2)) AND (p_0_2_2_2 <= 0)))) AND ((E (F ((p_0_0_1_1 <= p_2_1_2_1))) AND (p_0_0_0_1 <= p_1_0_0_1)) OR (2 <= p_1_1_0_2))) : A (G ((1 <= p_0_0_0_2))) : ((E (G ((2 <= p_0_1_1_2))) AND A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))) AND A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))) : A (G (E (F (((2 <= p_2_0_2_1) AND (1 <= p_1_2_0_1)))))) : A (F (A (F (((2 <= p_0_0_0_0) AND (3 <= p_0_2_0_0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((p_0_2_2_0 + 1 <= p_1_2_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(AX((p_0_2_2_0 + 1 <= p_1_2_1_2)))
lola: processed formula length: 36
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((p_0_2_0_1 <= p_1_1_1_1))))) AND E (G (((p_1_1_1_0 <= p_1_0_2_0) AND (2 <= p_0_2_1_1) AND ((p_0_2_2_0 <= p_2_0_0_1) OR (3 <= p_0_1_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p_1_1_1_0 <= p_1_0_2_0) AND (2 <= p_0_2_1_1) AND ((p_0_2_2_0 <= p_2_0_0_1) OR (3 <= p_0_1_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p_1_1_1_0 <= p_1_0_2_0) AND (2 <= p_0_2_1_1) AND ((p_0_2_2_0 <= p_2_0_0_1) OR (3 <= p_0_1_0_0)))))
lola: processed formula length: 107
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 54 markings, 54 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p_0_2_0_1 <= p_1_1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((p_0_2_0_1 <= p_1_1_1_1)))
lola: processed formula length: 38
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 75 markings, 74 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((1 <= p_2_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(EX((1 <= p_2_1_2_2)))
lola: processed formula length: 24
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p_1_1_1_1 + 1 <= p_2_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U (p_1_1_1_1 + 1 <= p_2_2_1_1)))
lola: processed formula length: 42
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 133647 markings, 134467 edges
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((3 <= p_0_0_0_0))))) AND E (G (((p_2_2_2_0 <= p_1_0_1_1) OR (p_1_1_2_2 <= p_1_2_2_0) OR (p_0_0_0_0 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p_2_2_2_0 <= p_1_0_1_1) OR (p_1_1_2_2 <= p_1_2_2_0) OR (p_0_0_0_0 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p_2_2_2_0 <= p_1_0_1_1) OR (p_1_1_2_2 <= p_1_2_2_0) OR (p_0_0_0_0 <= 1))))
lola: processed formula length: 84
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 74 markings, 74 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((3 <= p_0_0_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX((3 <= p_0_0_0_0)))))
lola: processed formula length: 40
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 263 markings, 263 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= p_1_0_2_0))))) OR E (((p_1_2_1_2 <= 1) R (p_1_0_1_2 + 1 <= p_2_1_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p_1_2_1_2 <= 1) R (p_1_0_1_2 + 1 <= p_2_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E (((p_1_2_1_2 <= 1) R (p_1_0_1_2 + 1 <= p_2_1_1_1)))
lola: processed formula length: 53
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: There is no path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= p_1_0_2_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX((3 <= p_1_0_2_0)))
lola: processed formula length: 30
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 315 markings, 315 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p_0_0_0_2)))
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 ((1 <= p_0_0_0_2)))
lola: processed formula length: 24
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p_0_2_1_1 <= p_2_0_0_2) OR (p_1_0_2_1 <= p_0_0_0_1) OR (p_2_0_0_0 <= p_0_1_1_2) OR (1 <= p_2_2_2_0))))
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 (((p_0_2_1_1 <= p_2_0_0_2) OR (p_1_0_2_1 <= p_0_0_0_1) OR (p_2_0_0_0 <= p_0_1_1_2) OR (1 <= p_2_2_2_0))))
lola: processed formula length: 113
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: ((p_2_0_0_2 + 1 <= p_0_2_1_1) AND (p_0_0_0_1 + 1 <= p_1_0_2_1) AND (p_0_1_1_2 + 1 <= p_2_0_0_0) AND (p_2_2_2_0 <= 0))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d4n3m2c23-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p_2_0_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((2 <= p_2_0_1_1)))
lola: processed formula length: 24
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 102 markings, 102 edges
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p_0_0_1_0 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (3 <= p_0_0_1_0)
lola: processed formula length: 16
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 101 markings, 101 edges
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((2 <= p_2_0_2_1) AND (1 <= p_1_2_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: ((2 <= p_2_0_2_1) AND (1 <= p_1_2_0_1))
lola: processed formula length: 39
lola: 21 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 83091 markings, 184392 edges, 16618 markings/sec, 0 secs
lola: 166426 markings, 382482 edges, 16667 markings/sec, 5 secs
lola: 247794 markings, 582188 edges, 16274 markings/sec, 10 secs
lola: 329789 markings, 785942 edges, 16399 markings/sec, 15 secs
lola: 408805 markings, 987881 edges, 15803 markings/sec, 20 secs
lola: 488940 markings, 1192851 edges, 16027 markings/sec, 25 secs
lola: 573805 markings, 1407306 edges, 16973 markings/sec, 30 secs
lola: 653653 markings, 1610109 edges, 15970 markings/sec, 35 secs
lola: 732987 markings, 1817267 edges, 15867 markings/sec, 40 secs
lola: 811800 markings, 2023411 edges, 15763 markings/sec, 45 secs
lola: 894227 markings, 2241629 edges, 16485 markings/sec, 50 secs
lola: 978640 markings, 2464447 edges, 16883 markings/sec, 55 secs
lola: 1045215 markings, 2641897 edges, 13315 markings/sec, 60 secs
lola: 1116189 markings, 2816536 edges, 14195 markings/sec, 65 secs
lola: 1186896 markings, 2983836 edges, 14141 markings/sec, 70 secs
lola: 1269905 markings, 3186021 edges, 16602 markings/sec, 75 secs
lola: 1355983 markings, 3383482 edges, 17216 markings/sec, 80 secs
lola: 1435343 markings, 3573582 edges, 15872 markings/sec, 85 secs
lola: 1510358 markings, 3758710 edges, 15003 markings/sec, 90 secs
lola: 1586158 markings, 3942989 edges, 15160 markings/sec, 95 secs
lola: 1659944 markings, 4132000 edges, 14757 markings/sec, 100 secs
lola: 1736088 markings, 4326375 edges, 15229 markings/sec, 105 secs
lola: 1815285 markings, 4528987 edges, 15839 markings/sec, 110 secs
lola: 1893218 markings, 4724699 edges, 15587 markings/sec, 115 secs
lola: 1971950 markings, 4921957 edges, 15746 markings/sec, 120 secs
lola: 2049636 markings, 5125589 edges, 15537 markings/sec, 125 secs
lola: 2127550 markings, 5328301 edges, 15583 markings/sec, 130 secs
lola: 2204703 markings, 5529556 edges, 15431 markings/sec, 135 secs
lola: 2282804 markings, 5735481 edges, 15620 markings/sec, 140 secs
lola: 2357321 markings, 5932279 edges, 14903 markings/sec, 145 secs
lola: 2435542 markings, 6138437 edges, 15644 markings/sec, 150 secs
lola: 2512763 markings, 6341941 edges, 15444 markings/sec, 155 secs
lola: 2589097 markings, 6543325 edges, 15267 markings/sec, 160 secs
lola: 2667981 markings, 6754751 edges, 15777 markings/sec, 165 secs
lola: 2746400 markings, 6964144 edges, 15684 markings/sec, 170 secs
lola: 2825422 markings, 7177712 edges, 15804 markings/sec, 175 secs
lola: 2904084 markings, 7390744 edges, 15732 markings/sec, 180 secs
lola: 2982684 markings, 7603548 edges, 15720 markings/sec, 185 secs
lola: 3061748 markings, 7815460 edges, 15813 markings/sec, 190 secs
lola: 3139980 markings, 8026470 edges, 15646 markings/sec, 195 secs
lola: 3216371 markings, 8233135 edges, 15278 markings/sec, 200 secs
lola: 3291267 markings, 8435748 edges, 14979 markings/sec, 205 secs
lola: 3367840 markings, 8646372 edges, 15315 markings/sec, 210 secs
lola: 3443148 markings, 8851120 edges, 15062 markings/sec, 215 secs
lola: 3519774 markings, 9057065 edges, 15325 markings/sec, 220 secs
lola: 3595227 markings, 9260838 edges, 15091 markings/sec, 225 secs
lola: 3672519 markings, 9470378 edges, 15458 markings/sec, 230 secs
lola: 3750680 markings, 9676163 edges, 15632 markings/sec, 235 secs
lola: 3830104 markings, 9891333 edges, 15885 markings/sec, 240 secs
lola: 3907905 markings, 10102627 edges, 15560 markings/sec, 245 secs
lola: 3983728 markings, 10308114 edges, 15165 markings/sec, 250 secs
lola: 4059961 markings, 10519245 edges, 15247 markings/sec, 255 secs
lola: 4140264 markings, 10727133 edges, 16061 markings/sec, 260 secs
lola: 4217853 markings, 10944936 edges, 15518 markings/sec, 265 secs
lola: 4296878 markings, 11155019 edges, 15805 markings/sec, 270 secs
lola: 4376529 markings, 11369252 edges, 15930 markings/sec, 275 secs
lola: 4454342 markings, 11584307 edges, 15563 markings/sec, 280 secs
lola: 4530613 markings, 11794332 edges, 15254 markings/sec, 285 secs
lola: 4608851 markings, 12012662 edges, 15648 markings/sec, 290 secs
lola: 4686278 markings, 12230445 edges, 15485 markings/sec, 295 secs
lola: 4764448 markings, 12445952 edges, 15634 markings/sec, 300 secs
lola: 4840768 markings, 12655949 edges, 15264 markings/sec, 305 secs
lola: 4917056 markings, 12864348 edges, 15258 markings/sec, 310 secs
lola: 4988767 markings, 13061158 edges, 14342 markings/sec, 315 secs
lola: 5056876 markings, 13252107 edges, 13622 markings/sec, 320 secs
lola: 5124314 markings, 13439511 edges, 13488 markings/sec, 325 secs
lola: 5191590 markings, 13625122 edges, 13455 markings/sec, 330 secs
lola: 5266116 markings, 13830883 edges, 14905 markings/sec, 335 secs
lola: 5342822 markings, 14038064 edges, 15341 markings/sec, 340 secs
lola: 5419305 markings, 14248767 edges, 15297 markings/sec, 345 secs
lola: 5494361 markings, 14453014 edges, 15011 markings/sec, 350 secs
lola: 5569978 markings, 14660078 edges, 15123 markings/sec, 355 secs
lola: 5639669 markings, 14845206 edges, 13938 markings/sec, 360 secs
lola: 5711034 markings, 15048537 edges, 14273 markings/sec, 365 secs
lola: 5780006 markings, 15241253 edges, 13794 markings/sec, 370 secs
lola: 5849224 markings, 15431786 edges, 13844 markings/sec, 375 secs
lola: 5915996 markings, 15618828 edges, 13354 markings/sec, 380 secs
lola: 5981077 markings, 15804345 edges, 13016 markings/sec, 385 secs
lola: 6046736 markings, 15985863 edges, 13132 markings/sec, 390 secs
lola: 6121721 markings, 16199176 edges, 14997 markings/sec, 395 secs
lola: 6199553 markings, 16417035 edges, 15566 markings/sec, 400 secs
lola: 6276878 markings, 16636105 edges, 15465 markings/sec, 405 secs
lola: 6356547 markings, 16852559 edges, 15934 markings/sec, 410 secs
lola: 6433141 markings, 17069643 edges, 15319 markings/sec, 415 secs
lola: 6510923 markings, 17287535 edges, 15556 markings/sec, 420 secs
lola: 6587424 markings, 17498501 edges, 15300 markings/sec, 425 secs
lola: 6661426 markings, 17702974 edges, 14800 markings/sec, 430 secs
lola: 6735148 markings, 17917377 edges, 14744 markings/sec, 435 secs
lola: 6814450 markings, 18132007 edges, 15860 markings/sec, 440 secs
lola: 6891568 markings, 18343208 edges, 15424 markings/sec, 445 secs
lola: 6968981 markings, 18558334 edges, 15483 markings/sec, 450 secs
lola: 7046821 markings, 18776212 edges, 15568 markings/sec, 455 secs
lola: 7122879 markings, 18993257 edges, 15212 markings/sec, 460 secs
lola: 7199602 markings, 19211382 edges, 15345 markings/sec, 465 secs
lola: 7277089 markings, 19426334 edges, 15497 markings/sec, 470 secs
lola: 7353809 markings, 19642852 edges, 15344 markings/sec, 475 secs
lola: 7430389 markings, 19859890 edges, 15316 markings/sec, 480 secs
lola: 7507036 markings, 20072585 edges, 15329 markings/sec, 485 secs
lola: 7583919 markings, 20292692 edges, 15377 markings/sec, 490 secs
lola: 7660930 markings, 20510695 edges, 15402 markings/sec, 495 secs
lola: 7736238 markings, 20725790 edges, 15062 markings/sec, 500 secs
lola: 7813413 markings, 20943138 edges, 15435 markings/sec, 505 secs
lola: 7890396 markings, 21156391 edges, 15397 markings/sec, 510 secs
lola: 7967137 markings, 21374792 edges, 15348 markings/sec, 515 secs
lola: 8045224 markings, 21592782 edges, 15617 markings/sec, 520 secs
lola: 8123209 markings, 21810502 edges, 15597 markings/sec, 525 secs
lola: 8196940 markings, 22020064 edges, 14746 markings/sec, 530 secs
lola: 8269925 markings, 22225231 edges, 14597 markings/sec, 535 secs
lola: 8342448 markings, 22429577 edges, 14505 markings/sec, 540 secs
lola: 8413030 markings, 22631262 edges, 14116 markings/sec, 545 secs
lola: 8483003 markings, 22832501 edges, 13995 markings/sec, 550 secs
lola: 8550734 markings, 23026253 edges, 13546 markings/sec, 555 secs
lola: 8622419 markings, 23232203 edges, 14337 markings/sec, 560 secs
lola: 8694365 markings, 23426861 edges, 14389 markings/sec, 565 secs
lola: 8761842 markings, 23618870 edges, 13495 markings/sec, 570 secs
lola: 8829487 markings, 23811152 edges, 13529 markings/sec, 575 secs
lola: 8897106 markings, 24003714 edges, 13524 markings/sec, 580 secs
lola: 8965068 markings, 24195092 edges, 13592 markings/sec, 585 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no yes unknown yes no yes no yes yes no unknown no unknown unknown unknown
lola: memory consumption: 6617004 KB
lola: time consumption: 596 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p_0_0_0_0) AND (3 <= p_0_2_0_0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((p_0_0_0_0 <= 1) OR (p_0_2_0_0 <= 2))
lola: processed formula length: 39
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 102 markings, 102 edges
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p_0_1_1_0) U ((p_1_2_0_1 <= 0) OR ((3 <= p_0_0_1_1) AND (p_2_2_1_0 <= p_2_0_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((1 <= p_0_1_1_0) U ((p_1_2_0_1 <= 0) OR ((3 <= p_0_0_1_1) AND (p_2_2_1_0 <= p_2_0_2_1)))))
lola: processed formula length: 95
lola: 24 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 62 markings, 62 edges
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 991 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p_1_1_0_0 <= p_1_2_1_2) OR (p_1_2_0_0 <= p_2_2_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: ((p_1_1_0_0 <= p_1_2_1_2) OR (p_1_2_0_0 <= p_2_2_2_0))
lola: processed formula length: 55
lola: 21 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 263 markings, 263 edges
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p_1_1_0_0 + 1 <= p_0_1_0_1))) AND ((((p_0_1_1_2 + 1 <= p_2_1_1_1) AND (p_1_2_2_2 + 1 <= p_0_1_2_1)) OR (1 <= p_0_2_2_2)) AND ((E (F ((p_0_0_1_1 <= p_2_1_2_1))) AND (p_0_0_0_1 <= p_1_0_0_1)) OR (2 <= p_1_1_0_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p_1_1_0_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p_1_1_0_2)
lola: processed formula length: 16
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: processed formula with 1 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 15 will run for 2974 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p_0_1_1_2 + 1 <= p_2_1_1_1) AND (p_1_2_2_2 + 1 <= p_0_1_2_1)) OR (1 <= p_0_2_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p_0_1_1_2 + 1 <= p_2_1_1_1) AND (p_1_2_2_2 + 1 <= p_0_1_2_1)) OR (1 <= p_0_2_2_2))
lola: processed formula length: 86
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: processed formula with 3 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2974 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G ((2 <= p_0_1_1_2))) AND (A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0)))) AND A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2974 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p_0_1_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((2 <= p_0_1_1_2)))
lola: processed formula length: 24
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 102 markings, 102 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))
lola: processed formula length: 95
lola: 24 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((2 <= p_2_0_2_1) AND (1 <= p_1_2_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: ((2 <= p_2_0_2_1) AND (1 <= p_1_2_0_1))
lola: processed formula length: 39
lola: 21 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 87641 markings, 194932 edges, 17528 markings/sec, 0 secs
lola: 173055 markings, 397443 edges, 17083 markings/sec, 5 secs
lola: 255314 markings, 600901 edges, 16452 markings/sec, 10 secs
lola: 338083 markings, 807306 edges, 16554 markings/sec, 15 secs
lola: 420027 markings, 1016757 edges, 16389 markings/sec, 20 secs
lola: 502204 markings, 1227124 edges, 16435 markings/sec, 25 secs
lola: 584029 markings, 1433542 edges, 16365 markings/sec, 30 secs
lola: 665926 markings, 1642490 edges, 16379 markings/sec, 35 secs
lola: 747066 markings, 1854430 edges, 16228 markings/sec, 40 secs
lola: 827730 markings, 2065750 edges, 16133 markings/sec, 45 secs
lola: 909676 markings, 2282565 edges, 16389 markings/sec, 50 secs
lola: 990992 markings, 2497654 edges, 16263 markings/sec, 55 secs
lola: 1071131 markings, 2710031 edges, 16028 markings/sec, 60 secs
lola: 1153413 markings, 2902946 edges, 16456 markings/sec, 65 secs
lola: 1233344 markings, 3098412 edges, 15986 markings/sec, 70 secs
lola: 1314829 markings, 3289385 edges, 16297 markings/sec, 75 secs
lola: 1397449 markings, 3483469 edges, 16524 markings/sec, 80 secs
lola: 1477707 markings, 3677159 edges, 16052 markings/sec, 85 secs
lola: 1557480 markings, 3870251 edges, 15955 markings/sec, 90 secs
lola: 1635959 markings, 4070052 edges, 15696 markings/sec, 95 secs
lola: 1714860 markings, 4273135 edges, 15780 markings/sec, 100 secs
lola: 1793867 markings, 4472871 edges, 15801 markings/sec, 105 secs
lola: 1873523 markings, 4676869 edges, 15931 markings/sec, 110 secs
lola: 1952081 markings, 4870754 edges, 15712 markings/sec, 115 secs
lola: 2030577 markings, 5074697 edges, 15699 markings/sec, 120 secs
lola: 2107530 markings, 5276497 edges, 15391 markings/sec, 125 secs
lola: 2185019 markings, 5478048 edges, 15498 markings/sec, 130 secs
lola: 2262782 markings, 5682517 edges, 15553 markings/sec, 135 secs
lola: 2341070 markings, 5888468 edges, 15658 markings/sec, 140 secs
lola: 2418913 markings, 6094452 edges, 15569 markings/sec, 145 secs
lola: 2498583 markings, 6304080 edges, 15934 markings/sec, 150 secs
lola: 2575940 markings, 6509187 edges, 15471 markings/sec, 155 secs
lola: 2654739 markings, 6718701 edges, 15760 markings/sec, 160 secs
lola: 2733151 markings, 6928133 edges, 15682 markings/sec, 165 secs
lola: 2812941 markings, 7144186 edges, 15958 markings/sec, 170 secs
lola: 2891984 markings, 7358427 edges, 15809 markings/sec, 175 secs
lola: 2970965 markings, 7571127 edges, 15796 markings/sec, 180 secs
lola: 3048191 markings, 7777774 edges, 15445 markings/sec, 185 secs
lola: 3126566 markings, 7992612 edges, 15675 markings/sec, 190 secs
lola: 3205059 markings, 8203966 edges, 15699 markings/sec, 195 secs
lola: 3285244 markings, 8419270 edges, 16037 markings/sec, 200 secs
lola: 3366634 markings, 8642922 edges, 16278 markings/sec, 205 secs
lola: 3446557 markings, 8859890 edges, 15985 markings/sec, 210 secs
lola: 3526539 markings, 9076037 edges, 15996 markings/sec, 215 secs
lola: 3606897 markings, 9291273 edges, 16072 markings/sec, 220 secs
lola: 3687587 markings, 9509353 edges, 16138 markings/sec, 225 secs
lola: 3765446 markings, 9717682 edges, 15572 markings/sec, 230 secs
lola: 3845157 markings, 9930922 edges, 15942 markings/sec, 235 secs
lola: 3924533 markings, 10147020 edges, 15875 markings/sec, 240 secs
lola: 4003672 markings, 10362013 edges, 15828 markings/sec, 245 secs
lola: 4081327 markings, 10578187 edges, 15531 markings/sec, 250 secs
lola: 4160651 markings, 10784829 edges, 15865 markings/sec, 255 secs
lola: 4238475 markings, 11003305 edges, 15565 markings/sec, 260 secs
lola: 4317832 markings, 11213130 edges, 15871 markings/sec, 265 secs
lola: 4397863 markings, 11428079 edges, 16006 markings/sec, 270 secs
lola: 4476108 markings, 11643663 edges, 15649 markings/sec, 275 secs
lola: 4553462 markings, 11858175 edges, 15471 markings/sec, 280 secs
lola: 4630722 markings, 12073008 edges, 15452 markings/sec, 285 secs
lola: 4708242 markings, 12292932 edges, 15504 markings/sec, 290 secs
lola: 4787094 markings, 12509746 edges, 15770 markings/sec, 295 secs
lola: 4866510 markings, 12725632 edges, 15883 markings/sec, 300 secs
lola: 4944946 markings, 12940528 edges, 15687 markings/sec, 305 secs
lola: 5022765 markings, 13156773 edges, 15564 markings/sec, 310 secs
lola: 5100002 markings, 13373250 edges, 15447 markings/sec, 315 secs
lola: 5180227 markings, 13594127 edges, 16045 markings/sec, 320 secs
lola: 5259039 markings, 13811077 edges, 15762 markings/sec, 325 secs
lola: 5339584 markings, 14029486 edges, 16109 markings/sec, 330 secs
lola: 5419722 markings, 14250131 edges, 16028 markings/sec, 335 secs
lola: 5500270 markings, 14469019 edges, 16110 markings/sec, 340 secs
lola: 5579035 markings, 14684601 edges, 15753 markings/sec, 345 secs
lola: 5656605 markings, 14892502 edges, 15514 markings/sec, 350 secs
lola: 5733183 markings, 15110946 edges, 15316 markings/sec, 355 secs
lola: 5810894 markings, 15323083 edges, 15542 markings/sec, 360 secs
lola: 5888959 markings, 15542090 edges, 15613 markings/sec, 365 secs
lola: 5965997 markings, 15762991 edges, 15408 markings/sec, 370 secs
lola: 6043936 markings, 15977322 edges, 15588 markings/sec, 375 secs
lola: 6121186 markings, 16197697 edges, 15450 markings/sec, 380 secs
lola: 6199275 markings, 16416245 edges, 15618 markings/sec, 385 secs
lola: 6275447 markings, 16632003 edges, 15234 markings/sec, 390 secs
lola: 6354266 markings, 16846099 edges, 15764 markings/sec, 395 secs
lola: 6429620 markings, 17060014 edges, 15071 markings/sec, 400 secs
lola: 6506697 markings, 17275973 edges, 15415 markings/sec, 405 secs
lola: 6583273 markings, 17486478 edges, 15315 markings/sec, 410 secs
lola: 6661165 markings, 17702251 edges, 15578 markings/sec, 415 secs
lola: 6736504 markings, 17921060 edges, 15068 markings/sec, 420 secs
lola: 6815758 markings, 18135723 edges, 15851 markings/sec, 425 secs
lola: 6891492 markings, 18343025 edges, 15147 markings/sec, 430 secs
lola: 6968014 markings, 18555804 edges, 15304 markings/sec, 435 secs
lola: 7044958 markings, 18770705 edges, 15389 markings/sec, 440 secs
lola: 7121721 markings, 18989985 edges, 15353 markings/sec, 445 secs
lola: 7198893 markings, 19209297 edges, 15434 markings/sec, 450 secs
lola: 7276137 markings, 19423816 edges, 15449 markings/sec, 455 secs
lola: 7351370 markings, 19636139 edges, 15047 markings/sec, 460 secs
lola: 7426650 markings, 19849976 edges, 15056 markings/sec, 465 secs
lola: 7502220 markings, 20059240 edges, 15114 markings/sec, 470 secs
lola: 7577462 markings, 20273941 edges, 15048 markings/sec, 475 secs
lola: 7652823 markings, 20487302 edges, 15072 markings/sec, 480 secs
lola: 7728373 markings, 20702747 edges, 15110 markings/sec, 485 secs
lola: 7803734 markings, 20914480 edges, 15072 markings/sec, 490 secs
lola: 7878617 markings, 21123329 edges, 14977 markings/sec, 495 secs
lola: 7950941 markings, 21328387 edges, 14465 markings/sec, 500 secs
lola: 8024729 markings, 21534107 edges, 14758 markings/sec, 505 secs
lola: 8097171 markings, 21740858 edges, 14488 markings/sec, 510 secs
lola: 8172206 markings, 21948591 edges, 15007 markings/sec, 515 secs
lola: 8244805 markings, 22157363 edges, 14520 markings/sec, 520 secs
lola: 8319515 markings, 22364362 edges, 14942 markings/sec, 525 secs
lola: 8391524 markings, 22569817 edges, 14402 markings/sec, 530 secs
lola: 8466571 markings, 22785357 edges, 15009 markings/sec, 535 secs
lola: 8543623 markings, 23006230 edges, 15410 markings/sec, 540 secs
lola: 8620447 markings, 23226490 edges, 15365 markings/sec, 545 secs
lola: 8695686 markings, 23430053 edges, 15048 markings/sec, 550 secs
lola: 8763561 markings, 23623539 edges, 13575 markings/sec, 555 secs
lola: 8831015 markings, 23815766 edges, 13491 markings/sec, 560 secs
lola: 8900131 markings, 24011528 edges, 13823 markings/sec, 565 secs
lola: 8966786 markings, 24199688 edges, 13331 markings/sec, 570 secs
lola: 9032289 markings, 24391096 edges, 13101 markings/sec, 575 secs
lola: 9108875 markings, 24599651 edges, 15317 markings/sec, 580 secs
lola: 9191941 markings, 24800716 edges, 16613 markings/sec, 585 secs
lola: 9273735 markings, 25007220 edges, 16359 markings/sec, 590 secs
lola: 9352629 markings, 25231426 edges, 15779 markings/sec, 595 secs
lola: 9430496 markings, 25452185 edges, 15573 markings/sec, 600 secs
lola: 9509507 markings, 25663566 edges, 15802 markings/sec, 605 secs
lola: 9595234 markings, 25864950 edges, 17145 markings/sec, 610 secs
lola: 9677981 markings, 26065164 edges, 16549 markings/sec, 615 secs
lola: 9760691 markings, 26272108 edges, 16542 markings/sec, 620 secs
lola: 9842456 markings, 26476377 edges, 16353 markings/sec, 625 secs
lola: 9924017 markings, 26684283 edges, 16312 markings/sec, 630 secs
lola: 10006352 markings, 26895309 edges, 16467 markings/sec, 635 secs
lola: 10085138 markings, 27100972 edges, 15757 markings/sec, 640 secs
lola: 10164830 markings, 27308533 edges, 15938 markings/sec, 645 secs
lola: 10247147 markings, 27521264 edges, 16463 markings/sec, 650 secs
lola: 10328106 markings, 27732750 edges, 16192 markings/sec, 655 secs
lola: 10407311 markings, 27937804 edges, 15841 markings/sec, 660 secs
lola: 10483247 markings, 28137980 edges, 15187 markings/sec, 665 secs
lola: 10562134 markings, 28346350 edges, 15777 markings/sec, 670 secs
lola: 10641271 markings, 28548352 edges, 15827 markings/sec, 675 secs
lola: 10711508 markings, 28738453 edges, 14047 markings/sec, 680 secs
lola: 10781245 markings, 28918955 edges, 13947 markings/sec, 685 secs
lola: 10849041 markings, 29100761 edges, 13559 markings/sec, 690 secs
lola: 10925617 markings, 29306848 edges, 15315 markings/sec, 695 secs
lola: 11002678 markings, 29509862 edges, 15412 markings/sec, 700 secs
lola: 11080844 markings, 29720781 edges, 15633 markings/sec, 705 secs
lola: 11159848 markings, 29936814 edges, 15801 markings/sec, 710 secs
lola: 11239142 markings, 30146679 edges, 15859 markings/sec, 715 secs
lola: 11319121 markings, 30361746 edges, 15996 markings/sec, 720 secs
lola: 11397974 markings, 30580346 edges, 15771 markings/sec, 725 secs
lola: 11476557 markings, 30793796 edges, 15717 markings/sec, 730 secs
lola: 11555448 markings, 31004042 edges, 15778 markings/sec, 735 secs
lola: 11633450 markings, 31204907 edges, 15600 markings/sec, 740 secs
lola: 11708367 markings, 31413176 edges, 14983 markings/sec, 745 secs
lola: 11784992 markings, 31622400 edges, 15325 markings/sec, 750 secs
lola: 11860851 markings, 31830827 edges, 15172 markings/sec, 755 secs
lola: 11938103 markings, 32042973 edges, 15450 markings/sec, 760 secs
lola: 12017536 markings, 32250811 edges, 15887 markings/sec, 765 secs
lola: 12093009 markings, 32456902 edges, 15095 markings/sec, 770 secs
lola: 12170026 markings, 32668690 edges, 15403 markings/sec, 775 secs
lola: 12245197 markings, 32880028 edges, 15034 markings/sec, 780 secs
lola: 12321588 markings, 33089336 edges, 15278 markings/sec, 785 secs
lola: 12398866 markings, 33296823 edges, 15456 markings/sec, 790 secs
lola: 12474370 markings, 33505979 edges, 15101 markings/sec, 795 secs
lola: 12549721 markings, 33718435 edges, 15070 markings/sec, 800 secs
lola: 12625936 markings, 33928056 edges, 15243 markings/sec, 805 secs
lola: 12702831 markings, 34138139 edges, 15379 markings/sec, 810 secs
lola: 12779952 markings, 34347941 edges, 15424 markings/sec, 815 secs
lola: 12856605 markings, 34561221 edges, 15331 markings/sec, 820 secs
lola: 12936490 markings, 34767606 edges, 15977 markings/sec, 825 secs
lola: 13006295 markings, 34965165 edges, 13961 markings/sec, 830 secs
lola: 13078321 markings, 35164030 edges, 14405 markings/sec, 835 secs
lola: 13149371 markings, 35355925 edges, 14210 markings/sec, 840 secs
lola: 13219733 markings, 35548479 edges, 14072 markings/sec, 845 secs
lola: 13294685 markings, 35758795 edges, 14990 markings/sec, 850 secs
lola: 13361480 markings, 35946268 edges, 13359 markings/sec, 855 secs
lola: 13427295 markings, 36133077 edges, 13163 markings/sec, 860 secs
lola: 13495280 markings, 36324547 edges, 13597 markings/sec, 865 secs
lola: 13563276 markings, 36500380 edges, 13599 markings/sec, 870 secs
lola: 13629013 markings, 36679170 edges, 13147 markings/sec, 875 secs
lola: 13696184 markings, 36862832 edges, 13434 markings/sec, 880 secs
lola: 13770834 markings, 37059912 edges, 14930 markings/sec, 885 secs
lola: 13843161 markings, 37252607 edges, 14465 markings/sec, 890 secs
lola: 13915835 markings, 37455816 edges, 14535 markings/sec, 895 secs
lola: 13990041 markings, 37661315 edges, 14841 markings/sec, 900 secs
lola: 14064374 markings, 37870116 edges, 14867 markings/sec, 905 secs
lola: 14140718 markings, 38081263 edges, 15269 markings/sec, 910 secs
lola: 14211885 markings, 38276721 edges, 14233 markings/sec, 915 secs
lola: 14284180 markings, 38481371 edges, 14459 markings/sec, 920 secs
lola: 14358082 markings, 38687153 edges, 14780 markings/sec, 925 secs
lola: 14432034 markings, 38889156 edges, 14790 markings/sec, 930 secs
lola: 14500466 markings, 39079124 edges, 13686 markings/sec, 935 secs
lola: 14568748 markings, 39269968 edges, 13656 markings/sec, 940 secs
lola: 14639853 markings, 39469289 edges, 14221 markings/sec, 945 secs
lola: 14710136 markings, 39666350 edges, 14057 markings/sec, 950 secs
lola: 14786230 markings, 39875528 edges, 15219 markings/sec, 955 secs
lola: 14854690 markings, 40066586 edges, 13692 markings/sec, 960 secs
lola: 14924059 markings, 40256483 edges, 13874 markings/sec, 965 secs
lola: 14992370 markings, 40442574 edges, 13662 markings/sec, 970 secs
lola: 15065875 markings, 40611527 edges, 14701 markings/sec, 975 secs
lola: 15145725 markings, 40803984 edges, 15970 markings/sec, 980 secs
lola: 15227522 markings, 41004180 edges, 16359 markings/sec, 985 secs
lola: 15310164 markings, 41209872 edges, 16528 markings/sec, 990 secs
lola: 15392772 markings, 41417219 edges, 16522 markings/sec, 995 secs
lola: 15470317 markings, 41609809 edges, 15509 markings/sec, 1000 secs
lola: 15549980 markings, 41811040 edges, 15933 markings/sec, 1005 secs
lola: 15632197 markings, 42022581 edges, 16443 markings/sec, 1010 secs
lola: 15704961 markings, 42201688 edges, 14553 markings/sec, 1015 secs
lola: 15776278 markings, 42388103 edges, 14263 markings/sec, 1020 secs
lola: 15848752 markings, 42577776 edges, 14495 markings/sec, 1025 secs
lola: 15918835 markings, 42764089 edges, 14017 markings/sec, 1030 secs
lola: 15996727 markings, 42973037 edges, 15578 markings/sec, 1035 secs
lola: 16077566 markings, 43190352 edges, 16168 markings/sec, 1040 secs
lola: 16158771 markings, 43404247 edges, 16241 markings/sec, 1045 secs
lola: 16239883 markings, 43619828 edges, 16222 markings/sec, 1050 secs
lola: 16320442 markings, 43832717 edges, 16112 markings/sec, 1055 secs
lola: 16402525 markings, 44049820 edges, 16417 markings/sec, 1060 secs
lola: 16485746 markings, 44266776 edges, 16644 markings/sec, 1065 secs
lola: 16560160 markings, 44469002 edges, 14883 markings/sec, 1070 secs
lola: 16632718 markings, 44666649 edges, 14512 markings/sec, 1075 secs
lola: 16702977 markings, 44858290 edges, 14052 markings/sec, 1080 secs
lola: 16776796 markings, 45052567 edges, 14764 markings/sec, 1085 secs
lola: 16855474 markings, 45262751 edges, 15736 markings/sec, 1090 secs
lola: 16931004 markings, 45463624 edges, 15106 markings/sec, 1095 secs
lola: 17001590 markings, 45652072 edges, 14117 markings/sec, 1100 secs
lola: 17074150 markings, 45845176 edges, 14512 markings/sec, 1105 secs
lola: 17154155 markings, 46067375 edges, 16001 markings/sec, 1110 secs
lola: 17240067 markings, 46265830 edges, 17182 markings/sec, 1115 secs
lola: 17324548 markings, 46471368 edges, 16896 markings/sec, 1120 secs
lola: 17409270 markings, 46680733 edges, 16944 markings/sec, 1125 secs
lola: 17493829 markings, 46886680 edges, 16912 markings/sec, 1130 secs
lola: 17577937 markings, 47095919 edges, 16822 markings/sec, 1135 secs
lola: 17662164 markings, 47310411 edges, 16845 markings/sec, 1140 secs
lola: 17746415 markings, 47528824 edges, 16850 markings/sec, 1145 secs
lola: 17830199 markings, 47745680 edges, 16757 markings/sec, 1150 secs
lola: 17913091 markings, 47959840 edges, 16578 markings/sec, 1155 secs
lola: 17994924 markings, 48167110 edges, 16367 markings/sec, 1160 secs
lola: 18077258 markings, 48385883 edges, 16467 markings/sec, 1165 secs
lola: 18159934 markings, 48602420 edges, 16535 markings/sec, 1170 secs
lola: 18241648 markings, 48817654 edges, 16343 markings/sec, 1175 secs
lola: 18323220 markings, 49031565 edges, 16314 markings/sec, 1180 secs
lola: 18403285 markings, 49246078 edges, 16013 markings/sec, 1185 secs
lola: 18484810 markings, 49457482 edges, 16305 markings/sec, 1190 secs
lola: 18564066 markings, 49666675 edges, 15851 markings/sec, 1195 secs
lola: 18644219 markings, 49880904 edges, 16031 markings/sec, 1200 secs
lola: 18724707 markings, 50089795 edges, 16098 markings/sec, 1205 secs
lola: 18804485 markings, 50308197 edges, 15956 markings/sec, 1210 secs
lola: 18885588 markings, 50524386 edges, 16221 markings/sec, 1215 secs
lola: 18966826 markings, 50741698 edges, 16248 markings/sec, 1220 secs
lola: 19046902 markings, 50956944 edges, 16015 markings/sec, 1225 secs
lola: 19117567 markings, 51154035 edges, 14133 markings/sec, 1230 secs
lola: 19186331 markings, 51340976 edges, 13753 markings/sec, 1235 secs
lola: 19255437 markings, 51527294 edges, 13821 markings/sec, 1240 secs
lola: 19335578 markings, 51741503 edges, 16028 markings/sec, 1245 secs
lola: 19416788 markings, 51963548 edges, 16242 markings/sec, 1250 secs
lola: 19497402 markings, 52184432 edges, 16123 markings/sec, 1255 secs
lola: 19569698 markings, 52375308 edges, 14459 markings/sec, 1260 secs
lola: 19638817 markings, 52563818 edges, 13824 markings/sec, 1265 secs
lola: 19708294 markings, 52754792 edges, 13895 markings/sec, 1270 secs
lola: 19777131 markings, 52939859 edges, 13767 markings/sec, 1275 secs
lola: 19845574 markings, 53130056 edges, 13689 markings/sec, 1280 secs
lola: 19917095 markings, 53325600 edges, 14304 markings/sec, 1285 secs
lola: 19997045 markings, 53541733 edges, 15990 markings/sec, 1290 secs
lola: 20075006 markings, 53760888 edges, 15592 markings/sec, 1295 secs
lola: 20155443 markings, 53978564 edges, 16087 markings/sec, 1300 secs
lola: 20235245 markings, 54195330 edges, 15960 markings/sec, 1305 secs
lola: 20314989 markings, 54408988 edges, 15949 markings/sec, 1310 secs
lola: 20394148 markings, 54627105 edges, 15832 markings/sec, 1315 secs
lola: 20476718 markings, 54830526 edges, 16514 markings/sec, 1320 secs
lola: 20561056 markings, 55031405 edges, 16868 markings/sec, 1325 secs
lola: 20645236 markings, 55235486 edges, 16836 markings/sec, 1330 secs
lola: 20728354 markings, 55443493 edges, 16624 markings/sec, 1335 secs
lola: 20810812 markings, 55654520 edges, 16492 markings/sec, 1340 secs
lola: 20893442 markings, 55862756 edges, 16526 markings/sec, 1345 secs
lola: 20976449 markings, 56069802 edges, 16601 markings/sec, 1350 secs
lola: 21059547 markings, 56284338 edges, 16620 markings/sec, 1355 secs
lola: 21131258 markings, 56467792 edges, 14342 markings/sec, 1360 secs
lola: 21203810 markings, 56657290 edges, 14510 markings/sec, 1365 secs
lola: 21274717 markings, 56839791 edges, 14181 markings/sec, 1370 secs
lola: 21348161 markings, 57032206 edges, 14689 markings/sec, 1375 secs
lola: 21419659 markings, 57218801 edges, 14300 markings/sec, 1380 secs
lola: 21491320 markings, 57403959 edges, 14332 markings/sec, 1385 secs
lola: 21564833 markings, 57596684 edges, 14703 markings/sec, 1390 secs
lola: 21635581 markings, 57783033 edges, 14150 markings/sec, 1395 secs
lola: 21705252 markings, 57966525 edges, 13934 markings/sec, 1400 secs
lola: 21785376 markings, 58177900 edges, 16025 markings/sec, 1405 secs
lola: 21864067 markings, 58391203 edges, 15738 markings/sec, 1410 secs
lola: 21944124 markings, 58599783 edges, 16011 markings/sec, 1415 secs
lola: 22023385 markings, 58813079 edges, 15852 markings/sec, 1420 secs
lola: 22102233 markings, 59027454 edges, 15770 markings/sec, 1425 secs
lola: 22180616 markings, 59235269 edges, 15677 markings/sec, 1430 secs
lola: 22259508 markings, 59447916 edges, 15778 markings/sec, 1435 secs
lola: 22336320 markings, 59657573 edges, 15362 markings/sec, 1440 secs
lola: 22399935 markings, 59829247 edges, 12723 markings/sec, 1445 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (F ((p_1_1_0_0 + 1 <= p_0_1_0_1))) AND ((((p_0_1_1_2 + 1 <= p_2_1_1_1) AND (p_1_2_2_2 + 1 <= p_0_1_2_1)) OR (1 <= p_0_2_2_2)) AND ((E (F ((p_0_0_1_1 <= p_2_1_2_1))) AND (p_0_0_0_1 <= p_1_0_0_1)) OR (2 <= p_1_1_0_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (2 <= p_1_1_0_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p_1_1_0_2)
lola: processed formula length: 16
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: processed formula with 1 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: ...considering subproblem: (((p_0_1_1_2 + 1 <= p_2_1_1_1) AND (p_1_2_2_2 + 1 <= p_0_1_2_1)) OR (1 <= p_0_2_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p_0_1_1_2 + 1 <= p_2_1_1_1) AND (p_1_2_2_2 + 1 <= p_0_1_2_1)) OR (1 <= p_0_2_2_2))
lola: processed formula length: 86
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: ...considering subproblem: A (F ((p_1_1_0_0 + 1 <= p_0_1_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p_0_1_0_1 <= p_1_1_0_0)
lola: processed formula length: 24
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: ========================================
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 118 markings, 118 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G ((2 <= p_0_1_1_2))) AND (A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0)))) AND A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p_0_1_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((2 <= p_0_1_1_2)))
lola: processed formula length: 24
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 102 markings, 102 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((p_0_0_1_1 <= 1) OR (p_1_1_1_0 + 1 <= p_0_2_1_0))
lola: processed formula length: 51
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))
lola: processed formula length: 95
lola: 24 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes no yes no yes yes no no no yes unknown no
lola:
preliminary result: no no yes yes yes no yes no yes yes no no no yes unknown no
lola: memory consumption: 24340 KB
lola: time consumption: 2052 seconds
BK_STOP 1527023829349
--------------------
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="NeighborGrid-PT-d4n3m2c23"
export BK_EXAMINATION="CTLCardinality"
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/NeighborGrid-PT-d4n3m2c23.tgz
mv NeighborGrid-PT-d4n3m2c23 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 NeighborGrid-PT-d4n3m2c23, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r112-csrt-152666469200227"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;