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 59M
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.8K 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.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 59M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeighborGrid-PT-d5n4m1t35, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469200234
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527022949414

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeighborGrid-PT-d5n4m1t35 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating NeighborGrid-PT-d5n4m1t35 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ NeighborGrid-PT-d5n4m1t35 @ 3568 seconds
lola: LoLA will run for 3568 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 197632/65536 symbol table entries, 177787 collisions
lola: preprocessing...
lola: Size of bit vector: 32768
lola: finding significant places
lola: 1024 places, 196608 transitions, 1023 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1024 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
lola: A (F (((p_0_1_1_2_1 + 1 <= p_3_2_2_0_3) AND (p_1_0_1_2_2 <= 1) AND (((p_3_0_1_0_1 <= p_1_1_1_2_3) AND (3 <= p_3_3_0_1_3)) OR (p_1_0_3_3_1 <= 1))))) : ((E (X ((p_0_0_3_3_3 + 1 <= p_3_0_0_1_1))) OR ((p_2_1_3_3_2 + 1 <= p_0_2_3_1_0) OR (p_2_3_1_1_2 <= 2))) AND E (G ((p_2_3_2_2_2 <= p_0_0_3_2_1)))) : E (X (A (X (((2 <= p_2_3_2_3_0) OR (p_1_1_3_3_3 <= p_0_0_1_2_1)))))) : ((p_0_3_3_2_1 <= p_1_0_1_2_3) AND ((A (G ((p_2_2_0_1_1 <= p_0_2_1_2_3))) AND ((p_2_3_0_0_1 <= p_1_1_3_1_2) AND (p_2_3_2_1_0 <= p_2_0_1_1_2) AND (p_1_1_3_1_1 <= 1))) OR (((p_2_0_1_0_3 <= 0) OR (p_0_2_2_1_1 <= 1)) AND (p_2_3_3_2_1 <= 0)))) : A (F (A (X ((p_3_2_2_2_1 <= p_1_0_1_2_3))))) : A ((E (X ((2 <= p_0_1_0_1_3))) U A (X ((3 <= p_3_1_3_0_2))))) : ((NOT(E (F ((p_3_1_0_0_2 <= p_0_3_1_1_0)))) AND A (((2 <= p_1_3_0_1_2) U (p_1_1_1_2_0 <= p_2_0_3_0_2)))) OR E (G (((1 <= p_1_3_1_1_3) AND (p_0_1_3_2_1 <= p_0_0_2_1_2) AND (p_0_3_0_1_2 <= p_0_3_3_3_0))))) : ((3 <= p_0_0_3_1_1) OR ((1 <= p_2_1_1_3_1) AND (A (F ((2 <= p_0_3_0_2_3))) OR E (F ((3 <= p_1_3_1_1_3)))))) : (A (F (((p_2_2_0_2_3 <= 0) OR (p_3_1_3_3_3 + 1 <= p_0_1_0_0_3)))) AND E (F ((p_0_1_0_2_3 <= p_0_0_0_0_2)))) : E ((((p_3_3_1_0_3 <= 2) OR (p_0_2_3_0_1 <= p_0_0_0_1_0)) U ((3 <= p_2_2_3_3_0) AND (3 <= p_3_3_1_2_2)))) : A (X (A (F (((p_2_3_2_2_3 <= p_2_0_0_2_1) OR (2 <= p_3_3_1_3_1)))))) : ((p_3_3_3_1_0 <= p_1_0_0_2_3) AND E (F (A (F ((3 <= p_0_0_3_2_0)))))) : NOT(E (F (A (X ((3 <= p_3_0_2_0_1)))))) : A (G ((p_2_0_0_1_0 <= 2))) : A (F ((3 <= p_1_3_1_3_2))) : (A (X (E (F ((p_2_2_2_0_1 <= p_2_3_2_0_3))))) AND ((p_1_2_1_2_2 + 1 <= p_1_0_0_2_0) OR ((p_1_0_2_1_3 <= p_3_0_3_2_2) AND (1 <= p_0_3_2_0_0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X ((p_0_0_3_3_3 + 1 <= p_3_0_0_1_1))) OR ((p_2_1_3_3_2 + 1 <= p_0_2_3_1_0) OR (p_2_3_1_1_2 <= 2))) AND E (G ((p_2_3_2_2_2 <= p_0_0_3_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_2_1_3_3_2 + 1 <= p_0_2_3_1_0) OR (p_2_3_1_1_2 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_2_1_3_3_2 + 1 <= p_0_2_3_1_0) OR (p_2_3_1_1_2 <= 2))
lola: processed formula length: 57
lola: 9 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
lola: processed formula with 2 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 1 will run for 204 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p_2_3_2_2_2 <= p_0_0_3_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p_2_3_2_2_2 <= p_0_0_3_2_1)))
lola: processed formula length: 36
lola: 9 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 1375 markings, 1374 edges, 275 markings/sec, 0 secs
lola: 2209 markings, 2208 edges, 167 markings/sec, 5 secs
lola: 2808 markings, 2807 edges, 120 markings/sec, 10 secs
lola: 3416 markings, 3415 edges, 122 markings/sec, 15 secs
lola: 3751 markings, 3750 edges, 67 markings/sec, 20 secs
lola: 4243 markings, 4242 edges, 98 markings/sec, 25 secs
lola: 4412 markings, 4411 edges, 34 markings/sec, 30 secs
lola: 4499 markings, 4498 edges, 17 markings/sec, 35 secs
lola: 4616 markings, 4615 edges, 23 markings/sec, 40 secs
lola: 4704 markings, 4703 edges, 18 markings/sec, 45 secs
lola: 4777 markings, 4776 edges, 15 markings/sec, 50 secs
lola: 4878 markings, 4877 edges, 20 markings/sec, 55 secs
lola: 4983 markings, 4982 edges, 21 markings/sec, 60 secs
lola: 5240 markings, 5239 edges, 51 markings/sec, 65 secs
lola: 5448 markings, 5447 edges, 42 markings/sec, 70 secs
lola: 5712 markings, 5711 edges, 53 markings/sec, 75 secs
lola: 5810 markings, 5809 edges, 20 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 5848 markings, 5848 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (((2 <= p_2_3_2_3_0) OR (p_1_1_3_3_3 <= p_0_0_1_2_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_2_3_2_3_0) OR (p_1_1_3_3_3 <= p_0_0_1_2_1))))
lola: processed formula length: 61
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 212 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((p_3_2_2_2_1 <= p_1_0_1_2_3)))))
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((p_3_2_2_2_1 <= p_1_0_1_2_3)))
lola: processed formula length: 42
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 553 markings, 552 edges, 111 markings/sec, 0 secs
lola: 1340 markings, 1339 edges, 157 markings/sec, 5 secs
lola: 4714 markings, 4713 edges, 675 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8168 markings, 8168 edges
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((2 <= p_0_1_0_1_3))) U A (X ((3 <= p_3_1_3_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(EX((2 <= p_0_1_0_1_3)) U AX((3 <= p_3_1_3_0_2)))
lola: processed formula length: 50
lola: 12 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 171 markings, 170 edges, 34 markings/sec, 0 secs
lola: 362 markings, 361 edges, 38 markings/sec, 5 secs
lola: 578 markings, 577 edges, 43 markings/sec, 10 secs
lola: 830 markings, 829 edges, 50 markings/sec, 15 secs
lola: 1111 markings, 1110 edges, 56 markings/sec, 20 secs
lola: 1443 markings, 1442 edges, 66 markings/sec, 25 secs
lola: 1817 markings, 1816 edges, 75 markings/sec, 30 secs
lola: 2268 markings, 2267 edges, 90 markings/sec, 35 secs
lola: 2785 markings, 2784 edges, 103 markings/sec, 40 secs
lola: 3447 markings, 3446 edges, 132 markings/sec, 45 secs
lola: 4231 markings, 4230 edges, 157 markings/sec, 50 secs
lola: 5416 markings, 5415 edges, 237 markings/sec, 55 secs
lola: 5696 markings, 5695 edges, 56 markings/sec, 60 secs
lola: 5971 markings, 5970 edges, 55 markings/sec, 65 secs
lola: 6221 markings, 6220 edges, 50 markings/sec, 70 secs
lola: 6472 markings, 6471 edges, 50 markings/sec, 75 secs
lola: 6730 markings, 6729 edges, 52 markings/sec, 80 secs
lola: 6990 markings, 6989 edges, 52 markings/sec, 85 secs
lola: 7251 markings, 7250 edges, 52 markings/sec, 90 secs
lola: 7563 markings, 7562 edges, 62 markings/sec, 95 secs
lola: 7956 markings, 7955 edges, 79 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8161 markings, 8161 edges

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((p_2_3_2_2_3 <= p_2_0_0_2_1) OR (2 <= p_3_3_1_3_1))))))
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_2_0_0_2_1 + 1 <= p_2_3_2_2_3) AND (p_3_3_1_3_1 <= 1))
lola: processed formula length: 57
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 868 markings, 867 edges, 174 markings/sec, 0 secs
lola: 1295 markings, 1294 edges, 85 markings/sec, 5 secs
lola: 1569 markings, 1568 edges, 55 markings/sec, 10 secs
lola: 1757 markings, 1756 edges, 38 markings/sec, 15 secs
lola: 1797 markings, 1796 edges, 8 markings/sec, 20 secs
lola: 1824 markings, 1823 edges, 5 markings/sec, 25 secs
lola: 1850 markings, 1849 edges, 5 markings/sec, 30 secs
lola: 1895 markings, 1894 edges, 9 markings/sec, 35 secs
lola: 1918 markings, 1917 edges, 5 markings/sec, 40 secs
lola: 1957 markings, 1956 edges, 8 markings/sec, 45 secs
lola: 1979 markings, 1978 edges, 4 markings/sec, 50 secs
lola: 2001 markings, 2000 edges, 4 markings/sec, 55 secs
lola: 2027 markings, 2026 edges, 5 markings/sec, 60 secs
lola: 2053 markings, 2052 edges, 5 markings/sec, 65 secs
lola: 2079 markings, 2078 edges, 5 markings/sec, 70 secs
lola: 2105 markings, 2104 edges, 5 markings/sec, 75 secs
lola: 2129 markings, 2128 edges, 5 markings/sec, 80 secs
lola: 2171 markings, 2170 edges, 8 markings/sec, 85 secs
lola: 2222 markings, 2221 edges, 10 markings/sec, 90 secs
lola: 2264 markings, 2263 edges, 8 markings/sec, 95 secs
lola: 2303 markings, 2302 edges, 8 markings/sec, 100 secs
lola: 2351 markings, 2350 edges, 10 markings/sec, 105 secs
lola: 2389 markings, 2388 edges, 8 markings/sec, 110 secs
lola: 2426 markings, 2425 edges, 7 markings/sec, 115 secs
lola: 2499 markings, 2498 edges, 15 markings/sec, 120 secs
lola: 2564 markings, 2563 edges, 13 markings/sec, 125 secs
lola: 2591 markings, 2590 edges, 5 markings/sec, 130 secs
lola: 2625 markings, 2624 edges, 7 markings/sec, 135 secs
lola: 2669 markings, 2668 edges, 9 markings/sec, 140 secs
lola: 2729 markings, 2728 edges, 12 markings/sec, 145 secs
lola: 2767 markings, 2766 edges, 8 markings/sec, 150 secs
lola: 2816 markings, 2815 edges, 10 markings/sec, 155 secs
lola: 2847 markings, 2846 edges, 6 markings/sec, 160 secs
lola: 2881 markings, 2880 edges, 7 markings/sec, 165 secs
lola: 2917 markings, 2916 edges, 7 markings/sec, 170 secs
lola: 2998 markings, 2997 edges, 16 markings/sec, 175 secs
lola: 3032 markings, 3031 edges, 7 markings/sec, 180 secs
lola: 3072 markings, 3071 edges, 8 markings/sec, 185 secs
lola: 3120 markings, 3119 edges, 10 markings/sec, 190 secs
lola: 3161 markings, 3160 edges, 8 markings/sec, 195 secs
lola: 3198 markings, 3197 edges, 7 markings/sec, 200 secs
lola: 3236 markings, 3235 edges, 8 markings/sec, 205 secs
lola: 3298 markings, 3297 edges, 12 markings/sec, 210 secs
lola: 3338 markings, 3337 edges, 8 markings/sec, 215 secs
lola: 3393 markings, 3392 edges, 11 markings/sec, 220 secs
lola: 3452 markings, 3451 edges, 12 markings/sec, 225 secs
lola: 3539 markings, 3538 edges, 17 markings/sec, 230 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes yes unknown no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 514048 KB
lola: time consumption: 959 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p_3_0_2_0_1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((p_3_0_2_0_1 <= 2)))))
lola: processed formula length: 42
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 3159 markings, 3158 edges, 632 markings/sec, 0 secs
lola: 7703 markings, 7702 edges, 909 markings/sec, 5 secs
lola: 16275 markings, 16441 edges, 1714 markings/sec, 10 secs
lola: 25931 markings, 26398 edges, 1931 markings/sec, 15 secs
lola: 36317 markings, 37259 edges, 2077 markings/sec, 20 secs
lola: 50612 markings, 52206 edges, 2859 markings/sec, 25 secs
lola: 66227 markings, 68500 edges, 3123 markings/sec, 30 secs
lola: 81795 markings, 84745 edges, 3114 markings/sec, 35 secs
lola: 98279 markings, 103755 edges, 3297 markings/sec, 40 secs
lola: 115086 markings, 124083 edges, 3361 markings/sec, 45 secs
lola: 131987 markings, 144581 edges, 3380 markings/sec, 50 secs
lola: 148889 markings, 165073 edges, 3380 markings/sec, 55 secs
lola: 165761 markings, 185488 edges, 3374 markings/sec, 60 secs
lola: 182514 markings, 205808 edges, 3351 markings/sec, 65 secs
lola: 199359 markings, 226213 edges, 3369 markings/sec, 70 secs
lola: 216111 markings, 246523 edges, 3350 markings/sec, 75 secs
lola: 232906 markings, 266878 edges, 3359 markings/sec, 80 secs
lola: 249744 markings, 287255 edges, 3368 markings/sec, 85 secs
lola: 266725 markings, 307845 edges, 3396 markings/sec, 90 secs
lola: 284108 markings, 328923 edges, 3477 markings/sec, 95 secs
lola: 300706 markings, 349003 edges, 3320 markings/sec, 100 secs
lola: 317366 markings, 369221 edges, 3332 markings/sec, 105 secs
lola: 333870 markings, 389187 edges, 3301 markings/sec, 110 secs
lola: 349355 markings, 407940 edges, 3097 markings/sec, 115 secs
lola: 365212 markings, 427192 edges, 3171 markings/sec, 120 secs
lola: 381408 markings, 446801 edges, 3239 markings/sec, 125 secs
lola: 397250 markings, 465994 edges, 3168 markings/sec, 130 secs
lola: 412257 markings, 484183 edges, 3001 markings/sec, 135 secs
lola: 428399 markings, 503732 edges, 3228 markings/sec, 140 secs
lola: 443530 markings, 522058 edges, 3026 markings/sec, 145 secs
lola: 457643 markings, 539188 edges, 2823 markings/sec, 150 secs
lola: 472227 markings, 556864 edges, 2917 markings/sec, 155 secs
lola: 486326 markings, 573921 edges, 2820 markings/sec, 160 secs
lola: 500427 markings, 591031 edges, 2820 markings/sec, 165 secs
lola: 515086 markings, 608779 edges, 2932 markings/sec, 170 secs
lola: 529146 markings, 625821 edges, 2812 markings/sec, 175 secs
lola: 543240 markings, 642902 edges, 2819 markings/sec, 180 secs
lola: 559553 markings, 662660 edges, 3263 markings/sec, 185 secs
lola: 576755 markings, 683508 edges, 3440 markings/sec, 190 secs
lola: 593508 markings, 703796 edges, 3351 markings/sec, 195 secs
lola: 610374 markings, 724257 edges, 3373 markings/sec, 200 secs
lola: 627278 markings, 744729 edges, 3381 markings/sec, 205 secs
lola: 644082 markings, 765068 edges, 3361 markings/sec, 210 secs
lola: 660991 markings, 785590 edges, 3382 markings/sec, 215 secs
lola: 677539 markings, 805616 edges, 3310 markings/sec, 220 secs
lola: 693933 markings, 825501 edges, 3279 markings/sec, 225 secs
lola: 710353 markings, 845375 edges, 3284 markings/sec, 230 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes yes unknown no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F ((p_2_2_2_0_1 <= p_2_3_2_0_3))))) AND ((p_1_2_1_2_2 + 1 <= p_1_0_0_2_0) OR ((p_1_0_2_1_3 <= p_3_0_3_2_2) AND (1 <= p_0_3_2_0_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_1_2_1_2_2 + 1 <= p_1_0_0_2_0) OR ((p_1_0_2_1_3 <= p_3_0_3_2_2) AND (1 <= p_0_3_2_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_1_2_1_2_2 + 1 <= p_1_0_0_2_0) OR ((p_1_0_2_1_3 <= p_3_0_3_2_2) AND (1 <= p_0_3_2_0_0)))
lola: processed formula length: 92
lola: 9 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: subprocess 7 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p_2_2_2_0_1 <= p_2_3_2_0_3)))))
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_2_2_2_0_1 <= p_2_3_2_0_3)))
lola: processed formula length: 42
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 15429 markings, 15430 edges, 3086 markings/sec, 0 secs
lola: 29274 markings, 29277 edges, 2769 markings/sec, 5 secs
lola: 46166 markings, 46169 edges, 3378 markings/sec, 10 secs
lola: 59817 markings, 59820 edges, 2730 markings/sec, 15 secs
lola: 74124 markings, 74132 edges, 2861 markings/sec, 20 secs
lola: 89393 markings, 89403 edges, 3054 markings/sec, 25 secs
lola: 105143 markings, 105153 edges, 3150 markings/sec, 30 secs
lola: 122296 markings, 122309 edges, 3431 markings/sec, 35 secs
lola: 139607 markings, 139623 edges, 3462 markings/sec, 40 secs
lola: 156680 markings, 156696 edges, 3415 markings/sec, 45 secs
lola: 172083 markings, 172104 edges, 3081 markings/sec, 50 secs
lola: 185954 markings, 185975 edges, 2774 markings/sec, 55 secs
lola: 199517 markings, 199540 edges, 2713 markings/sec, 60 secs
lola: 218973 markings, 218998 edges, 3891 markings/sec, 65 secs
lola: 233679 markings, 233705 edges, 2941 markings/sec, 70 secs
lola: 248053 markings, 248083 edges, 2875 markings/sec, 75 secs
lola: 264185 markings, 264214 edges, 3226 markings/sec, 80 secs
lola: 281061 markings, 281095 edges, 3375 markings/sec, 85 secs
lola: 300313 markings, 300352 edges, 3850 markings/sec, 90 secs
lola: 316143 markings, 316183 edges, 3166 markings/sec, 95 secs
lola: 334232 markings, 334279 edges, 3618 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 348747 markings, 348795 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p_2_0_0_1_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 ((p_2_0_0_1_0 <= 2)))
lola: processed formula length: 26
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: (3 <= p_2_0_0_1_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d5n4m1t35-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: 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-d5n4m1t35-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p_1_3_1_3_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_1_3_1_3_2 <= 2)
lola: processed formula length: 18
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 1439 markings, 1438 edges, 288 markings/sec, 0 secs
lola: 2190 markings, 2189 edges, 150 markings/sec, 5 secs
lola: 2831 markings, 2830 edges, 128 markings/sec, 10 secs
lola: 3339 markings, 3338 edges, 102 markings/sec, 15 secs
lola: 3608 markings, 3607 edges, 54 markings/sec, 20 secs
lola: 3761 markings, 3760 edges, 31 markings/sec, 25 secs
lola: 3822 markings, 3821 edges, 12 markings/sec, 30 secs
lola: 3928 markings, 3927 edges, 21 markings/sec, 35 secs
lola: 4104 markings, 4103 edges, 35 markings/sec, 40 secs
lola: 4272 markings, 4271 edges, 34 markings/sec, 45 secs
lola: 4532 markings, 4531 edges, 52 markings/sec, 50 secs
lola: 4733 markings, 4732 edges, 40 markings/sec, 55 secs
lola: 4894 markings, 4893 edges, 32 markings/sec, 60 secs
lola: 5041 markings, 5040 edges, 29 markings/sec, 65 secs
lola: 5155 markings, 5154 edges, 23 markings/sec, 70 secs
lola: 5305 markings, 5304 edges, 30 markings/sec, 75 secs
lola: 5455 markings, 5454 edges, 30 markings/sec, 80 secs
lola: 5604 markings, 5603 edges, 30 markings/sec, 85 secs
lola: 5809 markings, 5808 edges, 41 markings/sec, 90 secs
lola: 5929 markings, 5928 edges, 24 markings/sec, 95 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 5949 markings, 5949 edges
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p_0_1_1_2_1 + 1 <= p_3_2_2_0_3) AND (p_1_0_1_2_2 <= 1) AND (((p_3_0_1_0_1 <= p_1_1_1_2_3) AND (3 <= p_3_3_0_1_3)) OR (p_1_0_3_3_1 <= 1)))))
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_3_2_2_0_3 <= p_0_1_1_2_1) OR (2 <= p_1_0_1_2_2) OR (((p_1_1_1_2_3 + 1 <= p_3_0_1_0_1) OR (p_3_3_0_1_3 <= 2)) AND (2 <= p_1_0_3_3_1)))
lola: processed formula length: 140
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 742 markings, 741 edges, 148 markings/sec, 0 secs
lola: 1053 markings, 1052 edges, 62 markings/sec, 5 secs
lola: 1207 markings, 1206 edges, 31 markings/sec, 10 secs
lola: 1235 markings, 1234 edges, 6 markings/sec, 15 secs
lola: 1258 markings, 1257 edges, 5 markings/sec, 20 secs
lola: 1288 markings, 1287 edges, 6 markings/sec, 25 secs
lola: 1330 markings, 1329 edges, 8 markings/sec, 30 secs
lola: 1352 markings, 1351 edges, 4 markings/sec, 35 secs
lola: 1399 markings, 1398 edges, 9 markings/sec, 40 secs
lola: 1429 markings, 1428 edges, 6 markings/sec, 45 secs
lola: 1464 markings, 1463 edges, 7 markings/sec, 50 secs
lola: 1498 markings, 1497 edges, 7 markings/sec, 55 secs
lola: 1514 markings, 1513 edges, 3 markings/sec, 60 secs
lola: 1556 markings, 1555 edges, 8 markings/sec, 65 secs
lola: 1601 markings, 1600 edges, 9 markings/sec, 70 secs
lola: 1628 markings, 1627 edges, 5 markings/sec, 75 secs
lola: 1671 markings, 1670 edges, 9 markings/sec, 80 secs
lola: 1705 markings, 1704 edges, 7 markings/sec, 85 secs
lola: 1732 markings, 1731 edges, 5 markings/sec, 90 secs
lola: 1757 markings, 1756 edges, 5 markings/sec, 95 secs
lola: 1785 markings, 1784 edges, 6 markings/sec, 100 secs
lola: 1825 markings, 1824 edges, 8 markings/sec, 105 secs
lola: 1867 markings, 1866 edges, 8 markings/sec, 110 secs
lola: 1915 markings, 1914 edges, 10 markings/sec, 115 secs
lola: 1960 markings, 1959 edges, 9 markings/sec, 120 secs
lola: 1993 markings, 1992 edges, 7 markings/sec, 125 secs
lola: 2024 markings, 2023 edges, 6 markings/sec, 130 secs
lola: 2062 markings, 2061 edges, 8 markings/sec, 135 secs
lola: 2105 markings, 2104 edges, 9 markings/sec, 140 secs
lola: 2149 markings, 2148 edges, 9 markings/sec, 145 secs
lola: 2184 markings, 2183 edges, 7 markings/sec, 150 secs
lola: 2222 markings, 2221 edges, 8 markings/sec, 155 secs
lola: 2288 markings, 2287 edges, 13 markings/sec, 160 secs
lola: 2327 markings, 2326 edges, 8 markings/sec, 165 secs
lola: 2352 markings, 2351 edges, 5 markings/sec, 170 secs
lola: 2389 markings, 2388 edges, 7 markings/sec, 175 secs
lola: 2427 markings, 2426 edges, 8 markings/sec, 180 secs
lola: 2480 markings, 2479 edges, 11 markings/sec, 185 secs
lola: 2527 markings, 2526 edges, 9 markings/sec, 190 secs
lola: 2577 markings, 2576 edges, 10 markings/sec, 195 secs
lola: 2608 markings, 2607 edges, 6 markings/sec, 200 secs
lola: 2642 markings, 2641 edges, 7 markings/sec, 205 secs
lola: 2673 markings, 2672 edges, 6 markings/sec, 210 secs
lola: 2774 markings, 2773 edges, 20 markings/sec, 215 secs
lola: 2828 markings, 2827 edges, 11 markings/sec, 220 secs
lola: 2872 markings, 2871 edges, 9 markings/sec, 225 secs
lola: 2929 markings, 2928 edges, 11 markings/sec, 230 secs
lola: 2978 markings, 2977 edges, 10 markings/sec, 235 secs
lola: 3022 markings, 3021 edges, 9 markings/sec, 240 secs
lola: 3068 markings, 3067 edges, 9 markings/sec, 245 secs
lola: 3111 markings, 3110 edges, 9 markings/sec, 250 secs
lola: 3156 markings, 3155 edges, 9 markings/sec, 255 secs
lola: 3202 markings, 3201 edges, 9 markings/sec, 260 secs
lola: 3245 markings, 3244 edges, 9 markings/sec, 265 secs
lola: 3285 markings, 3284 edges, 8 markings/sec, 270 secs
lola: 3325 markings, 3324 edges, 8 markings/sec, 275 secs
lola: 3365 markings, 3364 edges, 8 markings/sec, 280 secs
lola: 3412 markings, 3411 edges, 9 markings/sec, 285 secs
lola: 3449 markings, 3448 edges, 7 markings/sec, 290 secs
lola: 3481 markings, 3480 edges, 6 markings/sec, 295 secs
lola: 3526 markings, 3525 edges, 9 markings/sec, 300 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes yes unknown no no unknown unknown unknown unknown unknown unknown unknown no no yes
lola: memory consumption: 592692 KB
lola: time consumption: 1715 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_3_3_3_1_0 <= p_1_0_0_2_3) AND E (F ((3 <= p_0_0_3_2_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_3_3_3_1_0 <= p_1_0_0_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_3_3_3_1_0 <= p_1_0_0_2_3)
lola: processed formula length: 28
lola: 9 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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 11 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p_0_0_3_2_0)))
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 ((3 <= p_0_0_3_2_0)))
lola: processed formula length: 26
lola: 10 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: (3 <= p_0_0_3_2_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d5n4m1t35-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file NeighborGrid-PT-d5n4m1t35-CTLCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p_3_3_1_0_3 <= 2) OR (p_0_2_3_0_1 <= p_0_0_0_1_0)) U ((3 <= p_2_2_3_3_0) AND (3 <= p_3_3_1_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((p_3_3_1_0_3 <= 2) OR (p_0_2_3_0_1 <= p_0_0_0_1_0)) U ((3 <= p_2_2_3_3_0) AND (3 <= p_3_3_1_2_2))))
lola: processed formula length: 105
lola: 12 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: ========================================
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((3 <= p_2_2_3_3_0) AND (3 <= p_3_3_1_2_2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d5n4m1t35-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file NeighborGrid-PT-d5n4m1t35-CTLCardinality-11-0.sara.
lola: sara is running 0 secs || 150 markings, 149 edges, 30 markings/sec, 0 secs
lola: sara is running 5 secs || 294 markings, 293 edges, 29 markings/sec, 5 secs
lola: sara is running 10 secs || 448 markings, 447 edges, 31 markings/sec, 10 secs
lola: sara is running 15 secs || 598 markings, 597 edges, 30 markings/sec, 15 secs
lola: sara is running 20 secs || 748 markings, 747 edges, 30 markings/sec, 20 secs
lola: sara is running 25 secs || 887 markings, 886 edges, 28 markings/sec, 25 secs
lola: sara is running 30 secs || 1015 markings, 1014 edges, 26 markings/sec, 30 secs
lola: sara is running 35 secs || 1148 markings, 1147 edges, 27 markings/sec, 35 secs
lola: sara is running 40 secs || 1268 markings, 1267 edges, 24 markings/sec, 40 secs
lola: sara is running 45 secs || 1390 markings, 1389 edges, 24 markings/sec, 45 secs
lola: sara is running 50 secs || 1508 markings, 1507 edges, 24 markings/sec, 50 secs
lola: sara is running 55 secs || 1621 markings, 1620 edges, 23 markings/sec, 55 secs
lola: sara is running 60 secs || 1742 markings, 1741 edges, 24 markings/sec, 60 secs
lola: sara is running 65 secs || 1859 markings, 1858 edges, 23 markings/sec, 65 secs
lola: sara is running 70 secs || 1973 markings, 1972 edges, 23 markings/sec, 70 secs
lola: sara is running 75 secs || 2077 markings, 2076 edges, 21 markings/sec, 75 secs
lola: sara is running 80 secs || 2177 markings, 2176 edges, 20 markings/sec, 80 secs
lola: sara is running 85 secs || 2273 markings, 2272 edges, 19 markings/sec, 85 secs
lola: sara is running 90 secs || 2367 markings, 2366 edges, 19 markings/sec, 90 secs
lola: sara is running 95 secs || 2461 markings, 2460 edges, 19 markings/sec, 95 secs
lola: sara is running 100 secs || 2554 markings, 2553 edges, 19 markings/sec, 100 secs
lola: sara is running 105 secs || 2654 markings, 2653 edges, 20 markings/sec, 105 secs
lola: sara is running 110 secs || 2756 markings, 2755 edges, 20 markings/sec, 110 secs
lola: sara is running 115 secs || 2859 markings, 2858 edges, 21 markings/sec, 115 secs
lola: sara is running 120 secs || 2958 markings, 2957 edges, 20 markings/sec, 120 secs
lola: sara is running 125 secs || 3059 markings, 3058 edges, 20 markings/sec, 125 secs
lola: sara is running 130 secs || 3149 markings, 3148 edges, 18 markings/sec, 130 secs
lola: sara is running 135 secs || 3239 markings, 3238 edges, 18 markings/sec, 135 secs
lola: sara is running 140 secs || 3332 markings, 3331 edges, 19 markings/sec, 140 secs
lola: sara is running 145 secs || 3428 markings, 3427 edges, 19 markings/sec, 145 secs
lola: sara is running 150 secs || 3522 markings, 3521 edges, 19 markings/sec, 150 secs
lola: sara is running 155 secs || 3620 markings, 3619 edges, 20 markings/sec, 155 secs
lola: sara is running 160 secs || 3709 markings, 3708 edges, 18 markings/sec, 160 secs
lola: sara is running 165 secs || 3797 markings, 3796 edges, 18 markings/sec, 165 secs
lola: sara is running 170 secs || 3884 markings, 3883 edges, 17 markings/sec, 170 secs
lola: sara is running 175 secs || 3973 markings, 3972 edges, 18 markings/sec, 175 secs
lola: sara is running 180 secs || 4070 markings, 4069 edges, 19 markings/sec, 180 secs
lola: sara is running 185 secs || 4169 markings, 4168 edges, 20 markings/sec, 185 secs
lola: sara is running 190 secs || 4265 markings, 4264 edges, 19 markings/sec, 190 secs
lola: sara is running 195 secs || 4356 markings, 4355 edges, 18 markings/sec, 195 secs
lola: sara is running 200 secs || 4445 markings, 4444 edges, 18 markings/sec, 200 secs
lola: sara is running 205 secs || 4527 markings, 4526 edges, 16 markings/sec, 205 secs
lola: sara is running 210 secs || 4610 markings, 4609 edges, 17 markings/sec, 210 secs
lola: sara is running 215 secs || 4698 markings, 4697 edges, 18 markings/sec, 215 secs
lola: sara is running 220 secs || 4782 markings, 4781 edges, 17 markings/sec, 220 secs
lola: sara is running 225 secs || 4859 markings, 4858 edges, 15 markings/sec, 225 secs
lola: sara is running 230 secs || 4935 markings, 4934 edges, 15 markings/sec, 230 secs
lola: sara is running 235 secs || 5012 markings, 5011 edges, 15 markings/sec, 235 secs
lola: sara is running 240 secs || 5093 markings, 5092 edges, 16 markings/sec, 240 secs
lola: sara is running 245 secs || 5175 markings, 5174 edges, 16 markings/sec, 245 secs
lola: sara is running 250 secs || 5254 markings, 5253 edges, 16 markings/sec, 250 secs
lola: sara is running 255 secs || 5329 markings, 5328 edges, 15 markings/sec, 255 secs
lola: sara is running 260 secs || 5402 markings, 5401 edges, 15 markings/sec, 260 secs
lola: sara is running 265 secs || 5476 markings, 5475 edges, 15 markings/sec, 265 secs
lola: sara is running 270 secs || 5561 markings, 5560 edges, 17 markings/sec, 270 secs
lola: sara is running 275 secs || 5645 markings, 5644 edges, 17 markings/sec, 275 secs
lola: sara is running 280 secs || 5727 markings, 5726 edges, 16 markings/sec, 280 secs
lola: sara is running 285 secs || 5809 markings, 5808 edges, 16 markings/sec, 285 secs
lola: sara is running 290 secs || 5891 markings, 5890 edges, 16 markings/sec, 290 secs
lola: sara is running 295 secs || 5975 markings, 5974 edges, 17 markings/sec, 295 secs
lola: sara is running 300 secs || 6058 markings, 6057 edges, 17 markings/sec, 300 secs
lola: sara is running 305 secs || 6141 markings, 6140 edges, 17 markings/sec, 305 secs
lola: sara is running 310 secs || 6223 markings, 6222 edges, 16 markings/sec, 310 secs
lola: sara is running 315 secs || 6306 markings, 6305 edges, 17 markings/sec, 315 secs
lola: sara is running 320 secs || 6389 markings, 6388 edges, 17 markings/sec, 320 secs
lola: sara is running 325 secs || 6469 markings, 6468 edges, 16 markings/sec, 325 secs
lola: sara is running 330 secs || 6553 markings, 6552 edges, 17 markings/sec, 330 secs
lola: sara is running 335 secs || 6631 markings, 6630 edges, 16 markings/sec, 335 secs
lola: sara is running 340 secs || 6707 markings, 6706 edges, 15 markings/sec, 340 secs
lola: sara is running 345 secs || 6788 markings, 6787 edges, 16 markings/sec, 345 secs
lola: sara is running 350 secs || 6868 markings, 6867 edges, 16 markings/sec, 350 secs
lola: sara is running 355 secs || 6960 markings, 6959 edges, 18 markings/sec, 355 secs
lola: sara is running 360 secs || 7052 markings, 7051 edges, 18 markings/sec, 360 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes yes unknown no no unknown unknown unknown unknown unknown yes unknown no no yes
lola: memory consumption: 2376296 KB
lola: time consumption: 2086 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_0_3_3_2_1 <= p_1_0_1_2_3) AND ((A (G ((p_2_2_0_1_1 <= p_0_2_1_2_3))) AND ((p_2_3_0_0_1 <= p_1_1_3_1_2) AND (p_2_3_2_1_0 <= p_2_0_1_1_2) AND (p_1_1_3_1_1 <= 1))) OR (((p_2_0_1_0_3 <= 0) OR (p_0_2_2_1_1 <= 1)) AND (p_2_3_3_2_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p_2_0_1_0_3 <= 0) OR (p_0_2_2_1_1 <= 1)) AND (p_2_3_3_2_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p_2_0_1_0_3 <= 0) OR (p_0_2_2_1_1 <= 1)) AND (p_2_3_3_2_1 <= 0))
lola: processed formula length: 68
lola: 9 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_0_3_3_2_1 <= p_1_0_1_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_0_3_3_2_1 <= p_1_0_1_2_3)
lola: processed formula length: 28
lola: 9 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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 14 will run for 741 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_2_3_0_0_1 <= p_1_1_3_1_2) AND (p_2_3_2_1_0 <= p_2_0_1_1_2) AND (p_1_1_3_1_1 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_2_3_0_0_1 <= p_1_1_3_1_2) AND (p_2_3_2_1_0 <= p_2_0_1_1_2) AND (p_1_1_3_1_1 <= 1))
lola: processed formula length: 86
lola: 9 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: subprocess 15 will run for 1482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p_2_2_0_1_1 <= p_0_2_1_2_3)))
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_2_0_1_1 <= p_0_2_1_2_3)))
lola: processed formula length: 36
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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_0_2_1_2_3 + 1 <= p_2_2_0_1_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d5n4m1t35-CTLCardinality-15-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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p_0_0_3_1_1) OR ((1 <= p_2_1_1_3_1) AND (A (F ((2 <= p_0_3_0_2_3))) OR E (F ((3 <= p_1_3_1_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p_1_3_1_1_3)))
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 ((3 <= p_1_3_1_1_3)))
lola: processed formula length: 26
lola: 10 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: (3 <= p_1_3_1_1_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d5n4m1t35-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file NeighborGrid-PT-d5n4m1t35-CTLCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 14 will run for 740 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p_2_1_1_3_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p_2_1_1_3_1)
lola: processed formula length: 18
lola: 9 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 740 seconds at most (--localtimelimit=0)
lola: ========================================
lola: lola: ...considering subproblem: (A (F (((p_2_2_0_2_3 <= 0) OR (p_3_1_3_3_3 + 1 <= p_0_1_0_0_3)))) AND E (F ((p_0_1_0_2_3 <= p_0_0_0_0_2))))
lola: ========================================
========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 740 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p_0_1_0_2_3 <= p_0_0_0_0_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_1_0_2_3 <= p_0_0_0_0_2)))
lola: processed formula length: 36
lola: 10 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: yes
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (p_0_1_0_2_3 <= p_0_0_0_0_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: lola: subprocess 15 will run for 1481 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p_2_2_0_2_3 <= 0) OR (p_3_1_3_3_3 + 1 <= p_0_1_0_0_3))))
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: ((1 <= p_2_2_0_2_3) AND (p_0_1_0_0_3 <= p_3_1_3_3_3))
lola: processed formula length: 53
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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)
state equation: write sara problem file to NeighborGrid-PT-d5n4m1t35-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file NeighborGrid-PT-d5n4m1t35-CTLCardinality-14-0.sara.
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 1532 markings, 1531 edges, 306 markings/sec, 0 secs
lola: 2356 markings, 2355 edges, 165 markings/sec, 5 secs
lola: 3078 markings, 3077 edges, 144 markings/sec, 10 secs
lola: 3688 markings, 3687 edges, 122 markings/sec, 15 secs
lola: 4481 markings, 4480 edges, 159 markings/sec, 20 secs
lola: 5066 markings, 5065 edges, 117 markings/sec, 25 secs
lola: 5218 markings, 5217 edges, 30 markings/sec, 30 secs
lola: 5370 markings, 5369 edges, 30 markings/sec, 35 secs
lola: 5481 markings, 5480 edges, 22 markings/sec, 40 secs
lola: 5636 markings, 5635 edges, 31 markings/sec, 45 secs
lola: 5793 markings, 5792 edges, 31 markings/sec, 50 secs
lola: 5927 markings, 5926 edges, 27 markings/sec, 55 secs
lola: 6120 markings, 6119 edges, 39 markings/sec, 60 secs
lola: 6424 markings, 6423 edges, 61 markings/sec, 65 secs
lola: 6717 markings, 6716 edges, 59 markings/sec, 70 secs
lola: 6945 markings, 6944 edges, 46 markings/sec, 75 secs
lola: 7102 markings, 7101 edges, 31 markings/sec, 80 secs
lola: 7183 markings, 7182 edges, 16 markings/sec, 85 secs
lola: 7293 markings, 7292 edges, 22 markings/sec, 90 secs
lola: 7426 markings, 7425 edges, 27 markings/sec, 95 secs
lola: 7569 markings, 7568 edges, 29 markings/sec, 100 secs
lola: 7711 markings, 7710 edges, 28 markings/sec, 105 secs
lola: 7859 markings, 7858 edges, 30 markings/sec, 110 secs
lola: 8209 markings, 8208 edges, 70 markings/sec, 115 secs
lola: 8324 markings, 8323 edges, 23 markings/sec, 120 secs
lola: 8488 markings, 8487 edges, 33 markings/sec, 125 secs
lola: 8568 markings, 8567 edges, 16 markings/sec, 130 secs
lola: 8688 markings, 8687 edges, 24 markings/sec, 135 secs
lola: 8922 markings, 8921 edges, 47 markings/sec, 140 secs
lola: 9102 markings, 9101 edges, 36 markings/sec, 145 secs
lola: 9282 markings, 9281 edges, 36 markings/sec, 150 secs
lola: 9459 markings, 9458 edges, 35 markings/sec, 155 secs
lola: 9636 markings, 9635 edges, 35 markings/sec, 160 secs
lola: 9926 markings, 9925 edges, 58 markings/sec, 165 secs
lola: 10274 markings, 10273 edges, 70 markings/sec, 170 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10487 markings, 10487 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 1302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((p_0_3_1_1_0 + 1 <= p_3_1_0_0_2))) AND A (((2 <= p_1_3_0_1_2) U (p_1_1_1_2_0 <= p_2_0_3_0_2)))) OR E (G (((1 <= p_1_3_1_1_3) AND (p_0_1_3_2_1 <= p_0_0_2_1_2) AND (p_0_3_0_1_2 <= p_0_3_3_3_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p_0_3_1_1_0 + 1 <= p_3_1_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:695
lola: processed formula: A (G ((p_0_3_1_1_0 + 1 <= p_3_1_0_0_2)))
lola: processed formula length: 40
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 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: ========================================
lola: ...considering subproblem: A (X (A (F (((p_2_3_2_2_3 <= p_2_0_0_2_1) OR (2 <= p_3_3_1_3_1))))))
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_2_0_0_2_1 + 1 <= p_2_3_2_2_3) AND (p_3_3_1_3_1 <= 1))
lola: processed formula length: 57
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 816 markings, 815 edges, 163 markings/sec, 0 secs
lola: 1226 markings, 1225 edges, 82 markings/sec, 5 secs
lola: 1499 markings, 1498 edges, 55 markings/sec, 10 secs
lola: 1718 markings, 1717 edges, 44 markings/sec, 15 secs
lola: 1765 markings, 1764 edges, 9 markings/sec, 20 secs
lola: 1802 markings, 1801 edges, 7 markings/sec, 25 secs
lola: 1824 markings, 1823 edges, 4 markings/sec, 30 secs
lola: 1846 markings, 1845 edges, 4 markings/sec, 35 secs
lola: 1890 markings, 1889 edges, 9 markings/sec, 40 secs
lola: 1901 markings, 1900 edges, 2 markings/sec, 45 secs
lola: 1930 markings, 1929 edges, 6 markings/sec, 50 secs
lola: 1963 markings, 1962 edges, 7 markings/sec, 55 secs
lola: 1980 markings, 1979 edges, 3 markings/sec, 60 secs
lola: 1997 markings, 1996 edges, 3 markings/sec, 65 secs
lola: 2021 markings, 2020 edges, 5 markings/sec, 70 secs
lola: 2047 markings, 2046 edges, 5 markings/sec, 75 secs
lola: 2071 markings, 2070 edges, 5 markings/sec, 80 secs
lola: 2097 markings, 2096 edges, 5 markings/sec, 85 secs
lola: 2123 markings, 2122 edges, 5 markings/sec, 90 secs
lola: 2155 markings, 2154 edges, 6 markings/sec, 95 secs
lola: 2208 markings, 2207 edges, 11 markings/sec, 100 secs
lola: 2262 markings, 2261 edges, 11 markings/sec, 105 secs
lola: 2302 markings, 2301 edges, 8 markings/sec, 110 secs
lola: 2344 markings, 2343 edges, 8 markings/sec, 115 secs
lola: 2382 markings, 2381 edges, 8 markings/sec, 120 secs
lola: 2413 markings, 2412 edges, 6 markings/sec, 125 secs
lola: 2451 markings, 2450 edges, 8 markings/sec, 130 secs
lola: 2551 markings, 2550 edges, 20 markings/sec, 135 secs
lola: 2580 markings, 2579 edges, 6 markings/sec, 140 secs
lola: 2605 markings, 2604 edges, 5 markings/sec, 145 secs
lola: 2635 markings, 2634 edges, 6 markings/sec, 150 secs
lola: 2681 markings, 2680 edges, 9 markings/sec, 155 secs
lola: 2731 markings, 2730 edges, 10 markings/sec, 160 secs
lola: 2767 markings, 2766 edges, 7 markings/sec, 165 secs
lola: 2807 markings, 2806 edges, 8 markings/sec, 170 secs
lola: 2841 markings, 2840 edges, 7 markings/sec, 175 secs
lola: 2873 markings, 2872 edges, 6 markings/sec, 180 secs
lola: 2902 markings, 2901 edges, 6 markings/sec, 185 secs
lola: 2986 markings, 2985 edges, 17 markings/sec, 190 secs
lola: 3020 markings, 3019 edges, 7 markings/sec, 195 secs
lola: 3060 markings, 3059 edges, 8 markings/sec, 200 secs
lola: 3105 markings, 3104 edges, 9 markings/sec, 205 secs
lola: 3146 markings, 3145 edges, 8 markings/sec, 210 secs
lola: 3179 markings, 3178 edges, 7 markings/sec, 215 secs
lola: 3212 markings, 3211 edges, 7 markings/sec, 220 secs
lola: 3251 markings, 3250 edges, 8 markings/sec, 225 secs
lola: 3306 markings, 3305 edges, 11 markings/sec, 230 secs
lola: 3340 markings, 3339 edges, 7 markings/sec, 235 secs
lola: 3386 markings, 3385 edges, 9 markings/sec, 240 secs
lola: 3442 markings, 3441 edges, 11 markings/sec, 245 secs
lola: 3517 markings, 3516 edges, 15 markings/sec, 250 secs
lola: 3585 markings, 3584 edges, 14 markings/sec, 255 secs
lola: 3624 markings, 3623 edges, 8 markings/sec, 260 secs
lola: 3667 markings, 3666 edges, 9 markings/sec, 265 secs
lola: 3704 markings, 3703 edges, 7 markings/sec, 270 secs
lola: 3751 markings, 3750 edges, 9 markings/sec, 275 secs
lola: 3821 markings, 3820 edges, 14 markings/sec, 280 secs
lola: 3886 markings, 3885 edges, 13 markings/sec, 285 secs
lola: 3923 markings, 3922 edges, 7 markings/sec, 290 secs
lola: 3960 markings, 3959 edges, 7 markings/sec, 295 secs
lola: 3995 markings, 3994 edges, 7 markings/sec, 300 secs
lola: 4042 markings, 4041 edges, 9 markings/sec, 305 secs
lola: 4087 markings, 4086 edges, 9 markings/sec, 310 secs
lola: 4139 markings, 4138 edges, 10 markings/sec, 315 secs
lola: 4193 markings, 4192 edges, 11 markings/sec, 320 secs
lola: 4247 markings, 4246 edges, 11 markings/sec, 325 secs
lola: 4302 markings, 4301 edges, 11 markings/sec, 330 secs
lola: 4367 markings, 4366 edges, 13 markings/sec, 335 secs
lola: 4423 markings, 4422 edges, 11 markings/sec, 340 secs
lola: 4524 markings, 4523 edges, 20 markings/sec, 345 secs
lola: 4654 markings, 4653 edges, 26 markings/sec, 350 secs
lola: 4769 markings, 4768 edges, 23 markings/sec, 355 secs
lola: 4894 markings, 4893 edges, 25 markings/sec, 360 secs
lola: 4977 markings, 4976 edges, 17 markings/sec, 365 secs
lola: 5056 markings, 5055 edges, 16 markings/sec, 370 secs
lola: 5126 markings, 5125 edges, 14 markings/sec, 375 secs
lola: 5199 markings, 5198 edges, 15 markings/sec, 380 secs
lola: 5286 markings, 5285 edges, 17 markings/sec, 385 secs
lola: 5424 markings, 5423 edges, 28 markings/sec, 390 secs
lola: 5524 markings, 5523 edges, 20 markings/sec, 395 secs
lola: 5575 markings, 5574 edges, 10 markings/sec, 400 secs
lola: 5632 markings, 5631 edges, 11 markings/sec, 405 secs
lola: 5667 markings, 5666 edges, 7 markings/sec, 410 secs
lola: 5703 markings, 5702 edges, 7 markings/sec, 415 secs
lola: 5738 markings, 5737 edges, 7 markings/sec, 420 secs
lola: 5774 markings, 5773 edges, 7 markings/sec, 425 secs
lola: 5810 markings, 5809 edges, 7 markings/sec, 430 secs
lola: 5844 markings, 5843 edges, 7 markings/sec, 435 secs
lola: 5933 markings, 5932 edges, 18 markings/sec, 440 secs
lola: 6030 markings, 6029 edges, 19 markings/sec, 445 secs
lola: 6126 markings, 6125 edges, 19 markings/sec, 450 secs
lola: 6278 markings, 6277 edges, 30 markings/sec, 455 secs
lola: 6435 markings, 6434 edges, 31 markings/sec, 460 secs
lola: 6521 markings, 6520 edges, 17 markings/sec, 465 secs
lola: 6641 markings, 6640 edges, 24 markings/sec, 470 secs
lola: 6907 markings, 6906 edges, 53 markings/sec, 475 secs
lola: 6988 markings, 6987 edges, 16 markings/sec, 480 secs
lola: 7069 markings, 7068 edges, 16 markings/sec, 485 secs
lola: 7152 markings, 7151 edges, 17 markings/sec, 490 secs
lola: 7248 markings, 7247 edges, 19 markings/sec, 495 secs
lola: 7372 markings, 7371 edges, 25 markings/sec, 500 secs
lola: 7512 markings, 7511 edges, 28 markings/sec, 505 secs
lola: 7663 markings, 7662 edges, 30 markings/sec, 510 secs
lola: 7815 markings, 7814 edges, 30 markings/sec, 515 secs
lola: 7969 markings, 7968 edges, 31 markings/sec, 520 secs
lola: 8123 markings, 8122 edges, 31 markings/sec, 525 secs
lola: 8279 markings, 8278 edges, 31 markings/sec, 530 secs
lola: 8430 markings, 8429 edges, 30 markings/sec, 535 secs
lola: 8573 markings, 8572 edges, 29 markings/sec, 540 secs
lola: 8722 markings, 8721 edges, 30 markings/sec, 545 secs
lola: 8877 markings, 8876 edges, 31 markings/sec, 550 secs
lola: 9037 markings, 9036 edges, 32 markings/sec, 555 secs
lola: 9187 markings, 9186 edges, 30 markings/sec, 560 secs
lola: 9340 markings, 9339 edges, 31 markings/sec, 565 secs
lola: 9492 markings, 9491 edges, 30 markings/sec, 570 secs
lola: 9627 markings, 9626 edges, 27 markings/sec, 575 secs
lola: 9784 markings, 9783 edges, 31 markings/sec, 580 secs
lola: 9938 markings, 9937 edges, 31 markings/sec, 585 secs
lola: 10092 markings, 10091 edges, 31 markings/sec, 590 secs
lola: 10246 markings, 10245 edges, 31 markings/sec, 595 secs
lola: 10399 markings, 10398 edges, 31 markings/sec, 600 secs
lola: 10572 markings, 10571 edges, 35 markings/sec, 605 secs
lola: 10734 markings, 10733 edges, 32 markings/sec, 610 secs
lola: 10881 markings, 10880 edges, 29 markings/sec, 615 secs
lola: 11065 markings, 11064 edges, 37 markings/sec, 620 secs
lola: 11280 markings, 11279 edges, 43 markings/sec, 625 secs
lola: 11556 markings, 11555 edges, 55 markings/sec, 630 secs
lola: 11732 markings, 11731 edges, 35 markings/sec, 635 secs
lola: 11950 markings, 11949 edges, 44 markings/sec, 640 secs
lola: 12246 markings, 12245 edges, 59 markings/sec, 645 secs
lola: 12541 markings, 12540 edges, 59 markings/sec, 650 secs
lola: 12850 markings, 12849 edges, 62 markings/sec, 655 secs
lola: 13153 markings, 13152 edges, 61 markings/sec, 660 secs
lola: 13379 markings, 13378 edges, 45 markings/sec, 665 secs
lola: 13605 markings, 13604 edges, 45 markings/sec, 670 secs
lola: 13833 markings, 13832 edges, 46 markings/sec, 675 secs
lola: 14130 markings, 14129 edges, 59 markings/sec, 680 secs
lola: 14633 markings, 14632 edges, 101 markings/sec, 685 secs
lola: 15169 markings, 15168 edges, 107 markings/sec, 690 secs
lola: 15701 markings, 15700 edges, 106 markings/sec, 695 secs
lola: 16228 markings, 16227 edges, 105 markings/sec, 700 secs
lola: 16758 markings, 16757 edges, 106 markings/sec, 705 secs
lola: 17301 markings, 17300 edges, 109 markings/sec, 710 secs
lola: 17887 markings, 17886 edges, 117 markings/sec, 715 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 18897 markings, 18897 edges
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p_3_0_2_0_1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((p_3_0_2_0_1 <= 2)))))
lola: processed formula length: 42
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 2851 markings, 2850 edges, 570 markings/sec, 0 secs
lola: 6880 markings, 6879 edges, 806 markings/sec, 5 secs
lola: 14157 markings, 14259 edges, 1455 markings/sec, 10 secs
lola: 23073 markings, 23451 edges, 1783 markings/sec, 15 secs
lola: 32117 markings, 32796 edges, 1809 markings/sec, 20 secs
lola: 42881 markings, 44140 edges, 2153 markings/sec, 25 secs
lola: 55780 markings, 57599 edges, 2580 markings/sec, 30 secs
lola: 68783 markings, 71168 edges, 2601 markings/sec, 35 secs
lola: 82089 markings, 85052 edges, 2661 markings/sec, 40 secs
lola: 96985 markings, 102156 edges, 2979 markings/sec, 45 secs
lola: 112488 markings, 120927 edges, 3101 markings/sec, 50 secs
lola: 127676 markings, 139337 edges, 3038 markings/sec, 55 secs
lola: 143408 markings, 158409 edges, 3146 markings/sec, 60 secs
lola: 159317 markings, 177704 edges, 3182 markings/sec, 65 secs
lola: 175194 markings, 196932 edges, 3175 markings/sec, 70 secs
lola: 190943 markings, 215997 edges, 3150 markings/sec, 75 secs
lola: 206593 markings, 234961 edges, 3130 markings/sec, 80 secs
lola: 221936 markings, 253551 edges, 3069 markings/sec, 85 secs
lola: 237319 markings, 272188 edges, 3077 markings/sec, 90 secs
lola: 252465 markings, 290548 edges, 3029 markings/sec, 95 secs
lola: 268053 markings, 309454 edges, 3118 markings/sec, 100 secs
lola: 283357 markings, 327998 edges, 3061 markings/sec, 105 secs
lola: 298625 markings, 346499 edges, 3054 markings/sec, 110 secs
lola: 314389 markings, 365608 edges, 3153 markings/sec, 115 secs
lola: 330196 markings, 384752 edges, 3161 markings/sec, 120 secs
lola: 346023 markings, 403933 edges, 3165 markings/sec, 125 secs
lola: 361536 markings, 422707 edges, 3103 markings/sec, 130 secs
lola: 377186 markings, 441671 edges, 3130 markings/sec, 135 secs
lola: 392964 markings, 460806 edges, 3156 markings/sec, 140 secs
lola: 408472 markings, 479613 edges, 3102 markings/sec, 145 secs
lola: 424192 markings, 498660 edges, 3144 markings/sec, 150 secs
lola: 439952 markings, 517736 edges, 3152 markings/sec, 155 secs
lola: 455259 markings, 536290 edges, 3061 markings/sec, 160 secs
lola: 471013 markings, 555360 edges, 3151 markings/sec, 165 secs
lola: 486757 markings, 574429 edges, 3149 markings/sec, 170 secs
lola: 502466 markings, 593493 edges, 3142 markings/sec, 175 secs
lola: 518041 markings, 612380 edges, 3115 markings/sec, 180 secs
lola: 533790 markings, 631463 edges, 3150 markings/sec, 185 secs
lola: 549536 markings, 650531 edges, 3149 markings/sec, 190 secs
lola: 565296 markings, 669617 edges, 3152 markings/sec, 195 secs
lola: 580927 markings, 688541 edges, 3126 markings/sec, 200 secs
lola: 596373 markings, 707259 edges, 3089 markings/sec, 205 secs
lola: 612120 markings, 726381 edges, 3149 markings/sec, 210 secs
lola: 627340 markings, 744821 edges, 3044 markings/sec, 215 secs
lola: 642585 markings, 763286 edges, 3049 markings/sec, 220 secs
lola: 657440 markings, 781245 edges, 2971 markings/sec, 225 secs
lola: 672777 markings, 799842 edges, 3067 markings/sec, 230 secs
lola: 687955 markings, 818227 edges, 3036 markings/sec, 235 secs
lola: 702755 markings, 836172 edges, 2960 markings/sec, 240 secs
lola: 717715 markings, 854315 edges, 2992 markings/sec, 245 secs
lola: 732784 markings, 872572 edges, 3014 markings/sec, 250 secs
lola: 747796 markings, 890764 edges, 3002 markings/sec, 255 secs
lola: 762777 markings, 908932 edges, 2996 markings/sec, 260 secs
lola: 777746 markings, 927063 edges, 2994 markings/sec, 265 secs
lola: 792784 markings, 945278 edges, 3008 markings/sec, 270 secs
lola: 807829 markings, 963504 edges, 3009 markings/sec, 275 secs
lola: 822888 markings, 981727 edges, 3012 markings/sec, 280 secs
lola: 837750 markings, 999758 edges, 2972 markings/sec, 285 secs
lola: 852768 markings, 1017947 edges, 3004 markings/sec, 290 secs
lola: 867787 markings, 1036156 edges, 3004 markings/sec, 295 secs
lola: 882751 markings, 1054289 edges, 2993 markings/sec, 300 secs
lola: 897779 markings, 1072505 edges, 3006 markings/sec, 305 secs
lola: 912740 markings, 1090624 edges, 2992 markings/sec, 310 secs
lola: 927767 markings, 1108849 edges, 3005 markings/sec, 315 secs
lola: 942816 markings, 1127061 edges, 3010 markings/sec, 320 secs
lola: 957822 markings, 1145228 edges, 3001 markings/sec, 325 secs
lola: 972865 markings, 1163464 edges, 3009 markings/sec, 330 secs
lola: 987668 markings, 1181408 edges, 2961 markings/sec, 335 secs
lola: 1002475 markings, 1199366 edges, 2961 markings/sec, 340 secs
lola: 1017523 markings, 1217605 edges, 3010 markings/sec, 345 secs
lola: 1032464 markings, 1235691 edges, 2988 markings/sec, 350 secs
lola: 1047608 markings, 1254059 edges, 3029 markings/sec, 355 secs
lola: 1062777 markings, 1272441 edges, 3034 markings/sec, 360 secs
lola: 1077882 markings, 1290730 edges, 3021 markings/sec, 365 secs
lola: 1093030 markings, 1309076 edges, 3030 markings/sec, 370 secs
lola: 1108224 markings, 1327492 edges, 3039 markings/sec, 375 secs
lola: 1123418 markings, 1345886 edges, 3039 markings/sec, 380 secs
lola: 1138538 markings, 1364195 edges, 3024 markings/sec, 385 secs
lola: 1153611 markings, 1382471 edges, 3015 markings/sec, 390 secs
lola: 1168805 markings, 1400894 edges, 3039 markings/sec, 395 secs
lola: 1184119 markings, 1419442 edges, 3063 markings/sec, 400 secs
lola: 1199567 markings, 1438156 edges, 3090 markings/sec, 405 secs
lola: 1214403 markings, 1456125 edges, 2967 markings/sec, 410 secs
lola: 1221714 markings, 1465012 edges, 1462 markings/sec, 415 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (F (((p_0_1_1_2_1 + 1 <= p_3_2_2_0_3) AND (p_1_0_1_2_2 <= 1) AND (((p_3_0_1_0_1 <= p_1_1_1_2_3) AND (3 <= p_3_3_0_1_3)) OR (p_1_0_3_3_1 <= 1)))))
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_3_2_2_0_3 <= p_0_1_1_2_1) OR (2 <= p_1_0_1_2_2) OR (((p_1_1_1_2_3 + 1 <= p_3_0_1_0_1) OR (p_3_3_0_1_3 <= 2)) AND (2 <= p_1_0_3_3_1)))
lola: processed formula length: 140
lola: 11 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 722 markings, 721 edges, 144 markings/sec, 0 secs
lola: 1026 markings, 1025 edges, 61 markings/sec, 5 secs
lola: 1203 markings, 1202 edges, 35 markings/sec, 10 secs
lola: 1231 markings, 1230 edges, 6 markings/sec, 15 secs
lola: 1253 markings, 1252 edges, 4 markings/sec, 20 secs
lola: 1278 markings, 1277 edges, 5 markings/sec, 25 secs
lola: 1308 markings, 1307 edges, 6 markings/sec, 30 secs
lola: 1337 markings, 1336 edges, 6 markings/sec, 35 secs
lola: 1371 markings, 1370 edges, 7 markings/sec, 40 secs
lola: 1410 markings, 1409 edges, 8 markings/sec, 45 secs
lola: 1437 markings, 1436 edges, 5 markings/sec, 50 secs
lola: 1470 markings, 1469 edges, 7 markings/sec, 55 secs
lola: 1501 markings, 1500 edges, 6 markings/sec, 60 secs
lola: 1515 markings, 1514 edges, 3 markings/sec, 65 secs
lola: 1566 markings, 1565 edges, 10 markings/sec, 70 secs
lola: 1601 markings, 1600 edges, 7 markings/sec, 75 secs
lola: 1626 markings, 1625 edges, 5 markings/sec, 80 secs
lola: 1665 markings, 1664 edges, 8 markings/sec, 85 secs
lola: 1702 markings, 1701 edges, 7 markings/sec, 90 secs
lola: 1725 markings, 1724 edges, 5 markings/sec, 95 secs
lola: 1748 markings, 1747 edges, 5 markings/sec, 100 secs
lola: 1773 markings, 1772 edges, 5 markings/sec, 105 secs
lola: 1814 markings, 1813 edges, 8 markings/sec, 110 secs
lola: 1839 markings, 1838 edges, 5 markings/sec, 115 secs
lola: 1881 markings, 1880 edges, 8 markings/sec, 120 secs
lola: 1926 markings, 1925 edges, 9 markings/sec, 125 secs
lola: 1963 markings, 1962 edges, 7 markings/sec, 130 secs
lola: 1997 markings, 1996 edges, 7 markings/sec, 135 secs
lola: 2024 markings, 2023 edges, 5 markings/sec, 140 secs
lola: 2062 markings, 2061 edges, 8 markings/sec, 145 secs
lola: 2103 markings, 2102 edges, 8 markings/sec, 150 secs
lola: time limit reached - aborting
lola:
preliminary result: unknown yes yes no no no unknown yes no unknown no yes unknown no no yes
lola:
preliminary result: unknown yes yes no no no unknown yes no unknown no yes unknown no no yes
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown yes yes no no no unknown yes no unknown no yes unknown no no yes
lola: memory consumption: 464492 KB
lola: time consumption: 3568 seconds
lola: memory consumption: 464492 KB
lola: time consumption: 3568 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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-d5n4m1t35"
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-d5n4m1t35.tgz
mv NeighborGrid-PT-d5n4m1t35 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-d5n4m1t35, 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-152666469200234"
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 ;