About the Execution of ITS-LoLa for GlobalResAllocation-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15727.790 | 3600000.00 | 48820.00 | 60.30 | FFFFFFTTFFFFFFTF | normal |
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.r184-oct2-158987928000058.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 itslola
Input is GlobalResAllocation-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928000058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 7.7K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.6K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 209K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 662K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 5.7M Apr 27 15:14 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 GlobalResAllocation-PT-03-00
FORMULA_NAME GlobalResAllocation-PT-03-01
FORMULA_NAME GlobalResAllocation-PT-03-02
FORMULA_NAME GlobalResAllocation-PT-03-03
FORMULA_NAME GlobalResAllocation-PT-03-04
FORMULA_NAME GlobalResAllocation-PT-03-05
FORMULA_NAME GlobalResAllocation-PT-03-06
FORMULA_NAME GlobalResAllocation-PT-03-07
FORMULA_NAME GlobalResAllocation-PT-03-08
FORMULA_NAME GlobalResAllocation-PT-03-09
FORMULA_NAME GlobalResAllocation-PT-03-10
FORMULA_NAME GlobalResAllocation-PT-03-11
FORMULA_NAME GlobalResAllocation-PT-03-12
FORMULA_NAME GlobalResAllocation-PT-03-13
FORMULA_NAME GlobalResAllocation-PT-03-14
FORMULA_NAME GlobalResAllocation-PT-03-15
=== Now, execution of the tool begins
BK_START 1591188133276
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 12:42:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 12:42:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 12:42:15] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2020-06-03 12:42:15] [INFO ] Transformed 33 places.
[2020-06-03 12:42:15] [INFO ] Transformed 4791 transitions.
[2020-06-03 12:42:15] [INFO ] Parsed PT model containing 33 places and 4791 transitions in 390 ms.
[2020-06-03 12:42:15] [INFO ] Reduced 480 identical enabling conditions.
[2020-06-03 12:42:15] [INFO ] Reduced 480 identical enabling conditions.
[2020-06-03 12:42:15] [INFO ] Reduced 3510 identical enabling conditions.
[2020-06-03 12:42:15] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:15] [INFO ] Reduced 3510 identical enabling conditions.
[2020-06-03 12:42:15] [INFO ] Reduced 480 identical enabling conditions.
[2020-06-03 12:42:15] [INFO ] Reduced 480 identical enabling conditions.
[2020-06-03 12:42:15] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:15] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:15] [INFO ] Reduced 45 identical enabling conditions.
Ensure Unique test removed 4080 transitions
Reduce redundant transitions removed 4080 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 84 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 714 ms. (steps per millisecond=140 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1]
Normalized transition count is 693 out of 711 initially.
// Phase 1: matrix 693 rows 33 cols
[2020-06-03 12:42:16] [INFO ] Computed 12 place invariants in 19 ms
[2020-06-03 12:42:16] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned unsat
[2020-06-03 12:42:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 12:42:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 12:42:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 12:42:16] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned unsat
[2020-06-03 12:42:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 12:42:16] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned unsat
[2020-06-03 12:42:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-03 12:42:16] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 12:42:16] [INFO ] Flatten gal took : 131 ms
FORMULA GlobalResAllocation-PT-03-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 12:42:16] [INFO ] Flatten gal took : 83 ms
[2020-06-03 12:42:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2020-06-03 12:42:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ GlobalResAllocation-PT-03 @ 3570 seconds
FORMULA GlobalResAllocation-PT-03-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GlobalResAllocation-PT-03-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GlobalResAllocation-PT-03-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GlobalResAllocation-PT-03-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GlobalResAllocation-PT-03-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GlobalResAllocation-PT-03-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GlobalResAllocation-PT-03-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GlobalResAllocation-PT-03-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GlobalResAllocation-PT-03-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GlobalResAllocation-PT-03-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GlobalResAllocation-PT-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GlobalResAllocation-PT-03-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3534
rslt: Output for LTLFireability @ GlobalResAllocation-PT-03
{
"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": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 12:42:17 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 18,
"adisj": 1,
"aneg": 1,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "X (X (X (G ((((p13 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)) AND ((p18 <= 0) OR (p31 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p27 <= 0)) AND ((p17 <= 0) OR (p28 <= 0)) AND ((p23 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p25 <= 0) OR (p31 <= 0)) AND ((p24 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p26 <= 0) OR (p27 <= 0)) AND ((p14 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR (p28 <= 0)) AND ((p22 <= 0) OR (p28 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p16 <= 0) OR (p28 <= 0)))))))",
"processed_size": 588,
"rewrites": 258
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"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": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "X (X (X (G (((4 <= p29) OR (4 <= p30) OR (4 <= p32))))))",
"processed_size": 58,
"rewrites": 258
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"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": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 1,
"aconj": 135,
"adisj": 4,
"aneg": 4,
"comp": 588,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 588,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "X (G ((G (((p29 <= 3) AND (p30 <= 3) AND (p32 <= 3))) OR (G ((((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)))) OR ((((p9 <= 0) OR (p12 <= 0) OR (p28 <= 1)) AND ((p10 <= 0) OR (p14 <= 0) OR (p27 <= 1)) AND ((p12 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p14 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p13 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p22 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p16 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p11 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p14 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p16 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p15 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p15 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p13 <= 0) OR (p31 <= 1)) AND ((p19 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p9 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p18 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p15 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p13 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p10 <= 0) OR (p15 <= 0) OR (p27 <= 1)) AND ((p12 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p9 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p21 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p9 <= 0) OR (p16 <= 0) OR (p28 <= 1)) AND ((p17 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p12 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p9 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p13 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p18 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p28 <= 1)) AND ((p14 <= 0) OR (p15 <= 0) OR (p27 <= 1)) AND ((p19 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p13 <= 0) OR (p18 <= 0) OR (p31 <= 1)) AND ((p20 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p10 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p18 <= 0) OR (p31 <= 1)) AND ((p24 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p10 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p20 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p18 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p17 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p16 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p10 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p14 <= 0) OR (p26 <= 0) OR (p27 <= 1))) OR (((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0))))))))",
"processed_size": 8657,
"rewrites": 258
},
"result":
{
"edges": 757,
"markings": 298,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"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": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 90,
"adisj": 2,
"aneg": 0,
"comp": 270,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 270,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "G ((F (G ((((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27))))) OR X ((((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27))))))",
"processed_size": 4236,
"rewrites": 258
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"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": 441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X (G ((((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR (G (F ((F (((1 <= p1) AND (1 <= p3))) AND ((1 <= p10) AND ((1 <= p14) AND (2 <= p27)))))) AND F (((1 <= p10) AND (1 <= p14) AND (2 <= p27))))))))",
"processed_size": 201,
"rewrites": 258
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 505
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p0) AND (1 <= p3) AND (1 <= p7) AND (1 <= p8))",
"processed_size": 53,
"rewrites": 260
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 614
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 589
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 18,
"adisj": 1,
"aneg": 1,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "(((p13 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)) AND ((p18 <= 0) OR (p31 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p27 <= 0)) AND ((p17 <= 0) OR (p28 <= 0)) AND ((p23 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p25 <= 0) OR (p31 <= 0)) AND ((p24 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p26 <= 0) OR (p27 <= 0)) AND ((p14 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR (p28 <= 0)) AND ((p22 <= 0) OR (p28 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p16 <= 0) OR (p28 <= 0)))",
"processed_size": 572,
"rewrites": 260
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 708
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 707
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((4 <= p29)))",
"processed_size": 18,
"rewrites": 258
},
"result":
{
"edges": 5,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 883
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": "F (G (((1 <= p2) AND (1 <= p4) AND (1 <= p6))))",
"processed_size": 47,
"rewrites": 258
},
"result":
{
"edges": 5,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1178
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 60,
"aneg": 0,
"comp": 240,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 240,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G (F ((((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)))))",
"processed_size": 3485,
"rewrites": 258
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1767
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F (G ((p29 <= 3))) AND F (((1 <= p0) AND (1 <= p4))))))",
"processed_size": 62,
"rewrites": 258
},
"result":
{
"edges": 9,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 10,
"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": 3535
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3535
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((4 <= p29) OR (4 <= p30) OR (4 <= p32))",
"processed_size": 40,
"rewrites": 261
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((4 <= p29) OR (4 <= p30) OR (4 <= p32))",
"processed_size": 40,
"rewrites": 261
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 2,
"X": 0,
"aconj": 18,
"adisj": 4,
"aneg": 0,
"comp": 45,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 45,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8))) U (F (((4 <= p29) OR (4 <= p30) OR (4 <= p32))) U (F (((4 <= p29) OR (4 <= p30) OR (4 <= p32))) AND ((4 <= p29) OR (4 <= p30) OR (4 <= p32)))))",
"processed_size": 688,
"rewrites": 258
},
"result":
{
"edges": 764439,
"markings": 46693,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 1362052,
"runtime": 36.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(X(G(*)))) : G(F(**)) : X(X(X(G(**)))) : X(G((G(*) OR (G(*) OR (* OR *))))) : G((F(G(**)) OR X(**))) : ((** U (F(**) U (F(**) AND **))) OR (** OR (** OR **))) : F(**) : F(G(**)) : X(X(G((** OR (G(F((F(**) AND (** AND (** AND **))))) AND F(**)))))) : F(G(**)) : F(*) : G(F((F(G(*)) AND F(**))))"
},
"net":
{
"arcs": 4947,
"conflict_clusters": 7,
"places": 33,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 711
},
"result":
{
"preliminary_value": "no no no no no yes yes no no no no no ",
"value": "no no no no no yes yes 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: 744/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 711 transitions, 21 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 LTLFireability.xml
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (4 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (4 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (4 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (4 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (4 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (4 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (4 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (4 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (4 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (4 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (4 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (4 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (4 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (4 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (4 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (4 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (4 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (4 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p21)
lola: LP says that atomic proposition is always false: (2 <= p19)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p20)
lola: LP says that atomic proposition is always false: (2 <= p13)
lola: LP says that atomic proposition is always false: (2 <= p17)
lola: LP says that atomic proposition is always false: (2 <= p9)
lola: LP says that atomic proposition is always false: (2 <= p14)
lola: LP says that atomic proposition is always false: (2 <= p25)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p12)
lola: LP says that atomic proposition is always false: (2 <= p24)
lola: LP says that atomic proposition is always false: (2 <= p23)
lola: LP says that atomic proposition is always false: (2 <= p26)
lola: LP says that atomic proposition is always false: (2 <= p18)
lola: LP says that atomic proposition is always false: (2 <= p22)
lola: LP says that atomic proposition is always false: (4 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (4 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (4 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (4 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (4 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (4 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (4 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (4 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (4 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (4 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (4 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (4 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (4 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (4 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (4 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (4 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (4 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (4 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p21)
lola: LP says that atomic proposition is always false: (2 <= p19)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p20)
lola: LP says that atomic proposition is always false: (2 <= p13)
lola: LP says that atomic proposition is always false: (2 <= p17)
lola: LP says that atomic proposition is always false: (2 <= p9)
lola: LP says that atomic proposition is always false: (2 <= p14)
lola: LP says that atomic proposition is always false: (2 <= p25)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p12)
lola: LP says that atomic proposition is always false: (2 <= p24)
lola: LP says that atomic proposition is always false: (2 <= p23)
lola: LP says that atomic proposition is always false: (2 <= p26)
lola: LP says that atomic proposition is always false: (2 <= p18)
lola: LP says that atomic proposition is always false: (2 <= p22)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p21)
lola: LP says that atomic proposition is always false: (2 <= p19)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p20)
lola: LP says that atomic proposition is always false: (2 <= p13)
lola: LP says that atomic proposition is always false: (2 <= p17)
lola: LP says that atomic proposition is always false: (2 <= p9)
lola: LP says that atomic proposition is always false: (2 <= p14)
lola: LP says that atomic proposition is always false: (2 <= p25)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p12)
lola: LP says that atomic proposition is always false: (2 <= p24)
lola: LP says that atomic proposition is always false: (2 <= p23)
lola: LP says that atomic proposition is always false: (2 <= p26)
lola: LP says that atomic proposition is always false: (2 <= p18)
lola: LP says that atomic proposition is always false: (2 <= p22)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p21)
lola: LP says that atomic proposition is always false: (2 <= p19)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p20)
lola: LP says that atomic proposition is always false: (2 <= p13)
lola: LP says that atomic proposition is always false: (2 <= p17)
lola: LP says that atomic proposition is always false: (2 <= p9)
lola: LP says that atomic proposition is always false: (2 <= p14)
lola: LP says that atomic proposition is always false: (2 <= p25)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p12)
lola: LP says that atomic proposition is always false: (2 <= p24)
lola: LP says that atomic proposition is always false: (2 <= p23)
lola: LP says that atomic proposition is always false: (2 <= p26)
lola: LP says that atomic proposition is always false: (2 <= p18)
lola: LP says that atomic proposition is always false: (2 <= p22)
lola: NOT(F (NOT(X (G (NOT(X (X ((((1 <= p13) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p31)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p17) AND (1 <= p28)) OR ((1 <= p23) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p25) AND (1 <= p31)) OR ((1 <= p24) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p26) AND (1 <= p27)) OR ((1 <= p14) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p28)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p16) AND (1 <= p28))))))))))) : (((((((((((((((((((X (G ((((1 <= p2) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7))))) AND ((p13 <= 0) OR (p31 <= 0))) AND ((p20 <= 0) OR (p27 <= 0))) AND ((p18 <= 0) OR (p31 <= 0))) AND ((p15 <= 0) OR (p27 <= 0))) AND ((p10 <= 0) OR (p27 <= 0))) AND ((p17 <= 0) OR (p28 <= 0))) AND ((p23 <= 0) OR (p28 <= 0))) AND ((p21 <= 0) OR (p27 <= 0))) AND ((p25 <= 0) OR (p31 <= 0))) AND ((p24 <= 0) OR (p31 <= 0))) AND ((p9 <= 0) OR (p28 <= 0))) AND ((p26 <= 0) OR (p27 <= 0))) AND ((p14 <= 0) OR (p27 <= 0))) AND ((p19 <= 0) OR (p31 <= 0))) AND ((p12 <= 0) OR (p28 <= 0))) AND ((p22 <= 0) OR (p28 <= 0))) AND ((p11 <= 0) OR (p31 <= 0))) AND ((p16 <= 0) OR (p28 <= 0))) U NOT(F (NOT(F ((((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)))))))) : X (X (X (G (((4 <= p29) OR (4 <= p30) OR (4 <= p32)))))) : NOT(X (F ((((F (((4 <= p29) OR (4 <= p30) OR (4 <= p32))) AND F ((((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7))))) AND (((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27)))) AND (((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7))))))) : NOT(F ((NOT(F (X (G ((((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27))))))) AND NOT(X ((((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27)))))))) : (((((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8))) U (F (((4 <= p29) OR (4 <= p30) OR (4 <= p32))) U (F (((4 <= p29) OR (4 <= p30) OR (4 <= p32))) AND ((4 <= p29) OR (4 <= p30) OR (4 <= p32))))) OR (4 <= p29)) OR (4 <= p30)) OR (4 <= p32)) : F ((X (X (G ((((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27)))))) U F ((((1 <= p13) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p31)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p17) AND (1 <= p28)) OR ((1 <= p23) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p25) AND (1 <= p31)) OR ((1 <= p24) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p26) AND (1 <= p27)) OR ((1 <= p14) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p28)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p16) AND (1 <= p28)))))) : F (G (((1 <= p2) AND (1 <= p4) AND (1 <= p6)))) : G (X (X ((G (F (X ((((F (((1 <= p1) AND (1 <= p3))) AND (1 <= p10)) AND (1 <= p14)) AND (2 <= p27))))) U ((1 <= p10) AND (1 <= p14) AND (2 <= p27)))))) : X (NOT(G (NOT(((4 <= p30) U X (G (X (X (X ((4 <= p29))))))))))) : NOT(G (((((1 <= p0) AND (1 <= p4)) U (1 <= 0)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7) AND (1 <= p8))))) : X (G (F ((F (NOT(F ((4 <= p29)))) AND F (((1 <= p0) AND (1 <= p4)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((((p13 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)) AND ((p18 <= 0) OR (p31 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p27 <= 0)) AND ((p17 <= 0) OR (p28 <= 0)) AND ((p23 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p25 <= 0) OR (p31 <= 0)) AND ((p24 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p26 <= 0) OR (p27 <= 0)) AND ((p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((((p13 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)) AND ((p18 <= 0) OR (p31 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p27 <= 0)) AND ((p17 <= 0) OR (p28 <= 0)) AND ((p23 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p25 <= 0) OR (p31 <= 0)) AND ((p24 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p26 <= 0) OR (p27 <= 0)) AND ((p1... (shortened)
lola: processed formula length: 588
lola: 258 rewrites
lola: closed formula file LTLFireability.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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 1 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G (((4 <= p29) OR (4 <= p30) OR (4 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G (((4 <= p29) OR (4 <= p30) OR (4 <= p32))))))
lola: processed formula length: 58
lola: 258 rewrites
lola: closed formula file LTLFireability.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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 2 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((p29 <= 3) AND (p30 <= 3) AND (p32 <= 3))) OR (G ((((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((p29 <= 3) AND (p30 <= 3) AND (p32 <= 3))) OR (G ((((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= ... (shortened)
lola: processed formula length: 8657
lola: 258 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 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: 298 markings, 757 edges
lola: ========================================
lola: subprocess 3 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AN... (shortened)
lola: processed formula length: 4236
lola: 258 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 4 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR (G (F ((F (((1 <= p1) AND (1 <= p3))) AND ((1 <= p10) AND ((1 <= p14) AND (2 <= p27)))))) AND F (((1 <= p10) AND (1 <= p14) AND (2 <= p27))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR (G (F ((F (((1 <= p1) AND (1 <= p3))) AND ((1 <= p10) AND ((1 <= p14) AND (2 <= p27)))))) AND F (((1 <= p10) AND (1 <= p14) AND (2 <= p27))))))))
lola: processed formula length: 201
lola: 258 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p0 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p0) AND (1 <= p3) AND (1 <= p7) AND (1 <= p8))
lola: processed formula length: 53
lola: 260 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p13) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p31)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p17) AND (1 <= p28)) OR ((1 <= p23) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p25) AND (1 <= p31)) OR ((1 <= p24) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p26) AND (1 <= p27)) OR ((1 <= p14) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p13 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)) AND ((p18 <= 0) OR (p31 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p27 <= 0)) AND ((p17 <= 0) OR (p28 <= 0)) AND ((p23 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p25 <= 0) OR (p31 <= 0)) AND ((p24 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p26 <= 0) OR (p27 <= 0)) AND ((p14 <= 0) OR ... (shortened)
lola: processed formula length: 572
lola: 260 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((4 <= p29)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((4 <= p29)))
lola: processed formula length: 18
lola: 258 rewrites
lola: closed formula file LTLFireability.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: 4 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p2) AND (1 <= p4) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p2) AND (1 <= p4) AND (1 <= p6))))
lola: processed formula length: 47
lola: 258 rewrites
lola: closed formula file LTLFireability.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: 4 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p... (shortened)
lola: processed formula length: 3485
lola: 258 rewrites
lola: closed formula file LTLFireability.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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 1767 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((p29 <= 3))) AND F (((1 <= p0) AND (1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((p29 <= 3))) AND F (((1 <= p0) AND (1 <= p4))))))
lola: processed formula length: 62
lola: 258 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 7 markings, 9 edges
lola: ========================================
lola: subprocess 11 will run for 3535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((4 <= p29) OR ((4 <= p30) OR (4 <= p32)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((4 <= p29) OR (4 <= p30) OR (4 <= p32))
lola: processed formula length: 40
lola: 261 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((4 <= p29) OR ((4 <= p30) OR (4 <= p32)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((4 <= p29) OR (4 <= p30) OR (4 <= p32))
lola: processed formula length: 40
lola: 261 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p... (shortened)
lola: processed formula length: 688
lola: 258 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 46693 markings, 764439 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes yes no no no no no
lola:
preliminary result: no no no no no yes yes no no no no no
lola: memory consumption: 1362052 KB
lola: time consumption: 36 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GlobalResAllocation-PT-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is GlobalResAllocation-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928000058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-PT-03.tgz
mv GlobalResAllocation-PT-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;