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 208K
-rw-r--r-- 1 mcc users 3.6K 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 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 4.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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.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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 46K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeighborGrid-PT-d3n3m1t11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469200220
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527021588856

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeighborGrid-PT-d3n3m1t11 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating NeighborGrid-PT-d3n3m1t11 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ NeighborGrid-PT-d3n3m1t11 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 189/65536 symbol table entries, 8 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 162 transitions, 26 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 27 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: always true
lola: A (G (((p_2_1_1 <= p_0_0_1) OR (1 <= p_1_0_1) OR (p_2_0_2 <= 1) OR (2 <= p_0_1_1)))) : E (((((2 <= p_0_2_2) OR (p_2_0_2 <= p_0_2_1)) AND (p_0_1_2 <= p_2_2_1)) U A (X ((3 <= p_1_2_2))))) : E (X (A (G (((p_2_1_0 <= p_2_1_2) OR (3 <= p_1_0_1)))))) : E (X (A (G ((p_0_1_1 + 1 <= p_1_1_2))))) : A (X (A (F (((1 <= p_0_0_2) AND (p_1_0_0 <= p_2_2_2)))))) : A (G (E (F ((p_2_2_1 <= 0))))) : (((p_0_2_1 <= p_0_1_1) OR (p_2_2_1 <= p_2_1_2) OR (p_0_2_2 <= p_0_2_1) OR ((2 <= p_1_1_0) AND (1 <= p_0_0_1) AND ((1 <= p_0_1_2) OR (p_2_0_0 <= p_1_1_1))) OR (p_0_1_1 <= p_0_0_1)) AND E (X (A (X ((1 <= p_0_0_0)))))) : E (((((3 <= p_1_0_1) OR (1 <= p_2_2_1)) AND ((3 <= p_1_1_0) OR (p_1_2_1 <= p_0_2_1))) U E (X ((3 <= p_0_0_2))))) : (E (X (A (X ((2 <= p_0_1_1))))) OR A (F ((2 <= p_0_2_2)))) : E (F (A (X (((1 <= p_2_1_2) AND (p_1_1_2 <= p_2_2_0)))))) : (E (G ((1 <= p_0_0_0))) AND A (G (E (F ((1 <= p_0_1_2)))))) : ((A (((1 <= p_1_0_0) U (2 <= p_2_0_0))) OR E (X (((1 <= p_0_2_1))))) AND E (F (E (G ((2 <= p_2_1_0)))))) : NOT(A (G (A (F ((1 <= p_1_2_1)))))) : (A (X (E (X ((1 <= p_2_2_0))))) AND (p_0_2_2 <= p_0_0_0)) : E (F (A (X ((p_0_2_0 + 1 <= p_2_0_1))))) : (((1 <= p_0_1_2) AND E (F ((p_0_2_2 + 1 <= p_2_1_2)))) AND E (F (E (G ((2 <= p_1_1_2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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 (((((2 <= p_0_2_2) OR (p_2_0_2 <= p_0_2_1)) AND (p_0_1_2 <= p_2_2_1)) U A (X ((3 <= p_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((((2 <= p_0_2_2) OR (p_2_0_2 <= p_0_2_1)) AND (p_0_1_2 <= p_2_2_1)) U AX((3 <= p_1_2_2)))
lola: processed formula length: 92
lola: 8 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 2471 markings, 4228 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((p_2_1_0 <= p_2_1_2) OR (3 <= p_1_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U ((p_2_1_2 + 1 <= p_2_1_0) AND (p_1_0_1 <= 2)))))
lola: processed formula length: 64
lola: 9 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 13296 markings, 20597 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p_0_1_1 + 1 <= p_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U (p_1_1_2 <= p_0_1_1))))
lola: processed formula length: 39
lola: 9 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 238 markings, 238 edges

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p_0_0_2) AND (p_1_0_0 <= p_2_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((p_0_0_2 <= 0) OR (p_2_2_2 + 1 <= p_1_0_0))
lola: processed formula length: 45
lola: 8 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 16 markings, 16 edges

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p_0_2_1 <= p_0_1_1) OR (p_2_2_1 <= p_2_1_2) OR (p_0_2_2 <= p_0_2_1) OR ((2 <= p_1_1_0) AND (1 <= p_0_0_1) AND ((1 <= p_0_1_2) OR (p_2_0_0 <= p_1_1_1))) OR (p_0_1_1 <= p_0_0_1)) AND E (X (A (X ((1 <= p_0_0_0))))))
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: ((p_0_2_1 <= p_0_1_1) OR (p_2_2_1 <= p_2_1_2) OR (p_0_2_2 <= p_0_2_1) OR ((2 <= p_1_1_0) AND (1 <= p_0_0_1) AND ((1 <= p_0_1_2) OR (p_2_0_0 <= p_1_1_1))) OR (p_0_1_1 <= p_0_0_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_0_2_1 <= p_0_1_1) OR (p_2_2_1 <= p_2_1_2) OR (p_0_2_2 <= p_0_2_1) OR ((2 <= p_1_1_0) AND (1 <= p_0_0_1) AND ((1 <= p_0_1_2) OR (p_2_0_0 <= p_1_1_1))) OR (p_0_1_1 <= p_0_0_1))
lola: processed formula length: 183
lola: 6 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: processed formula with 8 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((1 <= p_0_0_0)))))
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((1 <= p_0_0_0)))
lola: processed formula length: 22
lola: 8 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-6 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: E (((((3 <= p_1_0_1) OR (1 <= p_2_2_1)) AND ((3 <= p_1_1_0) OR (p_1_2_1 <= p_0_2_1))) U E (X ((3 <= p_0_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((((3 <= p_1_0_1) OR (1 <= p_2_2_1)) AND ((3 <= p_1_1_0) OR (p_1_2_1 <= p_0_2_1))) U EX((3 <= p_0_0_2)))
lola: processed formula length: 107
lola: 8 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 572918 markings, 1244478 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-7 TRUE 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: (E (X (A (X ((2 <= p_0_1_1))))) OR A (F ((2 <= p_0_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p_0_2_2)))
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_2_2 <= 1)
lola: processed formula length: 14
lola: 8 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((2 <= p_0_1_1)))))
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((2 <= p_0_1_1)))
lola: processed formula length: 22
lola: 8 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
========================================
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-8 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: E (F (A (X (((1 <= p_2_1_2) AND (p_1_1_2 <= p_2_2_0))))))
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(((1 <= p_2_1_2) AND (p_1_1_2 <= p_2_2_0))))
lola: processed formula length: 55
lola: 8 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 106 markings, 143 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (((1 <= p_1_0_0) U (2 <= p_2_0_0))) OR E (X (((1 <= p_0_2_1))))) AND E (F (E (G ((2 <= p_2_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p_1_0_0) U (2 <= p_2_0_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 (((1 <= p_1_0_0) U (2 <= p_2_0_0)))
lola: processed formula length: 37
lola: 10 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((2 <= p_2_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (2 <= p_2_1_0)
lola: processed formula length: 14
lola: 7 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 35 markings, 35 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p_0_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((1 <= p_0_2_1)))
lola: processed formula length: 20
lola: 7 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-11 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 (X (E (X ((1 <= p_2_2_0))))) AND (p_0_2_2 <= p_0_0_0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_0_2_2 <= p_0_0_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_0_2_2 <= p_0_0_0)
lola: processed formula length: 20
lola: 6 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((1 <= p_2_2_0)))))
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_2_0)))
lola: processed formula length: 22
lola: 8 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
========================================

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-13 TRUE 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: E (F (A (X ((p_0_2_0 + 1 <= p_2_0_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_2_0_1)))
lola: processed formula length: 38
lola: 8 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 12 markings, 11 edges
lola:
========================================FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p_2_1_1 <= p_0_0_1) OR (1 <= p_1_0_1) OR (p_2_0_2 <= 1) OR (2 <= p_0_1_1))))
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_2_1_1 <= p_0_0_1) OR (1 <= p_1_0_1) OR (p_2_0_2 <= 1) OR (2 <= p_0_1_1))))
lola: processed formula length: 87
lola: 8 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p_0_0_1 + 1 <= p_2_1_1) AND (p_1_0_1 <= 0) AND (2 <= p_2_0_2) AND (p_0_1_1 <= 1))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to NeighborGrid-PT-d3n3m1t11-CTLCardinality-11-0.sara
lola: state equation: calling and running sara

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p_2_2_1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (p_2_2_1 <= 0)
lola: processed formula length: 14
lola: 7 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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
sara: try reading problem file NeighborGrid-PT-d3n3m1t11-CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: 1381334 markings, 4926595 edges, 276267 markings/sec, 0 secs
lola: 2539739 markings, 9193146 edges, 231681 markings/sec, 5 secs
lola: 3601555 markings, 13218660 edges, 212363 markings/sec, 10 secs
lola: 4611430 markings, 17061555 edges, 201975 markings/sec, 15 secs
lola: 5594795 markings, 20819525 edges, 196673 markings/sec, 20 secs
lola: 6529024 markings, 24490243 edges, 186846 markings/sec, 25 secs
lola: 7461436 markings, 28114291 edges, 186482 markings/sec, 30 secs
lola: 8392489 markings, 31689574 edges, 186211 markings/sec, 35 secs
lola: 9285440 markings, 35187704 edges, 178590 markings/sec, 40 secs
lola: 10173173 markings, 38679387 edges, 177547 markings/sec, 45 secs
lola: 10996288 markings, 41918417 edges, 164623 markings/sec, 50 secs
lola: 11862115 markings, 45387616 edges, 173165 markings/sec, 55 secs
lola: 12768544 markings, 48971878 edges, 181286 markings/sec, 60 secs
lola: 13689195 markings, 52607775 edges, 184130 markings/sec, 65 secs
lola: 14580939 markings, 56158098 edges, 178349 markings/sec, 70 secs
lola: 15467776 markings, 59693847 edges, 177367 markings/sec, 75 secs
lola: 16384256 markings, 63271512 edges, 183296 markings/sec, 80 secs
lola: 17253866 markings, 66763210 edges, 173922 markings/sec, 85 secs
lola: 18108994 markings, 70200703 edges, 171026 markings/sec, 90 secs
lola: 18979152 markings, 73662712 edges, 174032 markings/sec, 95 secs
lola: 19813523 markings, 77042076 edges, 166874 markings/sec, 100 secs
lola: 20674587 markings, 80550059 edges, 172213 markings/sec, 105 secs
lola: 21547092 markings, 84044924 edges, 174501 markings/sec, 110 secs
lola: 22396422 markings, 87460242 edges, 169866 markings/sec, 115 secs
lola: 23239449 markings, 90895913 edges, 168605 markings/sec, 120 secs
lola: 24038020 markings, 94111639 edges, 159714 markings/sec, 125 secs
lola: 24783033 markings, 97130459 edges, 149003 markings/sec, 130 secs
lola: 25529138 markings, 100126588 edges, 149221 markings/sec, 135 secs
lola: 26301623 markings, 103257468 edges, 154497 markings/sec, 140 secs
lola: 27088787 markings, 106418011 edges, 157433 markings/sec, 145 secs
lola: 27852423 markings, 109517257 edges, 152727 markings/sec, 150 secs
lola: 28595196 markings, 112555435 edges, 148555 markings/sec, 155 secs
lola: 29323157 markings, 115520537 edges, 145592 markings/sec, 160 secs
lola: 30030925 markings, 118354684 edges, 141554 markings/sec, 165 secs
lola: 30743358 markings, 121213261 edges, 142487 markings/sec, 170 secs
lola: 31447317 markings, 124073548 edges, 140792 markings/sec, 175 secs
lola: 32170778 markings, 127045993 edges, 144692 markings/sec, 180 secs
lola: 32897718 markings, 130093506 edges, 145388 markings/sec, 185 secs
lola: 33625018 markings, 133093002 edges, 145460 markings/sec, 190 secs
lola: 34383963 markings, 136187266 edges, 151789 markings/sec, 195 secs
lola: 35168065 markings, 139387577 edges, 156820 markings/sec, 200 secs
lola: 35884520 markings, 142359900 edges, 143291 markings/sec, 205 secs
lola: 36595864 markings, 145278802 edges, 142269 markings/sec, 210 secs
lola: 37353244 markings, 148371576 edges, 151476 markings/sec, 215 secs
lola: 38079003 markings, 151375739 edges, 145152 markings/sec, 220 secs
lola: 38816100 markings, 154418082 edges, 147419 markings/sec, 225 secs
lola: 39551762 markings, 157396579 edges, 147132 markings/sec, 230 secs
lola: 40262522 markings, 160342606 edges, 142152 markings/sec, 235 secs
lola: 40998784 markings, 163334868 edges, 147252 markings/sec, 240 secs
lola: 41697033 markings, 166229520 edges, 139650 markings/sec, 245 secs
lola: 42393223 markings, 169173643 edges, 139238 markings/sec, 250 secs
lola: 43079834 markings, 172054515 edges, 137322 markings/sec, 255 secs
lola: 43811204 markings, 175077612 edges, 146274 markings/sec, 260 secs
lola: 44535069 markings, 178085072 edges, 144773 markings/sec, 265 secs
lola: 45262817 markings, 181101959 edges, 145550 markings/sec, 270 secs
lola: 46026079 markings, 184211160 edges, 152652 markings/sec, 275 secs
lola: 46773944 markings, 187299574 edges, 149573 markings/sec, 280 secs
lola: 47515646 markings, 190377052 edges, 148340 markings/sec, 285 secs
lola: 48277659 markings, 193539917 edges, 152403 markings/sec, 290 secs
lola: 49027385 markings, 196655715 edges, 149945 markings/sec, 295 secs
lola: 49770837 markings, 199750155 edges, 148690 markings/sec, 300 secs
lola: 50498497 markings, 202782648 edges, 145532 markings/sec, 305 secs
lola: 51266807 markings, 205903851 edges, 153662 markings/sec, 310 secs
lola: 52009665 markings, 208999421 edges, 148572 markings/sec, 315 secs
lola: 52750201 markings, 212082889 edges, 148107 markings/sec, 320 secs
lola: 53493161 markings, 215167089 edges, 148592 markings/sec, 325 secs
lola: 54220391 markings, 218213527 edges, 145446 markings/sec, 330 secs
lola: 54949840 markings, 221263238 edges, 145890 markings/sec, 335 secs
lola: 55686974 markings, 224303636 edges, 147427 markings/sec, 340 secs
lola: 56393760 markings, 227266989 edges, 141357 markings/sec, 345 secs
lola: 57147986 markings, 230390085 edges, 150845 markings/sec, 350 secs
lola: 57905253 markings, 233501013 edges, 151453 markings/sec, 355 secs
lola: 58623183 markings, 236513350 edges, 143586 markings/sec, 360 secs
lola: 59352037 markings, 239532474 edges, 145771 markings/sec, 365 secs
lola: 60098751 markings, 242597260 edges, 149343 markings/sec, 370 secs
lola: 60822221 markings, 245617837 edges, 144694 markings/sec, 375 secs
lola: 61535991 markings, 248615528 edges, 142754 markings/sec, 380 secs
lola: 62251713 markings, 251604451 edges, 143144 markings/sec, 385 secs
lola: 62968118 markings, 254636992 edges, 143281 markings/sec, 390 secs
lola: 63685562 markings, 257643473 edges, 143489 markings/sec, 395 secs
lola: 64403109 markings, 260657205 edges, 143509 markings/sec, 400 secs
lola: 65126210 markings, 263666347 edges, 144620 markings/sec, 405 secs
lola: 65853162 markings, 266702699 edges, 145390 markings/sec, 410 secs
lola: 66596439 markings, 269774234 edges, 148655 markings/sec, 415 secs
lola: 67093425 markings, 271868059 edges, 99397 markings/sec, 420 secs
lola: 67108176 markings, 271924842 edges, 2950 markings/sec, 425 secs
lola: 67108976 markings, 271928732 edges, 160 markings/sec, 430 secs
lola: 67109273 markings, 271930187 edges, 59 markings/sec, 435 secs
lola: 67109314 markings, 271930415 edges, 8 markings/sec, 440 secs
lola: 67109710 markings, 271932037 edges, 79 markings/sec, 445 secs
lola: 67112427 markings, 271943696 edges, 543 markings/sec, 450 secs
lola: 67119455 markings, 271972511 edges, 1406 markings/sec, 455 secs
lola: 67136397 markings, 272046752 edges, 3388 markings/sec, 460 secs
lola: 67140833 markings, 272067841 edges, 887 markings/sec, 465 secs
lola: 67143558 markings, 272081086 edges, 545 markings/sec, 470 secs
lola: 67147804 markings, 272100795 edges, 849 markings/sec, 475 secs
lola: 67151235 markings, 272118385 edges, 686 markings/sec, 480 secs
lola: 67151528 markings, 272119629 edges, 59 markings/sec, 485 secs
lola: 67156486 markings, 272141007 edges, 992 markings/sec, 490 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1020 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p_1_2_1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (p_1_2_1 <= 0)
lola: processed formula length: 14
lola: 7 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 125 markings, 125 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((1 <= p_0_0_0))) AND A (G (E (F ((1 <= p_0_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p_0_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((1 <= p_0_0_0)))
lola: processed formula length: 22
lola: 6 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 36 markings, 36 edges
lola: ========================================
lola: subprocess 15 will run for 3062 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p_0_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (1 <= p_0_1_2)
lola: processed formula length: 14
lola: 7 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 1408661 markings, 3858555 edges, 281732 markings/sec, 0 secs
lola: 2534201 markings, 7325965 edges, 225108 markings/sec, 5 secs
lola: 3561410 markings, 10567669 edges, 205442 markings/sec, 10 secs
lola: 4546518 markings, 13768020 edges, 197022 markings/sec, 15 secs
lola: 5560750 markings, 17040520 edges, 202846 markings/sec, 20 secs
lola: 6525248 markings, 20209592 edges, 192900 markings/sec, 25 secs
lola: 7481136 markings, 23376384 edges, 191178 markings/sec, 30 secs
lola: 8450936 markings, 26576678 edges, 193960 markings/sec, 35 secs
lola: 9430774 markings, 29836334 edges, 195968 markings/sec, 40 secs
lola: 10456055 markings, 33243624 edges, 205056 markings/sec, 45 secs
lola: 11395554 markings, 36350634 edges, 187900 markings/sec, 50 secs
lola: 12295404 markings, 39415646 edges, 179970 markings/sec, 55 secs
lola: 13201995 markings, 42470841 edges, 181318 markings/sec, 60 secs
lola: 14104639 markings, 45510795 edges, 180529 markings/sec, 65 secs
lola: 14988817 markings, 48525540 edges, 176836 markings/sec, 70 secs
lola: 15886245 markings, 51617091 edges, 179486 markings/sec, 75 secs
lola: 16856017 markings, 54932006 edges, 193954 markings/sec, 80 secs
lola: 17833648 markings, 58281067 edges, 195526 markings/sec, 85 secs
lola: 18771131 markings, 61535929 edges, 187497 markings/sec, 90 secs
lola: 19686695 markings, 64714639 edges, 183113 markings/sec, 95 secs
lola: 20629935 markings, 67938164 edges, 188648 markings/sec, 100 secs
lola: 21546135 markings, 71124129 edges, 183240 markings/sec, 105 secs
lola: 22467479 markings, 74335883 edges, 184269 markings/sec, 110 secs
lola: 23393500 markings, 77538980 edges, 185204 markings/sec, 115 secs
lola: 24294101 markings, 80697575 edges, 180120 markings/sec, 120 secs
lola: 25161460 markings, 83802237 edges, 173472 markings/sec, 125 secs
lola: 26080150 markings, 87013229 edges, 183738 markings/sec, 130 secs
lola: 26985169 markings, 90189097 edges, 181004 markings/sec, 135 secs
lola: 27872155 markings, 93330717 edges, 177397 markings/sec, 140 secs
lola: 28805714 markings, 96536895 edges, 186712 markings/sec, 145 secs
lola: 29709819 markings, 99700567 edges, 180821 markings/sec, 150 secs
lola: 30552273 markings, 102734572 edges, 168491 markings/sec, 155 secs
lola: 31398063 markings, 105759300 edges, 169158 markings/sec, 160 secs
lola: 32259400 markings, 108834208 edges, 172267 markings/sec, 165 secs
lola: 33144268 markings, 111945323 edges, 176974 markings/sec, 170 secs
lola: 33987005 markings, 114973046 edges, 168547 markings/sec, 175 secs
lola: 34826606 markings, 117993892 edges, 167920 markings/sec, 180 secs
lola: 35683077 markings, 121065978 edges, 171294 markings/sec, 185 secs
lola: 36449769 markings, 123826766 edges, 153338 markings/sec, 190 secs
lola: 37301492 markings, 126877554 edges, 170345 markings/sec, 195 secs
lola: 38105777 markings, 129763075 edges, 160857 markings/sec, 200 secs
lola: 38924259 markings, 132678340 edges, 163696 markings/sec, 205 secs
lola: 39699698 markings, 135456865 edges, 155088 markings/sec, 210 secs
lola: 40489667 markings, 138290672 edges, 157994 markings/sec, 215 secs
lola: 41276020 markings, 141102682 edges, 157271 markings/sec, 220 secs
lola: 42065686 markings, 144003458 edges, 157933 markings/sec, 225 secs
lola: 42889297 markings, 146981215 edges, 164722 markings/sec, 230 secs
lola: 43681170 markings, 149894880 edges, 158375 markings/sec, 235 secs
lola: 44503020 markings, 152861363 edges, 164370 markings/sec, 240 secs
lola: 45257044 markings, 155593589 edges, 150805 markings/sec, 245 secs
lola: 46053479 markings, 158435023 edges, 159287 markings/sec, 250 secs
lola: 46783323 markings, 161123289 edges, 145969 markings/sec, 255 secs
lola: 47520145 markings, 163816363 edges, 147364 markings/sec, 260 secs
lola: 48295953 markings, 166586713 edges, 155162 markings/sec, 265 secs
lola: 49060279 markings, 169317552 edges, 152865 markings/sec, 270 secs
lola: 49862055 markings, 172217016 edges, 160355 markings/sec, 275 secs
lola: 50660488 markings, 175136891 edges, 159687 markings/sec, 280 secs
lola: 51458607 markings, 178059133 edges, 159624 markings/sec, 285 secs
lola: 52259801 markings, 180964936 edges, 160239 markings/sec, 290 secs
lola: 53057146 markings, 183877933 edges, 159469 markings/sec, 295 secs
lola: 53854428 markings, 186791388 edges, 159456 markings/sec, 300 secs
lola: 54651180 markings, 189722766 edges, 159350 markings/sec, 305 secs
lola: 55426955 markings, 192585884 edges, 155155 markings/sec, 310 secs
lola: 56257348 markings, 195566877 edges, 166079 markings/sec, 315 secs
lola: 57063773 markings, 198490731 edges, 161285 markings/sec, 320 secs
lola: 57881317 markings, 201423924 edges, 163509 markings/sec, 325 secs
lola: 58682298 markings, 204358189 edges, 160196 markings/sec, 330 secs
lola: 59447480 markings, 207196406 edges, 153036 markings/sec, 335 secs
lola: 59451218 markings, 207209334 edges, 748 markings/sec, 340 secs
lola: 59462511 markings, 207246237 edges, 2259 markings/sec, 345 secs
lola: 59463852 markings, 207251185 edges, 268 markings/sec, 350 secs
lola: 59474926 markings, 207291755 edges, 2215 markings/sec, 355 secs
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 2697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p_0_1_2) AND (E (F ((p_0_2_2 + 1 <= p_2_1_2))) AND E (F (E (G ((2 <= p_1_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p_0_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p_0_1_2)
lola: processed formula length: 14
lola: 6 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 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: E (F (E (G ((2 <= p_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (2 <= p_1_1_2)
lola: processed formula length: 14
lola: 7 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 35 markings, 35 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 ((p_2_2_1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (p_2_2_1 <= 0)
lola: processed formula length: 14
lola: 7 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 1524095 markings, 5465849 edges, 304819 markings/sec, 0 secs
lola: 2778195 markings, 10093801 edges, 250820 markings/sec, 5 secs
lola: 3930773 markings, 14477159 edges, 230516 markings/sec, 10 secs
lola: 5051352 markings, 18724806 edges, 224116 markings/sec, 15 secs
lola: 6099390 markings, 22788866 edges, 209608 markings/sec, 20 secs
lola: 7123051 markings, 26791224 edges, 204732 markings/sec, 25 secs
lola: 8131644 markings, 30699211 edges, 201719 markings/sec, 30 secs
lola: 9133323 markings, 34597658 edges, 200336 markings/sec, 35 secs
lola: 10108094 markings, 38422208 edges, 194954 markings/sec, 40 secs
lola: 11094031 markings, 42294532 edges, 197187 markings/sec, 45 secs
lola: 12056088 markings, 46185597 edges, 192411 markings/sec, 50 secs
lola: 13026135 markings, 49974144 edges, 194009 markings/sec, 55 secs
lola: 13967417 markings, 53721242 edges, 188256 markings/sec, 60 secs
lola: 14913902 markings, 57477657 edges, 189297 markings/sec, 65 secs
lola: 15853454 markings, 61179523 edges, 187910 markings/sec, 70 secs
lola: 16793574 markings, 64897874 edges, 188024 markings/sec, 75 secs
lola: 17698822 markings, 68547447 edges, 181050 markings/sec, 80 secs
lola: 18618178 markings, 72193912 edges, 183871 markings/sec, 85 secs
lola: 19495029 markings, 75744913 edges, 175370 markings/sec, 90 secs
lola: 20348723 markings, 79232179 edges, 170739 markings/sec, 95 secs
lola: 21231404 markings, 82793359 edges, 176536 markings/sec, 100 secs
lola: 22117438 markings, 86309948 edges, 177207 markings/sec, 105 secs
lola: 22968096 markings, 89807061 edges, 170132 markings/sec, 110 secs
lola: 23842322 markings, 93320851 edges, 174845 markings/sec, 115 secs
lola: 24713865 markings, 96827823 edges, 174309 markings/sec, 120 secs
lola: 25589115 markings, 100376965 edges, 175050 markings/sec, 125 secs
lola: 26452368 markings, 103865369 edges, 172651 markings/sec, 130 secs
lola: 27333301 markings, 107419471 edges, 176187 markings/sec, 135 secs
lola: 28179883 markings, 110889415 edges, 169316 markings/sec, 140 secs
lola: 29042986 markings, 114363243 edges, 172621 markings/sec, 145 secs
lola: 29878206 markings, 117735862 edges, 167044 markings/sec, 150 secs
lola: 30717244 markings, 121104960 edges, 167808 markings/sec, 155 secs
lola: 31556001 markings, 124498321 edges, 167751 markings/sec, 160 secs
lola: 32355545 markings, 127817665 edges, 159909 markings/sec, 165 secs
lola: 33143407 markings, 131112804 edges, 157572 markings/sec, 170 secs
lola: 33960090 markings, 134447764 edges, 163337 markings/sec, 175 secs
lola: 34780242 markings, 137805720 edges, 164030 markings/sec, 180 secs
lola: 35572165 markings, 141077720 edges, 158385 markings/sec, 185 secs
lola: 36391103 markings, 144429583 edges, 163788 markings/sec, 190 secs
lola: 37197982 markings, 147727290 edges, 161376 markings/sec, 195 secs
lola: 37997303 markings, 151047094 edges, 159864 markings/sec, 200 secs
lola: 38821723 markings, 154440982 edges, 164884 markings/sec, 205 secs
lola: 39651286 markings, 157813046 edges, 165913 markings/sec, 210 secs
lola: 40455641 markings, 161140041 edges, 160871 markings/sec, 215 secs
lola: 41263837 markings, 164443782 edges, 161639 markings/sec, 220 secs
lola: 42060335 markings, 167776216 edges, 159300 markings/sec, 225 secs
lola: 42841280 markings, 171053391 edges, 156189 markings/sec, 230 secs
lola: 43629021 markings, 174317867 edges, 157548 markings/sec, 235 secs
lola: 44403821 markings, 177551380 edges, 154960 markings/sec, 240 secs
lola: 45178715 markings, 180759868 edges, 154979 markings/sec, 245 secs
lola: 45988909 markings, 184053839 edges, 162039 markings/sec, 250 secs
lola: 46764998 markings, 187261975 edges, 155218 markings/sec, 255 secs
lola: 47541281 markings, 190475353 edges, 155257 markings/sec, 260 secs
lola: 48318815 markings, 193728555 edges, 155507 markings/sec, 265 secs
lola: 49096492 markings, 196951249 edges, 155535 markings/sec, 270 secs
lola: 49871298 markings, 200164363 edges, 154961 markings/sec, 275 secs
lola: 50626356 markings, 203315721 edges, 151012 markings/sec, 280 secs
lola: 51420668 markings, 206544179 edges, 158862 markings/sec, 285 secs
lola: 52197271 markings, 209772901 edges, 155321 markings/sec, 290 secs
lola: 52961686 markings, 212952099 edges, 152883 markings/sec, 295 secs
lola: 53708004 markings, 216063887 edges, 149264 markings/sec, 300 secs
lola: 54464946 markings, 219232192 edges, 151388 markings/sec, 305 secs
lola: 55226865 markings, 222405148 edges, 152384 markings/sec, 310 secs
lola: 55978337 markings, 225538277 edges, 150294 markings/sec, 315 secs
lola: 56732964 markings, 228671954 edges, 150925 markings/sec, 320 secs
lola: 57503976 markings, 231847479 edges, 154202 markings/sec, 325 secs
lola: 58254407 markings, 234981965 edges, 150086 markings/sec, 330 secs
lola: 58995973 markings, 238092545 edges, 148313 markings/sec, 335 secs
lola: 59788978 markings, 241297005 edges, 158601 markings/sec, 340 secs
lola: 60551325 markings, 244478318 edges, 152469 markings/sec, 345 secs
lola: 61271683 markings, 247550207 edges, 144072 markings/sec, 350 secs
lola: 62042929 markings, 250719940 edges, 154249 markings/sec, 355 secs
lola: 62784855 markings, 253869886 edges, 148385 markings/sec, 360 secs
lola: 63534644 markings, 257003177 edges, 149958 markings/sec, 365 secs
lola: 64265839 markings, 260087375 edges, 146239 markings/sec, 370 secs
lola: 65011943 markings, 263199880 edges, 149221 markings/sec, 375 secs
lola: 65761011 markings, 266310425 edges, 149814 markings/sec, 380 secs
lola: 66508260 markings, 269406755 edges, 149450 markings/sec, 385 secs
lola: 67107449 markings, 271921033 edges, 119838 markings/sec, 390 secs
lola: 67113027 markings, 271945721 edges, 1116 markings/sec, 395 secs
lola: 67115254 markings, 271954676 edges, 445 markings/sec, 400 secs
lola: 67122467 markings, 271985946 edges, 1443 markings/sec, 405 secs
lola: 67135068 markings, 272039776 edges, 2520 markings/sec, 410 secs
lola: 67143871 markings, 272082559 edges, 1761 markings/sec, 415 secs
lola: 67167617 markings, 272191015 edges, 4749 markings/sec, 420 secs
lola: 67168861 markings, 272196293 edges, 249 markings/sec, 425 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (G ((1 <= p_0_0_0))) AND A (G (E (F ((1 <= p_0_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p_0_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((1 <= p_0_0_0)))
lola: processed formula length: 22
lola: 6 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 36 markings, 36 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p_0_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (1 <= p_0_1_2)
lola: processed formula length: 14
lola: 7 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: 1549184 markings, 4284634 edges, 309837 markings/sec, 0 secs
lola: 2814420 markings, 8200526 edges, 253047 markings/sec, 5 secs
lola: 3985721 markings, 11942214 edges, 234260 markings/sec, 10 secs
lola: 5126418 markings, 15626562 edges, 228139 markings/sec, 15 secs
lola: 6228929 markings, 19233955 edges, 220502 markings/sec, 20 secs
lola: 7314989 markings, 22806248 edges, 217212 markings/sec, 25 secs
lola: 8377897 markings, 26332777 edges, 212582 markings/sec, 30 secs
lola: 9434011 markings, 29847372 edges, 211223 markings/sec, 35 secs
lola: 10482706 markings, 33337290 edges, 209739 markings/sec, 40 secs
lola: 11443679 markings, 36506421 edges, 192195 markings/sec, 45 secs
lola: 12343172 markings, 39579967 edges, 179899 markings/sec, 50 secs
lola: 13263278 markings, 42682107 edges, 184021 markings/sec, 55 secs
lola: 14232841 markings, 45938241 edges, 193913 markings/sec, 60 secs
lola: 15224399 markings, 49320050 edges, 198312 markings/sec, 65 secs
lola: 16172667 markings, 52601610 edges, 189654 markings/sec, 70 secs
lola: 17153886 markings, 55964916 edges, 196244 markings/sec, 75 secs
lola: 18134984 markings, 59320524 edges, 196220 markings/sec, 80 secs
lola: 19079724 markings, 62606769 edges, 188948 markings/sec, 85 secs
lola: 20041888 markings, 65878630 edges, 192433 markings/sec, 90 secs
lola: 20973935 markings, 69123547 edges, 186409 markings/sec, 95 secs
lola: 21922204 markings, 72408449 edges, 189654 markings/sec, 100 secs
lola: 22826319 markings, 75592438 edges, 180823 markings/sec, 105 secs
lola: 23744150 markings, 78776419 edges, 183566 markings/sec, 110 secs
lola: 24642124 markings, 81925002 edges, 179595 markings/sec, 115 secs
lola: 25454443 markings, 84818381 edges, 162464 markings/sec, 120 secs
lola: 26266461 markings, 87680718 edges, 162404 markings/sec, 125 secs
lola: 27158270 markings, 90800728 edges, 178362 markings/sec, 130 secs
lola: 28016256 markings, 93825316 edges, 171597 markings/sec, 135 secs
lola: 28950434 markings, 97053686 edges, 186836 markings/sec, 140 secs
lola: 29863734 markings, 100244458 edges, 182660 markings/sec, 145 secs
lola: 30642341 markings, 103051231 edges, 155721 markings/sec, 150 secs
lola: 31484072 markings, 106075119 edges, 168346 markings/sec, 155 secs
lola: 32295065 markings, 108961524 edges, 162199 markings/sec, 160 secs
lola: 33122107 markings, 111867397 edges, 165408 markings/sec, 165 secs
lola: 33912073 markings, 114706901 edges, 157993 markings/sec, 170 secs
lola: 34772766 markings, 117802172 edges, 172139 markings/sec, 175 secs
lola: 35661109 markings, 120984894 edges, 177669 markings/sec, 180 secs
lola: 36523219 markings, 124112938 edges, 172422 markings/sec, 185 secs
lola: 37433504 markings, 127316933 edges, 182057 markings/sec, 190 secs
lola: 38309351 markings, 130443045 edges, 175169 markings/sec, 195 secs
lola: 39162998 markings, 133554009 edges, 170729 markings/sec, 200 secs
lola: 40058816 markings, 136734812 edges, 179164 markings/sec, 205 secs
lola: 40906164 markings, 139810842 edges, 169470 markings/sec, 210 secs
lola: 41795528 markings, 143001882 edges, 177873 markings/sec, 215 secs
lola: 42652622 markings, 146117354 edges, 171419 markings/sec, 220 secs
lola: 43489388 markings, 149200378 edges, 167353 markings/sec, 225 secs
lola: 44353607 markings, 152314346 edges, 172844 markings/sec, 230 secs
lola: 45195333 markings, 155363770 edges, 168345 markings/sec, 235 secs
lola: 46071108 markings, 158501439 edges, 175155 markings/sec, 240 secs
lola: 46898554 markings, 161547901 edges, 165489 markings/sec, 245 secs
lola: 47777008 markings, 164690161 edges, 175691 markings/sec, 250 secs
lola: 48633155 markings, 167774218 edges, 171229 markings/sec, 255 secs
lola: 49455986 markings, 170771302 edges, 164566 markings/sec, 260 secs
lola: 50321773 markings, 173875911 edges, 173157 markings/sec, 265 secs
lola: 51134884 markings, 176875874 edges, 162622 markings/sec, 270 secs
lola: 51938839 markings, 179798181 edges, 160791 markings/sec, 275 secs
lola: 52702440 markings, 182590103 edges, 152720 markings/sec, 280 secs
lola: 53439381 markings, 185276556 edges, 147388 markings/sec, 285 secs
lola: 54167272 markings, 187931553 edges, 145578 markings/sec, 290 secs
lola: 54921377 markings, 190705373 edges, 150821 markings/sec, 295 secs
lola: 55654393 markings, 193394696 edges, 146603 markings/sec, 300 secs
lola: 56415369 markings, 196118154 edges, 152195 markings/sec, 305 secs
lola: 57150438 markings, 198772281 edges, 147014 markings/sec, 310 secs
lola: 57894592 markings, 201474421 edges, 148831 markings/sec, 315 secs
lola: 58657603 markings, 204266767 edges, 152602 markings/sec, 320 secs
lola: 59431461 markings, 207134962 edges, 154772 markings/sec, 325 secs
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: ========================================
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: ((1 <= p_0_1_2) AND (E (F ((p_0_2_2 + 1 <= p_2_1_2))) AND E (F (E (G ((2 <= p_1_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p_0_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p_0_1_2)
lola: processed formula length: 14
lola: 6 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: ========================================
lola: ...considering subproblem: E (F ((p_0_2_2 + 1 <= p_2_1_2)))
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 ((p_0_2_2 + 1 <= p_2_1_2)))
lola: processed formula length: 32
lola: 7 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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:625
lola: formula 0: (p_0_2_2 + 1 <= p_2_1_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((2 <= p_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (2 <= p_1_1_2)
lola: processed formula length: 14
lola: 7 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 35 markings, 35 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no unknown yes yes no yes unknown yes yes yes yes yes
lola:
preliminary result: no yes no no no unknown yes yes no yes unknown yes yes yes yes yes
lola: memory consumption: 21404 KB
lola: time consumption: 1637 seconds

BK_STOP 1527023226834

--------------------
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-d3n3m1t11"
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-d3n3m1t11.tgz
mv NeighborGrid-PT-d3n3m1t11 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-d3n3m1t11, 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-152666469200220"
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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;