fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r322-tall-162132128100246
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for UtilityControlRoom-COL-Z4T4N04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4341.331 3600000.00 9339.00 345.50 FFTFFFFTFFFTTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r322-tall-162132128100246.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is UtilityControlRoom-COL-Z4T4N04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128100246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 20K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.4K May 12 04:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 12 04:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 11 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 18:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_pt
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 5 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 29K May 12 08:13 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 UtilityControlRoom-COL-Z4T4N04-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-15

=== Now, execution of the tool begins

BK_START 1621451301178

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 19:08:22] [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]
[2021-05-19 19:08:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:08:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-19 19:08:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 521 ms
[2021-05-19 19:08:23] [INFO ] sort/places :
Cli->Clients,ControlRoomDispatch,Finished,ClientsWaiting,ClientsTimeout,
CxZ->OpenRequests,Assigned,StartSecuring,DoSecuring,
Dot->Idles,NumClientsReq,
Z->IdleTechs,
CxZxZ->MovetoZ,

[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignSameZone
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignNearZone
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignNearZone
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignNearZone
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition move_between_Municipalities
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition move_between_Municipalities
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition move_between_Municipalities
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition reachLocation
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition securing
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignMunicipality
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignFar
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignFar
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignFar
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition timeout
[2021-05-19 19:08:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition securingInTime
[2021-05-19 19:08:23] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 83 PT places and 144.0 transition bindings in 34 ms.
[2021-05-19 19:08:23] [INFO ] Computed order based on color domains.
[2021-05-19 19:08:23] [INFO ] Unfolded HLPN to a Petri net with 83 places and 144 transitions in 21 ms.
[2021-05-19 19:08:23] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 96 transitions.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=462 ) 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, 0, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 39 rows 31 cols
[2021-05-19 19:08:23] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-19 19:08:23] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned unsat
[2021-05-19 19:08:23] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-19 19:08:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-19 19:08:23] [INFO ] Flatten gal took : 28 ms
FORMULA UtilityControlRoom-COL-Z4T4N04-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:08:23] [INFO ] Applying decomposition
[2021-05-19 19:08:23] [INFO ] Flatten gal took : 9 ms
[2021-05-19 19:08:23] [INFO ] Decomposing Gal with order
[2021-05-19 19:08:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:08:23] [INFO ] Removed a total of 45 redundant transitions.
[2021-05-19 19:08:23] [INFO ] Flatten gal took : 31 ms
[2021-05-19 19:08:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2021-05-19 19:08:23] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-19 19:08:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ UtilityControlRoom-COL-Z4T4N04 @ 3570 seconds

FORMULA UtilityControlRoom-COL-Z4T4N04-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N04-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ UtilityControlRoom-COL-Z4T4N04

