Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r238-oct2-159033569000085.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is Sudoku-PT-AN04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r238-oct2-159033569000085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 3.2K May 14 03:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 03:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K May 13 21:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 127K May 13 21:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K May 13 10:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K May 13 10:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.3K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 38K May 12 20:42 model.pnml

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

=== Now, execution of the tool begins

BK_START 1590588633634

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Sudoku-PT-AN04 @ 3570 seconds

FORMULA Sudoku-PT-AN04-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN04-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2305
rslt: Output for LTLCardinality @ Sudoku-PT-AN04

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 27 14:10:33 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 123
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 416,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 112,
"visible_transitions": 0
},
"processed": "A ((((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 + 1 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3) OR (Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3 + 1 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3)) OR (((2 <= Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3) OR (Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3)) OR (F ((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3)) OR X ((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3))))))",
"processed_size": 5656,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 160,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "A (((Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3 + 1 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3) OR X (G ((Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3 + 1 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3)))))",
"processed_size": 2266,
"rewrites": 123
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 96,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "A (X (X (F ((X ((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= 1)) OR F (G (((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= 1) AND (2 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3)))))))))",
"processed_size": 1301,
"rewrites": 123
},
"result":
{
"edges": 153,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X (((Rows_0_1 + 1 <= Cells_1_0) AND F ((Rows_0_1 + 1 <= Cells_1_0))))))",
"processed_size": 77,
"rewrites": 123
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 466
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((X (((Columns_0_3 <= Board_0_2_2) U (1 <= Cells_0_0))) OR F ((Rows_1_1 <= Board_2_2_3)))))",
"processed_size": 96,
"rewrites": 123
},
"result":
{
"edges": 53,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 544
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((1 <= Columns_1_0) OR (Cells_0_1 <= Columns_0_3))))",
"processed_size": 59,
"rewrites": 125
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 653
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((Cells_0_0 + 1 <= Columns_3_3))))",
"processed_size": 42,
"rewrites": 123
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 816
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((Cells_0_2 <= Rows_2_0))))",
"processed_size": 35,
"rewrites": 123
},
"result":
{
"edges": 105,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1089
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "A (F (G (((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= 2) AND (Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3 <= 1)))))",
"processed_size": 1099,
"rewrites": 123
},
"result":
{
"edges": 19,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1633
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1633
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((Rows_2_3 <= Cells_2_0) AND (Rows_1_2 + 1 <= Cells_3_2)) OR (Rows_2_3 <= Cells_2_0))))",
"processed_size": 94,
"rewrites": 128
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3267
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3267
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 64,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 64,
"visible_transitions": 0
},
"processed": "(2 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3)",
"processed_size": 900,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22748,
"runtime": 1241.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(TRUE)) : A((* OR X(G(*)))) : A(X(X(F((X(**) OR F(G(**))))))) : A(F(G((** AND X(F(**)))))) : A(F(G(*))) : TRUE : A((* OR (** OR (F(**) OR X(**))))) : (** AND A(F(**))) : TRUE : A(G(**)) : A(F(G(**))) : FALSE : (A(X(X((* AND F(*))))) AND A(X((F((* AND F(*))) OR X(G((* AND F(*)))))))) : A(G(F(**))) : (A(F(G(**))) AND (A(G(F(**))) AND A(G((** OR **))))) : A(G((X((** U **)) OR F(**))))"
},
"net":
{
"arcs": 256,
"conflict_clusters": 65,
"places": 112,
"places_significant": 64,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "yes no no unknown no yes yes no yes no no no no no no no ",
"value": "yes no no unknown no yes yes no yes no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 176/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3584
lola: finding significant places
lola: 112 places, 64 transitions, 64 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: place invariant simplifies atomic proposition
lola: before: (Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3 <= Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3 <= Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3 <= Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3 <= Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3 <= Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3)
lola: after: (0 <= 0)
lola: LP says that atomic proposition is always false: (2 <= Cells_0_1)
lola: LP says that atomic proposition is always false: (2 <= Columns_2_3)
lola: LP says that atomic proposition is always false: (2 <= Board_2_3_0)
lola: LP says that atomic proposition is always false: (3 <= Cells_0_3)
lola: A (X (G (()))) : A (NOT(((Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3 <= Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3) AND X (F ((F (((Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3 <= Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3))) U ((Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3 <= Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3) AND X ((0 <= 0))))))))) : A (F (X (X ((X ((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= 1)) OR F (G (((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= 1) AND (2 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3))))))))) : A (F (X (F (G ((((Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3) AND F ((0 <= Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3))) AND (G ((0 <= Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3)) U X (F ((1 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3)))))))))) : A (NOT(G ((X (F ((0 <= 0))) AND G (F (((3 <= Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0) OR (2 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3)))))))) : A (((0 <= 0) OR (G (X ((3 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3))) AND X ((F ((3 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3)) U X ((0 <= 0))))))) : A (NOT((((Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3 <= Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0) AND (Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3 <= Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3)) AND NOT(((((2 <= Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3) OR (Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3)) OR F ((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3))) OR X ((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3))))))) : A (((2 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3) AND F ((F ((0 <= 0)) AND ((Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3 <= Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0) U F ((Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Board_3_2_3 + Board_3_2_2 + Board_3_2_1 + Board_3_2_0 + Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Board_2_3_3 + Board_2_3_2 + Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Board_2_3_1 + Board_2_3_0 + Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3 <= Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0))))))) : A (G (F (G (F (NOT((F ((2 <= Cells_0_1)) U (2 <= Columns_2_3)))))))) : A (((X ((Rows_2_3 <= Cells_3_0)) U G (((2 <= Board_2_3_0) AND X ((1 <= Columns_1_0))))) U G (((1 <= Columns_1_0) OR (Cells_0_1 <= Columns_0_3))))) : A (G (F (G ((Cells_0_2 <= Rows_2_0))))) : A ((G (X (X ((Cells_3_2 + 1 <= 0)))) OR F (NOT(X (()))))) : A (NOT(X ((G (((Cells_1_0 <= Rows_0_1) OR G ((Rows_2_1 <= Columns_0_0)))) U (X ((Cells_1_0 <= Rows_0_1)) OR X (G ((Cells_1_0 <= Rows_0_1)))))))) : A (G (F ((Cells_0_0 + 1 <= Columns_3_3)))) : A (G ((F (G ((Rows_2_3 <= Cells_2_0))) AND (((Rows_2_3 <= Cells_2_0) AND (Rows_1_2 + 1 <= Cells_3_2)) U (Rows_2_3 <= Cells_2_0))))) : A (G ((X (((Columns_0_3 <= Board_0_2_2) U (1 <= Cells_0_0))) OR F ((Rows_1_1 <= Board_2_2_3)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + ... (shortened)
lola: processed formula length: 2015
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 990149 markings, 7691485 edges, 198030 markings/sec, 0 secs
lola: 1761133 markings, 15269036 edges, 154197 markings/sec, 5 secs
lola: 2681339 markings, 23120632 edges, 184041 markings/sec, 10 secs
lola: 3464646 markings, 30967210 edges, 156661 markings/sec, 15 secs
lola: 4210442 markings, 38785417 edges, 149159 markings/sec, 20 secs
lola: 4986293 markings, 46453314 edges, 155170 markings/sec, 25 secs
lola: 5622506 markings, 54507786 edges, 127243 markings/sec, 30 secs
lola: 6215371 markings, 62260044 edges, 118573 markings/sec, 35 secs
lola: 6708791 markings, 69756560 edges, 98684 markings/sec, 40 secs
lola: 7373800 markings, 77115092 edges, 133002 markings/sec, 45 secs
lola: 8182634 markings, 84398616 edges, 161767 markings/sec, 50 secs
lola: 9003442 markings, 91934761 edges, 164162 markings/sec, 55 secs
lola: 9798989 markings, 99247867 edges, 159109 markings/sec, 60 secs
lola: 10575180 markings, 106747225 edges, 155238 markings/sec, 65 secs
lola: 11330048 markings, 114299094 edges, 150974 markings/sec, 70 secs
lola: 11992616 markings, 121762552 edges, 132514 markings/sec, 75 secs
lola: 12602208 markings, 129309128 edges, 121918 markings/sec, 80 secs
lola: 13141615 markings, 136735345 edges, 107881 markings/sec, 85 secs
lola: 13620754 markings, 144260189 edges, 95828 markings/sec, 90 secs
lola: 14346989 markings, 151643502 edges, 145247 markings/sec, 95 secs
lola: 15135408 markings, 158915189 edges, 157684 markings/sec, 100 secs
lola: 15975647 markings, 166388353 edges, 168048 markings/sec, 105 secs
lola: 16737720 markings, 173773949 edges, 152415 markings/sec, 110 secs
lola: 17526164 markings, 181085287 edges, 157689 markings/sec, 115 secs
lola: 18256313 markings, 188452090 edges, 146030 markings/sec, 120 secs
lola: 18910402 markings, 195855424 edges, 130818 markings/sec, 125 secs
lola: 19507262 markings, 203273350 edges, 119372 markings/sec, 130 secs
lola: 20037230 markings, 210620817 edges, 105994 markings/sec, 135 secs
lola: 20503222 markings, 218074425 edges, 93198 markings/sec, 140 secs
lola: 21188889 markings, 225582283 edges, 137133 markings/sec, 145 secs
lola: 21925058 markings, 233097699 edges, 147234 markings/sec, 150 secs
lola: 22614825 markings, 240497092 edges, 137953 markings/sec, 155 secs
lola: 23219734 markings, 248033258 edges, 120982 markings/sec, 160 secs
lola: 23771740 markings, 255395857 edges, 110401 markings/sec, 165 secs
lola: 24272686 markings, 262916787 edges, 100189 markings/sec, 170 secs
lola: 24903515 markings, 270425214 edges, 126166 markings/sec, 175 secs
lola: 25645865 markings, 278084112 edges, 148470 markings/sec, 180 secs
lola: 26378935 markings, 285767378 edges, 146614 markings/sec, 185 secs
lola: 26996609 markings, 293391589 edges, 123535 markings/sec, 190 secs
lola: 27563470 markings, 300839082 edges, 113372 markings/sec, 195 secs
lola: 28066889 markings, 308332784 edges, 100684 markings/sec, 200 secs
lola: 28666407 markings, 315815261 edges, 119904 markings/sec, 205 secs
lola: 29371639 markings, 323348982 edges, 141046 markings/sec, 210 secs
lola: 30159477 markings, 330898650 edges, 157568 markings/sec, 215 secs
lola: 30748863 markings, 338381477 edges, 117877 markings/sec, 220 secs
lola: 31299500 markings, 345696267 edges, 110127 markings/sec, 225 secs
lola: 31762647 markings, 352130713 edges, 92629 markings/sec, 230 secs
lola: 32173483 markings, 359476661 edges, 82167 markings/sec, 235 secs
lola: 32748043 markings, 366757572 edges, 114912 markings/sec, 240 secs
lola: 33275549 markings, 373877164 edges, 105501 markings/sec, 245 secs
lola: 33721970 markings, 380451209 edges, 89284 markings/sec, 250 secs
lola: 33895841 markings, 384053011 edges, 34774 markings/sec, 255 secs
lola: 34193176 markings, 388097428 edges, 59467 markings/sec, 260 secs
lola: 34505629 markings, 391836690 edges, 62491 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown yes unknown unknown yes unknown unknown no unknown unknown unknown unknown
lola: memory consumption: 5035200 KB
lola: time consumption: 279 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown yes unknown unknown yes unknown unknown no unknown unknown unknown unknown
lola: memory consumption: 5048896 KB
lola: time consumption: 280 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 + 1 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Boa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 + 1 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Boa... (shortened)
lola: processed formula length: 5656
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3 + 1 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Columns_2_2 + Columns_2_1 + Columns_2_0 + Columns_1_2 + Columns_1_1 + Columns_1_0 + Columns_0_2 + Columns_0_1 + Columns_0_0 + Columns_0_3 + Columns_1_3 + Columns_2_3 + Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3 + 1 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 ... (shortened)
lola: processed formula length: 2266
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((X ((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= 1)) OR F (G (((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= 1) AND (2 <= B... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((X ((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= 1)) OR F (G (((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= 1) AND (2 <= B... (shortened)
lola: processed formula length: 1301
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 153 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (X (((Rows_0_1 + 1 <= Cells_1_0) AND F ((Rows_0_1 + 1 <= Cells_1_0)))))) AND A (X ((F (((Rows_0_1 + 1 <= Cells_1_0) AND F ((Columns_0_0 + 1 <= Rows_2_1)))) OR X (G (((Rows_0_1 + 1 <= Cells_1_0) AND F ((Rows_0_1 + 1 <= Cells_1_0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((Rows_0_1 + 1 <= Cells_1_0) AND F ((Rows_0_1 + 1 <= Cells_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((Rows_0_1 + 1 <= Cells_1_0) AND F ((Rows_0_1 + 1 <= Cells_1_0))))))
lola: processed formula length: 77
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((X (((Columns_0_3 <= Board_0_2_2) U (1 <= Cells_0_0))) OR F ((Rows_1_1 <= Board_2_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (((Columns_0_3 <= Board_0_2_2) U (1 <= Cells_0_0))) OR F ((Rows_1_1 <= Board_2_2_3)))))
lola: processed formula length: 96
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 53 edges
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Columns_1_0) OR (Cells_0_1 <= Columns_0_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= Columns_1_0) OR (Cells_0_1 <= Columns_0_3))))
lola: processed formula length: 59
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Columns_1_0 <= 0) AND (Columns_0_3 + 1 <= Cells_0_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Cells_0_0 + 1 <= Columns_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Cells_0_0 + 1 <= Columns_3_3))))
lola: processed formula length: 42
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Cells_0_2 <= Rows_2_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Cells_0_2 <= Rows_2_0))))
lola: processed formula length: 35
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 105 edges
lola: ========================================
lola: subprocess 13 will run for 1089 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= 2) AND (Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_1_3 + Rows_1_2 + Rows_1_1 + Rows_1_0 <= 2) AND (Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_... (shortened)
lola: processed formula length: 1099
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 19 edges
lola: ========================================
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((Rows_2_3 <= Cells_2_0)))) AND (A (G (F ((Rows_2_3 <= Cells_2_0)))) AND A (G ((((Rows_2_3 <= Cells_2_0) AND (Rows_1_2 + 1 <= Cells_3_2)) OR (Rows_2_3 <= Cells_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((Rows_2_3 <= Cells_2_0) AND (Rows_1_2 + 1 <= Cells_3_2)) OR (Rows_2_3 <= Cells_2_0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: A (G ((((Rows_2_3 <= Cells_2_0) AND (Rows_1_2 + 1 <= Cells_3_2)) OR (Rows_2_3 <= Cells_2_0))))
lola: processed formula length: 94
lola: 128 rewrites
lola: closed formula file LTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((Cells_2_0 + 1 <= Rows_2_3) OR (Cells_3_2 <= Rows_1_2)) AND (Cells_2_0 + 1 <= Rows_2_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
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: ========================================
lola: subprocess 15 will run for 3267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + B... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Bo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Bo... (shortened)
lola: processed formula length: 900
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G (((Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((Cells_0_0 + Cells_0_1 + Cells_0_2 + Cells_2_0 + Cells_2_1 + Cells_2_2 + Cells_2_3 + Cells_1_3 + Cells_1_2 + Cells_1_1 + Cells_1_0 + Cells_0_3 + Cells_3_0 + Cells_3_1 + Cells_3_2 + Cells_3_3 <= Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Board_1_3_0 + Board_1_3_1 + ... (shortened)
lola: processed formula length: 2015
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 986216 markings, 7655585 edges, 197243 markings/sec, 0 secs
lola: 1795636 markings, 15483513 edges, 161884 markings/sec, 5 secs
lola: 2424374 markings, 20837217 edges, 125748 markings/sec, 10 secs
lola: 3051622 markings, 27634461 edges, 125450 markings/sec, 15 secs
lola: 3919388 markings, 35569502 edges, 173553 markings/sec, 20 secs
lola: 4724116 markings, 43281165 edges, 160946 markings/sec, 25 secs
lola: 5344476 markings, 51108356 edges, 124072 markings/sec, 30 secs
lola: 5961038 markings, 58820337 edges, 123312 markings/sec, 35 secs
lola: 6500978 markings, 66611179 edges, 107988 markings/sec, 40 secs
lola: 7000501 markings, 74337298 edges, 99905 markings/sec, 45 secs
lola: 7941695 markings, 82033292 edges, 188239 markings/sec, 50 secs
lola: 8741511 markings, 89610840 edges, 159963 markings/sec, 55 secs
lola: 9594681 markings, 97160042 edges, 170634 markings/sec, 60 secs
lola: 10370296 markings, 104790653 edges, 155123 markings/sec, 65 secs
lola: 11094877 markings, 112419916 edges, 144916 markings/sec, 70 secs
lola: 11848132 markings, 119872993 edges, 150651 markings/sec, 75 secs
lola: 12455701 markings, 127419898 edges, 121514 markings/sec, 80 secs
lola: 13009836 markings, 134856471 edges, 110827 markings/sec, 85 secs
lola: 13512353 markings, 142392399 edges, 100503 markings/sec, 90 secs
lola: 14160404 markings, 149890513 edges, 129610 markings/sec, 95 secs
lola: 14996150 markings, 157350402 edges, 167149 markings/sec, 100 secs
lola: 15821110 markings, 165107215 edges, 164992 markings/sec, 105 secs
lola: 16667330 markings, 172791332 edges, 169244 markings/sec, 110 secs
lola: 17477764 markings, 180674944 edges, 162087 markings/sec, 115 secs
lola: 18263728 markings, 188523798 edges, 157193 markings/sec, 120 secs
lola: 18941990 markings, 196222875 edges, 135652 markings/sec, 125 secs
lola: 19530103 markings, 203569906 edges, 117623 markings/sec, 130 secs
lola: 20054434 markings, 210803239 edges, 104866 markings/sec, 135 secs
lola: 20503861 markings, 218084878 edges, 89885 markings/sec, 140 secs
lola: 21166601 markings, 225407339 edges, 132548 markings/sec, 145 secs
lola: 21904822 markings, 232958481 edges, 147644 markings/sec, 150 secs
lola: 22595558 markings, 240273433 edges, 138147 markings/sec, 155 secs
lola: 23185079 markings, 247689461 edges, 117904 markings/sec, 160 secs
lola: 23752972 markings, 255058514 edges, 113579 markings/sec, 165 secs
lola: 24255908 markings, 262565786 edges, 100587 markings/sec, 170 secs
lola: 24858831 markings, 270015047 edges, 120585 markings/sec, 175 secs
lola: 25578534 markings, 277638947 edges, 143941 markings/sec, 180 secs
lola: 26358400 markings, 285307840 edges, 155973 markings/sec, 185 secs
lola: 26975168 markings, 292975259 edges, 123354 markings/sec, 190 secs
lola: 27536392 markings, 300475753 edges, 112245 markings/sec, 195 secs
lola: 28039421 markings, 307952474 edges, 100606 markings/sec, 200 secs
lola: 28607578 markings, 315412655 edges, 113631 markings/sec, 205 secs
lola: 29326454 markings, 322872685 edges, 143775 markings/sec, 210 secs
lola: 30127528 markings, 330398483 edges, 160215 markings/sec, 215 secs
lola: 30723702 markings, 338029438 edges, 119235 markings/sec, 220 secs
lola: 31279925 markings, 345455172 edges, 111245 markings/sec, 225 secs
lola: 31804997 markings, 352890695 edges, 105014 markings/sec, 230 secs
lola: 32256470 markings, 360351104 edges, 90295 markings/sec, 235 secs
lola: 32841011 markings, 367721534 edges, 116908 markings/sec, 240 secs
lola: 33368581 markings, 375009745 edges, 105514 markings/sec, 245 secs
lola: 33823311 markings, 382300753 edges, 90946 markings/sec, 250 secs
lola: 34325853 markings, 389688541 edges, 100508 markings/sec, 255 secs
lola: 34912356 markings, 397180692 edges, 117301 markings/sec, 260 secs
lola: 35451364 markings, 404728831 edges, 107802 markings/sec, 265 secs
lola: 35855810 markings, 412191222 edges, 80889 markings/sec, 270 secs
lola: 36431333 markings, 419445862 edges, 115105 markings/sec, 275 secs
lola: 36976988 markings, 426712501 edges, 109131 markings/sec, 280 secs
lola: 37482019 markings, 434207418 edges, 101006 markings/sec, 285 secs
lola: 37864517 markings, 441667893 edges, 76500 markings/sec, 290 secs
lola: 38239204 markings, 449260258 edges, 74937 markings/sec, 295 secs
lola: 38673309 markings, 456774857 edges, 86821 markings/sec, 300 secs
lola: 39058253 markings, 464191856 edges, 76989 markings/sec, 305 secs
lola: 39413373 markings, 471534772 edges, 71024 markings/sec, 310 secs
lola: 39775966 markings, 478924459 edges, 72519 markings/sec, 315 secs
lola: 40158075 markings, 486324374 edges, 76422 markings/sec, 320 secs
lola: 40530013 markings, 493836697 edges, 74388 markings/sec, 325 secs
lola: 40833346 markings, 501226956 edges, 60667 markings/sec, 330 secs
lola: 41112701 markings, 508627839 edges, 55871 markings/sec, 335 secs
lola: 41663068 markings, 515805688 edges, 110073 markings/sec, 340 secs
lola: 42493948 markings, 523203891 edges, 166176 markings/sec, 345 secs
lola: 43288191 markings, 530640380 edges, 158849 markings/sec, 350 secs
lola: 44113716 markings, 538088971 edges, 165105 markings/sec, 355 secs
lola: 44868955 markings, 545535576 edges, 151048 markings/sec, 360 secs
lola: 45573673 markings, 552768702 edges, 140944 markings/sec, 365 secs
lola: 46232751 markings, 559711276 edges, 131816 markings/sec, 370 secs
lola: 46832628 markings, 567012281 edges, 119975 markings/sec, 375 secs
lola: 47381650 markings, 574355444 edges, 109804 markings/sec, 380 secs
lola: 47875354 markings, 581762550 edges, 98741 markings/sec, 385 secs
lola: 48523849 markings, 589267803 edges, 129699 markings/sec, 390 secs
lola: 49379729 markings, 596909177 edges, 171176 markings/sec, 395 secs
lola: 50160792 markings, 604269978 edges, 156213 markings/sec, 400 secs
lola: 50978648 markings, 611573073 edges, 163571 markings/sec, 405 secs
lola: 51710599 markings, 618720793 edges, 146390 markings/sec, 410 secs
lola: 52401204 markings, 625894354 edges, 138121 markings/sec, 415 secs
lola: 53095923 markings, 633145745 edges, 138944 markings/sec, 420 secs
lola: 53696539 markings, 640484007 edges, 120123 markings/sec, 425 secs
lola: 54236672 markings, 647671562 edges, 108027 markings/sec, 430 secs
lola: 54731492 markings, 655044495 edges, 98964 markings/sec, 435 secs
lola: 55333004 markings, 662367954 edges, 120302 markings/sec, 440 secs
lola: 56168829 markings, 669689932 edges, 167165 markings/sec, 445 secs
lola: 56942194 markings, 676846064 edges, 154673 markings/sec, 450 secs
lola: 57758089 markings, 684111371 edges, 163179 markings/sec, 455 secs
lola: 58473318 markings, 691267198 edges, 143046 markings/sec, 460 secs
lola: 59136772 markings, 698420344 edges, 132691 markings/sec, 465 secs
lola: 59903648 markings, 705649524 edges, 153375 markings/sec, 470 secs
lola: 60479885 markings, 712962896 edges, 115247 markings/sec, 475 secs
lola: 61034573 markings, 720151813 edges, 110938 markings/sec, 480 secs
lola: 61531468 markings, 727461068 edges, 99379 markings/sec, 485 secs
lola: 62000592 markings, 734857008 edges, 93825 markings/sec, 490 secs
lola: 62774540 markings, 742378453 edges, 154790 markings/sec, 495 secs
lola: 63576361 markings, 749781433 edges, 160364 markings/sec, 500 secs
lola: 64158427 markings, 757282194 edges, 116413 markings/sec, 505 secs
lola: 64736849 markings, 764604757 edges, 115684 markings/sec, 510 secs
lola: 65287765 markings, 772079519 edges, 110183 markings/sec, 515 secs
lola: 65664885 markings, 779508558 edges, 75424 markings/sec, 520 secs
lola: 66464158 markings, 786546703 edges, 159855 markings/sec, 525 secs
lola: 67188419 markings, 793707025 edges, 144852 markings/sec, 530 secs
lola: 67818186 markings, 801017464 edges, 125953 markings/sec, 535 secs
lola: 68418519 markings, 808473862 edges, 120067 markings/sec, 540 secs
lola: 68962535 markings, 816037585 edges, 108803 markings/sec, 545 secs
lola: 69406661 markings, 823559785 edges, 88825 markings/sec, 550 secs
lola: 70113017 markings, 830822766 edges, 141271 markings/sec, 555 secs
lola: 70866886 markings, 838325046 edges, 150774 markings/sec, 560 secs
lola: 71525702 markings, 845666524 edges, 131763 markings/sec, 565 secs
lola: 72093539 markings, 852794995 edges, 113567 markings/sec, 570 secs
lola: 72624884 markings, 859851489 edges, 106269 markings/sec, 575 secs
lola: 73114482 markings, 867125197 edges, 97920 markings/sec, 580 secs
lola: 73558586 markings, 874133194 edges, 88821 markings/sec, 585 secs
lola: 74087961 markings, 880820269 edges, 105875 markings/sec, 590 secs
lola: 74575195 markings, 887687252 edges, 97447 markings/sec, 595 secs
lola: 75030366 markings, 894676949 edges, 91034 markings/sec, 600 secs
lola: 75475221 markings, 901729224 edges, 88971 markings/sec, 605 secs
lola: 76055540 markings, 908924451 edges, 116064 markings/sec, 610 secs
lola: 76593175 markings, 916234526 edges, 107527 markings/sec, 615 secs
lola: 76986260 markings, 923520753 edges, 78617 markings/sec, 620 secs
lola: 77527582 markings, 930463739 edges, 108264 markings/sec, 625 secs
lola: 78060624 markings, 937426964 edges, 106608 markings/sec, 630 secs
lola: 78566288 markings, 944557548 edges, 101133 markings/sec, 635 secs
lola: 78919059 markings, 951596288 edges, 70554 markings/sec, 640 secs
lola: 79333843 markings, 958875375 edges, 82957 markings/sec, 645 secs
lola: 79698568 markings, 965907695 edges, 72945 markings/sec, 650 secs
lola: 80028549 markings, 972805469 edges, 65996 markings/sec, 655 secs
lola: 80430785 markings, 979684386 edges, 80447 markings/sec, 660 secs
lola: 80771935 markings, 986623441 edges, 68230 markings/sec, 665 secs
lola: 81112873 markings, 993630586 edges, 68188 markings/sec, 670 secs
lola: 81458510 markings, 1000734582 edges, 69127 markings/sec, 675 secs
lola: 81807150 markings, 1007948279 edges, 69728 markings/sec, 680 secs
lola: 82107508 markings, 1015148020 edges, 60072 markings/sec, 685 secs
lola: 82367810 markings, 1022287655 edges, 52060 markings/sec, 690 secs
lola: 82966668 markings, 1029380090 edges, 119772 markings/sec, 695 secs
lola: 83775186 markings, 1036676282 edges, 161704 markings/sec, 700 secs
lola: 84539777 markings, 1043813321 edges, 152918 markings/sec, 705 secs
lola: 85359258 markings, 1051131258 edges, 163896 markings/sec, 710 secs
lola: 86081256 markings, 1058168536 edges, 144400 markings/sec, 715 secs
lola: 86743516 markings, 1065142145 edges, 132452 markings/sec, 720 secs
lola: 87445477 markings, 1072222041 edges, 140392 markings/sec, 725 secs
lola: 88025497 markings, 1079388895 edges, 116004 markings/sec, 730 secs
lola: 88555105 markings, 1086509597 edges, 105922 markings/sec, 735 secs
lola: 89053222 markings, 1093797996 edges, 99623 markings/sec, 740 secs
lola: 89604097 markings, 1101067151 edges, 110175 markings/sec, 745 secs
lola: 90450228 markings, 1108255836 edges, 169226 markings/sec, 750 secs
lola: 91197145 markings, 1115396333 edges, 149383 markings/sec, 755 secs
lola: 92034227 markings, 1122683623 edges, 167416 markings/sec, 760 secs
lola: 92736018 markings, 1129912101 edges, 140358 markings/sec, 765 secs
lola: 93402343 markings, 1136960622 edges, 133265 markings/sec, 770 secs
lola: 94187524 markings, 1144088319 edges, 157036 markings/sec, 775 secs
lola: 94766600 markings, 1151404151 edges, 115815 markings/sec, 780 secs
lola: 95336499 markings, 1158683526 edges, 113980 markings/sec, 785 secs
lola: 95847457 markings, 1166071942 edges, 102192 markings/sec, 790 secs
lola: 96285092 markings, 1173424632 edges, 87527 markings/sec, 795 secs
lola: 97184814 markings, 1180554255 edges, 179944 markings/sec, 800 secs
lola: 97889134 markings, 1187723037 edges, 140864 markings/sec, 805 secs
lola: 98753041 markings, 1194826541 edges, 172781 markings/sec, 810 secs
lola: 99421423 markings, 1201965717 edges, 133676 markings/sec, 815 secs
lola: 100165208 markings, 1209023116 edges, 148757 markings/sec, 820 secs
lola: 100900139 markings, 1215966827 edges, 146986 markings/sec, 825 secs
lola: 101480132 markings, 1223154049 edges, 115999 markings/sec, 830 secs
lola: 102077151 markings, 1230428467 edges, 119404 markings/sec, 835 secs
lola: 102605649 markings, 1237820087 edges, 105700 markings/sec, 840 secs
lola: 103029098 markings, 1245299561 edges, 84690 markings/sec, 845 secs
lola: 103776554 markings, 1252562569 edges, 149491 markings/sec, 850 secs
lola: 104530153 markings, 1260069953 edges, 150720 markings/sec, 855 secs
lola: 105212212 markings, 1267728140 edges, 136412 markings/sec, 860 secs
lola: 105806905 markings, 1275221496 edges, 118939 markings/sec, 865 secs
lola: 106349645 markings, 1282667684 edges, 108548 markings/sec, 870 secs
lola: 106804744 markings, 1290231823 edges, 91020 markings/sec, 875 secs
lola: 107458456 markings, 1297177855 edges, 130742 markings/sec, 880 secs
lola: 108125534 markings, 1304068456 edges, 133416 markings/sec, 885 secs
lola: 108815140 markings, 1311027690 edges, 137921 markings/sec, 890 secs
lola: 109382958 markings, 1318027231 edges, 113564 markings/sec, 895 secs
lola: 109902327 markings, 1324966519 edges, 103874 markings/sec, 900 secs
lola: 110402656 markings, 1331950354 edges, 100066 markings/sec, 905 secs
lola: 110800235 markings, 1338925093 edges, 79516 markings/sec, 910 secs
lola: 111114272 markings, 1341528320 edges, 62807 markings/sec, 915 secs
lola: 111186015 markings, 1342168603 edges, 14349 markings/sec, 920 secs
lola: 111199943 markings, 1342398018 edges, 2786 markings/sec, 925 secs
lola: 111208326 markings, 1342445212 edges, 1677 markings/sec, 930 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no no unknown no yes yes no yes no no no no no no no
lola:
preliminary result: yes no no unknown no yes yes no yes no no no no no no no
lola: memory consumption: 22748 KB
lola: time consumption: 1241 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590589898136

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory

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="Sudoku-PT-AN04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool win2019"
echo " Input is Sudoku-PT-AN04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r238-oct2-159033569000085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN04.tgz
mv Sudoku-PT-AN04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;