Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871200002.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is Philosophers-COL-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871200002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 9.7K 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 Philosophers-COL-000005-00
FORMULA_NAME Philosophers-COL-000005-01
FORMULA_NAME Philosophers-COL-000005-02
FORMULA_NAME Philosophers-COL-000005-03
FORMULA_NAME Philosophers-COL-000005-04
FORMULA_NAME Philosophers-COL-000005-05
FORMULA_NAME Philosophers-COL-000005-06
FORMULA_NAME Philosophers-COL-000005-07
FORMULA_NAME Philosophers-COL-000005-08
FORMULA_NAME Philosophers-COL-000005-09
FORMULA_NAME Philosophers-COL-000005-10
FORMULA_NAME Philosophers-COL-000005-11
FORMULA_NAME Philosophers-COL-000005-12
FORMULA_NAME Philosophers-COL-000005-13
FORMULA_NAME Philosophers-COL-000005-14
FORMULA_NAME Philosophers-COL-000005-15

=== Now, execution of the tool begins

BK_START 1591124240539

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 18:57: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]
[2020-06-02 18:57:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 18:57: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.
[2020-06-02 18:57:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 577 ms
[2020-06-02 18:57:23] [INFO ] sort/places :
Philo->think,fork,catch1,catch2,eat,

[2020-06-02 18:57:23] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25 PT places and 25.0 transition bindings in 16 ms.
[2020-06-02 18:57:23] [INFO ] Computed order based on color domains.
[2020-06-02 18:57:23] [INFO ] Unfolded HLPN to a Petri net with 25 places and 25 transitions in 49 ms.
[2020-06-02 18:57:23] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 114 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 91 steps, including 1 resets, run visited all 41 properties in 4 ms. (steps per millisecond=22 )
[2020-06-02 18:57:23] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-02 18:57:23] [INFO ] Flatten gal took : 119 ms
FORMULA Philosophers-COL-000005-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 18:57:23] [INFO ] Applying decomposition
[2020-06-02 18:57:23] [INFO ] Flatten gal took : 6 ms
[2020-06-02 18:57:23] [INFO ] Decomposing Gal with order
[2020-06-02 18:57:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 18:57:23] [INFO ] Removed a total of 5 redundant transitions.
[2020-06-02 18:57:24] [INFO ] Flatten gal took : 527 ms
[2020-06-02 18:57:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2020-06-02 18:57:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2020-06-02 18:57:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Philosophers-COL-000005 @ 3570 seconds

FORMULA Philosophers-COL-000005-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000005-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000005-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000005-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000005-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000005-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000005-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000005-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000005-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000005-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000005-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000005-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ Philosophers-COL-000005

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 18:57:24 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 3,
"aconj": 21,
"adisj": 3,
"aneg": 0,
"comp": 45,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 45,
"taut": 0,
"tconj": 1,
"tdisj": 6,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X (X ((((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)) U G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) AND (F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))) OR (((1 <= p4) AND (1 <= p8)) OR (((1 <= p1) AND (1 <= p5)) OR (((1 <= p3) AND (1 <= p7)) OR (((1 <= p2) AND (1 <= p6)) OR (((1 <= p0) AND (1 <= p9)) OR X ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))))))))))))))",
"processed_size": 720,
"rewrites": 136
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 5,
"aneg": 0,
"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": "(((p7 <= 0) OR (p18 <= 0)) AND ((p5 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p19 <= 0)))",
"processed_size": 152,
"rewrites": 143
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 15,
"adisj": 3,
"aneg": 0,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X ((X (G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) AND G ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12))))))) U (((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))))",
"processed_size": 488,
"rewrites": 136
},
"result":
{
"edges": 11,
"markings": 11,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))",
"processed_size": 148,
"rewrites": 143
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 10,
"adisj": 2,
"aneg": 2,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (X (F ((X ((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)))) AND F ((((p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p9 <= 0))))))))",
"processed_size": 326,
"rewrites": 136
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24)) U ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)))",
"processed_size": 149,
"rewrites": 136
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 12,
"adisj": 11,
"aneg": 0,
"comp": 50,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND (p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)) OR (G ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) AND F ((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND (p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0))))))",
"processed_size": 786,
"rewrites": 136
},
"result":
{
"edges": 21,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 3,
"X": 2,
"aconj": 20,
"adisj": 6,
"aneg": 0,
"comp": 50,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(((X (G ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))))) U (((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) U X ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))))) U (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24)) OR (G ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) AND F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24))))))",
"processed_size": 790,
"rewrites": 136
},
"result":
{
"edges": 29,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 28
},
"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": 509
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "F (G ((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)))))",
"processed_size": 160,
"rewrites": 136
},
"result":
{
"edges": 80,
"markings": 50,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0))",
"processed_size": 72,
"rewrites": 136
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 10,
"adisj": 2,
"aneg": 0,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X (((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))) U (X ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) OR ((1 <= p20) OR ((1 <= p21) OR ((1 <= p22) OR ((1 <= p23) OR (1 <= p24))))))))",
"processed_size": 392,
"rewrites": 136
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (X (G ((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0))))))",
"processed_size": 164,
"rewrites": 136
},
"result":
{
"edges": 55,
"markings": 37,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24))))",
"processed_size": 80,
"rewrites": 136
},
"result":
{
"edges": 82,
"markings": 60,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9)))))",
"processed_size": 155,
"rewrites": 136
},
"result":
{
"edges": 50,
"markings": 32,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 26,
"adisj": 5,
"aneg": 0,
"comp": 50,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) AND (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))) U G (((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))) AND (((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))))) OR (((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))))))",
"processed_size": 787,
"rewrites": 136
},
"result":
{
"edges": 7,
"markings": 6,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 25,
"adisj": 3,
"aneg": 0,
"comp": 50,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "F (G (((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))) OR (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))) AND F ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))))))))",
"processed_size": 790,
"rewrites": 136
},
"result":
{
"edges": 29,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 82980,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((** U G((F(**) AND (F(**) OR (** OR (** OR (** OR (** OR (** OR X(**)))))))))))) : (X((X(G((F(**) AND G(**)))) U **)) AND (** AND (** AND (** AND (** AND **))))) : F(G(**)) : G((F(**) AND ((** U G(**)) OR **))) : (X(X(F((X(*) AND F(*))))) OR (** OR (** OR (** OR (** OR **))))) : F(G((** OR (G(**) AND F(**))))) : (X((** OR (G(**) AND F(**)))) AND (** U **)) : (((X(G(**)) U **) U X(**)) U (** OR (G(**) AND F(**)))) : G(F(**)) : (G((X((G(*) AND (* AND (* AND (* AND (* AND *)))))) AND (* AND (* AND (* AND (* AND *)))))) OR G(**)) : (** AND (F(G(*)) OR X((** U (X(**) OR (** OR (** OR (** OR (** OR **))))))))) : X(X(G(*)))"
},
"net":
{
"arcs": 80,
"conflict_clusters": 6,
"places": 25,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 25
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no ",
"value": "no no no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 50/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25
lola: finding significant places
lola: 25 places, 25 transitions, 15 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: X (X ((((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)) U G (((((((F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))) OR ((1 <= p4) AND (1 <= p8))) OR ((1 <= p1) AND (1 <= p5))) OR ((1 <= p3) AND (1 <= p7))) OR ((1 <= p2) AND (1 <= p6))) OR ((1 <= p0) AND (1 <= p9))) U X ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))))))))) : (((((X ((G ((F (X ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))))) AND X (G ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12))))))) U (((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12))))) AND ((p7 <= 0) OR (p18 <= 0))) AND ((p5 <= 0) OR (p16 <= 0))) AND ((p9 <= 0) OR (p15 <= 0))) AND ((p6 <= 0) OR (p17 <= 0))) AND ((p8 <= 0) OR (p19 <= 0))) : F (X (G (X (X (((NOT(F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))))) OR NOT(X ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9)))))) U F (G ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))))))))))) : G ((((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))) U G (((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))) AND (((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))))) U (((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))))) : (((((NOT(G (X (G (X (G ((X ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) OR G ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))))))))))) OR ((1 <= p8) AND (1 <= p13))) OR ((1 <= p9) AND (1 <= p14))) OR ((1 <= p5) AND (1 <= p10))) OR ((1 <= p6) AND (1 <= p11))) OR ((1 <= p7) AND (1 <= p12))) : X (F (G ((G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))) U (((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))))))) : (X ((G ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) U (((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND (p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)))) AND (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24)) U ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)))) : (((X (G ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))))) U (((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) U X ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))))) U (G ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) U ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24)))) : F (((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))) U G (F (X (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24))))))) : (NOT(F ((((((X ((((((F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))) OR ((1 <= p0) AND (1 <= p5))) OR ((1 <= p4) AND (1 <= p9))) OR ((1 <= p1) AND (1 <= p6))) OR ((1 <= p3) AND (1 <= p8))) OR ((1 <= p2) AND (1 <= p7)))) OR ((1 <= p4) AND (1 <= p8))) OR ((1 <= p1) AND (1 <= p5))) OR ((1 <= p3) AND (1 <= p7))) OR ((1 <= p2) AND (1 <= p6))) OR ((1 <= p0) AND (1 <= p9))))) OR G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))))) : (((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)) AND (NOT(G (F ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))))) OR X (((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))) U (((((X ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) OR (1 <= p20)) OR (1 <= p21)) OR (1 <= p22)) OR (1 <= p23)) OR (1 <= p24)))))) : X (X (NOT(F ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))))))
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:437
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: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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:425
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: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:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)) U G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) AND (F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)) U G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) AND (F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))) ... (shortened)
lola: processed formula length: 720
lola: 136 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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, 15 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) AND G ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12))))))) U (((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p7 <= 0) OR (p18 <= 0)) AND (((p5 <= 0) OR (p16 <= 0)) AND (((p9 <= 0) OR (p15 <= 0)) AND (((p6 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p19 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p7 <= 0) OR (p18 <= 0)) AND ((p5 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p19 <= 0)))
lola: processed formula length: 152
lola: 143 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 10 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) AND G ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12))))))) U (((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) AND G ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12))))))) U (((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1... (shortened)
lola: processed formula length: 488
lola: 136 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: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((X ((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)))) AND F ((((p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)))))))) OR (((1 <= p8) AND (1 <= p13)) OR (((1 <= p9) AND (1 <= p14)) OR (((1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p8) AND (1 <= p13)) OR (((1 <= p9) AND (1 <= p14)) OR (((1 <= p5) AND (1 <= p10)) OR (((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12))))))
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: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))
lola: processed formula length: 148
lola: 143 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 10 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X ((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)))) AND F ((((p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p9 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X ((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)))) AND F ((((p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p9 <= 0))))))))
lola: processed formula length: 326
lola: 136 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND (p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)) OR (G ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24)) U ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24)) U ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)))
lola: processed formula length: 149
lola: 136 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND (p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)) OR (G ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND (p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)) OR (G ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <... (shortened)
lola: processed formula length: 786
lola: 136 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: 20 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((X (G ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))))) U (((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) U X ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((X (G ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))))) U (((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) U X ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <... (shortened)
lola: processed formula length: 790
lola: 136 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 28 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: 28 markings, 29 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((X ((G ((((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))) AND (((p0 <= 0) OR (p5 <= 0)) AND (((p4 <= 0) OR (p9 <= 0)) AND (((p1 <= 0) OR (p6 <= 0)) AND (((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))))))) AND (((p4 <= 0) OR (p8 <= 0)) AND (((p1 <= 0) OR (p5 <= 0)) AND (((p3 <= 0) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))))
lola: processed formula length: 151
lola: 136 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, 17 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((G ((((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))) AND (((p0 <= 0) OR (p5 <= 0)) AND (((p4 <= 0) OR (p9 <= 0)) AND (((p1 <= 0) OR (p6 <= 0)) AND (((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))))))) AND (((p4 <= 0) OR (p8 <= 0)) AND (((p1 <= 0) OR (p5 <= 0)) AND (((p3 <= 0) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((G ((((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))) AND (((p0 <= 0) OR (p5 <= 0)) AND (((p4 <= 0) OR (p9 <= 0)) AND (((p1 <= 0) OR (p6 <= 0)) AND (((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))))))) AND (((p4 <= 0) OR (p8 <= 0)) AND (((p1 <= 0) OR (p5 <= 0)) AND (((p3 <= 0) OR... (shortened)
lola: processed formula length: 479
lola: 136 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: 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0)) AND (F (G ((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0))))) OR X (((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))) U (X ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 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) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)))))
lola: processed formula length: 160
lola: 136 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: 50 markings, 80 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0))
lola: processed formula length: 72
lola: 136 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))) U (X ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) OR ((1 <= p20) OR ((1 <= p21) OR ((1 <= p22) OR ((1 <= p23) OR (1 <= p24))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))) U (X ((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) OR ((1 <= p20) OR ((1 <= p21) OR ((1 <= p22) OR ((1 <= p23) OR (1 <= p24))))))))
lola: processed formula length: 392
lola: 136 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: 16 markings, 16 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: lola: ========================================
========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p8 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0))))))
lola: processed formula length: 164
lola: 136 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: 37 markings, 55 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24))))
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 (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24))))
lola: processed formula length: 80
lola: 136 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: 60 markings, 82 edges
lola: ========================================
lola: subprocess 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9)))))
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 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9)))))
lola: processed formula length: 155
lola: 136 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: 32 markings, 50 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) AND (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))) U G (((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)))) AND (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))) U G (((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (... (shortened)
lola: processed formula length: 787
lola: 136 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 11 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))) OR (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((((1 <= p8) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19))) OR (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1... (shortened)
lola: processed formula length: 790
lola: 136 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: 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: 22 markings, 29 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no
lola: memory consumption: 82980 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="Philosophers-COL-000005"
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 Philosophers-COL-000005, 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 r176-tajo-158987871200002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000005.tgz
mv Philosophers-COL-000005 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 ;