{
"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 May 19 19:08:24 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 9,
"adisj": 2,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (X (G ((X (X (G ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)))))) AND ((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18))))))",
"processed_size": 430,
"rewrites": 242
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 1,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))) U (X (G ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))) U (1 <= p25)))",
"processed_size": 214,
"rewrites": 242
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G ((X (G ((p25 <= 0))) OR F ((((p1 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0))))))",
"processed_size": 119,
"rewrites": 242
},
"result":
{
"edges": 129,
"markings": 78,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 3,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p8) OR (1 <= p9) OR (1 <= p7))) AND ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))) OR ((1 <= p8) OR (1 <= p9) OR (1 <= p7))))))",
"processed_size": 370,
"rewrites": 242
},
"result":
{
"edges": 16,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 6,
"adisj": 1,
"aneg": 14,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 12,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (X (F ((F ((p3 <= 0)) OR (X ((((p20 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))) AND ((p10 <= 0) AND ((p11 <= 0) AND ((p12 <= 0) AND ((p13 <= 0) AND ((p14 <= 0) AND ((p15 <= 0) AND ((p16 <= 0) AND ((p17 <= 0) AND ((p18 <= 0) AND (((p20 <= 0) OR (p27 <= 0)) AND (((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0))))))))))))))))))",
"processed_size": 383,
"rewrites": 242
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4))))))",
"processed_size": 99,
"rewrites": 242
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G (((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18)))",
"processed_size": 136,
"rewrites": 242
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))) AND (((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))))",
"processed_size": 189,
"rewrites": 242
},
"result":
{
"edges": 24,
"markings": 24,
"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": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G ((F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))) AND ((1 <= p8) OR (1 <= p9) OR (1 <= p7))))",
"processed_size": 141,
"rewrites": 242
},
"result":
{
"edges": 24,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p8) OR (1 <= p9) OR (1 <= p7) OR (1 <= p25)) OR (1 <= p25))))",
"processed_size": 78,
"rewrites": 242
},
"result":
{
"edges": 28,
"markings": 21,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 18,
"adisj": 2,
"aneg": 0,
"comp": 45,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 45,
"taut": 0,
"tconj": 0,
"tdisj": 10,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "F (G ((G (F ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))))) OR (X (((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18))) OR (((1 <= p2) AND (1 <= p5)) OR (((1 <= p0) AND (1 <= p6)) OR (((1 <= p1) AND (1 <= p4)) OR (((1 <= p2) AND (1 <= p6)) OR (((1 <= p1) AND (1 <= p6)) OR (((1 <= p1) AND (1 <= p5)) OR (((1 <= p0) AND (1 <= p4)) OR (((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))))))))))))))",
"processed_size": 704,
"rewrites": 242
},
"result":
{
"edges": 1026,
"markings": 288,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((1 <= p3))",
"processed_size": 13,
"rewrites": 242
},
"result":
{
"edges": 12,
"markings": 12,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 ((p3 <= 0)))",
"processed_size": 17,
"rewrites": 242
},
"result":
{
"edges": 41,
"markings": 34,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((G ((p26 <= 0)) OR (p26 <= 0))))",
"processed_size": 38,
"rewrites": 242
},
"result":
{
"edges": 14,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "F (G ((G (F (((p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0) AND (p16 <= 0) AND (p17 <= 0) AND (p18 <= 0)))) AND (1 <= p25))))",
"processed_size": 165,
"rewrites": 242
},
"result":
{
"edges": 16,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"aneg": 1,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((((p2 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p4 <= 0))))",
"processed_size": 271,
"rewrites": 242
},
"result":
{
"edges": 21,
"markings": 21,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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 (((p8 <= 0) AND (p9 <= 0) AND (p7 <= 0))))",
"processed_size": 47,
"rewrites": 242
},
"result":
{
"edges": 21,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 81392,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G((X(X(G(**))) AND **)))) : (** U (X(G(**)) U **)) : G((X(G(*)) OR F(*))) : (F(G((F(**) AND (** OR **)))) AND X(X(G(**)))) : (* AND (F(G(*)) OR G(*))) : X(X(F((F(*) OR (X(*) AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND *)))))))))))))))) : F(G((G(*) OR *))) : F(G(*)) : X(X(G(**))) : (X(*) OR (F((F(**) AND **)) OR (G(**) AND F((F(**) AND **))))) : (X(F((** OR **))) OR G((F(**) AND **))) : F(G((G(F(**)) OR (X(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))) : F(G((G(F(*)) AND **))) : (X(**) AND G(**))"
},
"net":
{
"arcs": 117,
"conflict_clusters": 18,
"places": 31,
"places_significant": 26,
"singleton_clusters": 0,
"transitions": 39
},
"result":
{
"preliminary_value": "no no yes no no yes no no no yes yes yes no no ",
"value": "no no yes no no yes no no no yes yes yes 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: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 992
lola: finding significant places
lola: 31 places, 39 transitions, 26 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 true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: NOT(F (X (NOT(X ((X (G (X ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)))))) AND ((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18)))))))) : ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))) U (G (X ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))) U (1 <= p25))) : G ((NOT(X (F ((1 <= p25)))) OR NOT(G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4))))))) : (X (NOT(G (F (NOT(X (((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))) U ((1 <= p8) OR (1 <= p9) OR (1 <= p7))))))))) AND X (G (X ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))))))) : NOT((X (NOT(X (NOT(F (G ((((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))) AND (1 <= p26)) U F (((1 <= p8) OR (1 <= p9) OR (1 <= p7)))))))))) U (((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))))) : NOT(G ((X (X (G ((1 <= p3)))) AND X (X (((((((((((((X ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) OR (1 <= p10)) OR (1 <= p11)) OR (1 <= p12)) OR (1 <= p13)) OR (1 <= p14)) OR (1 <= p15)) OR (1 <= p16)) OR (1 <= p17)) OR (1 <= p18)) OR ((1 <= p20) AND (1 <= p27))) OR ((1 <= p21) AND (1 <= p27))) OR ((1 <= p19) AND (1 <= p27)))))))) : NOT(G (F (X ((F ((1 <= p26)) AND (1 <= p26)))))) : G (F (X (F (G (NOT(F (X (G (F ((1 <= p3))))))))))) : X (G (X ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))))) : (NOT(X ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))) OR (G (((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18))) U F ((F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))) AND (((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4))))))) : (X (F ((F (((1 <= p8) OR (1 <= p9) OR (1 <= p7) OR (1 <= p25))) OR F ((1 <= p25))))) OR G ((F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))) AND ((1 <= p8) OR (1 <= p9) OR (1 <= p7))))) : F (G (X (((((((((((F (G ((((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18)) U F ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))))))) OR X (((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18)))) OR ((1 <= p2) AND (1 <= p5))) OR ((1 <= p0) AND (1 <= p6))) OR ((1 <= p1) AND (1 <= p4))) OR ((1 <= p2) AND (1 <= p6))) OR ((1 <= p1) AND (1 <= p6))) OR ((1 <= p1) AND (1 <= p5))) OR ((1 <= p0) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p5))) OR ((1 <= p2) AND (1 <= p4)))))) : F (G ((X (NOT(F (G (((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18)))))) AND (1 <= p25)))) : (X ((((p2 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)))) AND G ((1 <= p3)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:318
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((X (X (G ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)))))) AND ((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X (X (G ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)))))) AND ((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR ... (shortened)
lola: processed formula length: 430
lola: 242 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))) U (X (G ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))) U (1 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))) U (X (G ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))) U (1 <= p25)))
lola: processed formula length: 214
lola: 242 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((p25 <= 0))) OR F ((((p1 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((p25 <= 0))) OR F ((((p1 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0))))))
lola: processed formula length: 119
lola: 242 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 78 markings, 129 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F (((1 <= p8) OR (1 <= p9) OR (1 <= p7))) AND ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))) OR ((1 <= p8) OR (1 <= p9) OR (1 <= p7)))))) AND X (X (G ((((1 <= p2) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p8) OR (1 <= p9) OR (1 <= p7))) AND ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))) OR ((1 <= p8) OR (1 <= p9) OR (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p8) OR (1 <= p9) OR (1 <= p7))) AND ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))) OR ((1 <= p8) OR (1 <= p9) OR (1 <= p7))))))
lola: processed formula length: 370
lola: 242 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 15 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((F ((p3 <= 0)) OR (X ((((p20 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))) AND ((p10 <= 0) AND ((p11 <= 0) AND ((p12 <= 0) AND ((p13 <= 0) AND ((p14 <= 0) AND ((p15 <= 0) AND ((p16 <= 0) AND ((p17 <= 0) AND ((p18 <= 0) AND (((p20 <= 0) OR (p27 <= 0)) AND (((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0))))))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((F ((p3 <= 0)) OR (X ((((p20 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))) AND ((p10 <= 0) AND ((p11 <= 0) AND ((p12 <= 0) AND ((p13 <= 0) AND ((p14 <= 0) AND ((p15 <= 0) AND ((p16 <= 0) AND ((p17 <= 0) AND ((p18 <= 0) AND (((p20 <= 0) OR (p27 <= 0)) AND (((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0))))))))))))))))))
lola: processed formula length: 383
lola: 242 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4))))))
lola: processed formula length: 99
lola: 242 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p20 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))) OR (F ((F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))) AND (((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4))))) OR (G (((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18)))
lola: processed formula length: 136
lola: 242 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))) AND (((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))) AND (((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))))
lola: processed formula length: 189
lola: 242 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p20 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p20 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0))))
lola: processed formula length: 97
lola: 242 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((1 <= p8) OR (1 <= p9) OR (1 <= p7) OR (1 <= p25)) OR (1 <= p25)))) OR G ((F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))) AND ((1 <= p8) OR (1 <= p9) OR (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))) AND ((1 <= p8) OR (1 <= p9) OR (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)))) AND ((1 <= p8) OR (1 <= p9) OR (1 <= p7))))
lola: processed formula length: 141
lola: 242 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p8) OR (1 <= p9) OR (1 <= p7) OR (1 <= p25)) OR (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p8) OR (1 <= p9) OR (1 <= p7) OR (1 <= p25)) OR (1 <= p25))))
lola: processed formula length: 78
lola: 242 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 28 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))))) OR (X (((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4))))) OR (X (((1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <... (shortened)
lola: processed formula length: 704
lola: 242 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 288 markings, 1026 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p2 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)))) AND G ((1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p3))
lola: processed formula length: 13
lola: 242 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: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p3 <= 0)))
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 ((p3 <= 0)))
lola: processed formula length: 17
lola: 242 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: add low 27
lola: add low 9
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: 34 markings, 41 edges
lola: ========================================
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((p26 <= 0)) OR (p26 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((p26 <= 0)) OR (p26 <= 0))))
lola: processed formula length: 38
lola: 242 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: 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: 13 markings, 14 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F (((p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0) AND (p16 <= 0) AND (p17 <= 0) AND (p18 <= 0)))) AND (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F (((p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0) AND (p16 <= 0) AND (p17 <= 0) AND (p18 <= 0)))) AND (1 <= p25))))
lola: processed formula length: 165
lola: 242 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: 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: 15 markings, 16 edges
lola: ========================================
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p2 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p4 <= 0))) AND (F (G (((p8 <= 0) AND (p9 <= 0) AND (p7 <= 0)))) OR G ((((p2 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p2 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p2 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p4 <= 0))))
lola: processed formula length: 271
lola: 242 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: 21 markings, 21 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p8 <= 0) AND (p9 <= 0) AND (p7 <= 0))))
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 (((p8 <= 0) AND (p9 <= 0) AND (p7 <= 0))))
lola: processed formula length: 47
lola: 242 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: 17 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no yes no no no yes yes yes no no
lola:
preliminary result: no no yes no no yes no no no yes yes yes no no
lola: memory consumption: 81392 KB
lola: time consumption: 3 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="UtilityControlRoom-COL-Z4T4N04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is UtilityControlRoom-COL-Z4T4N04, 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 r322-tall-162132128100246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N04.tgz
mv UtilityControlRoom-COL-Z4T4N04 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;