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.r265-tall-162106800700390.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 SwimmingPool-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800700390
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 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 SwimmingPool-PT-09-00
FORMULA_NAME SwimmingPool-PT-09-01
FORMULA_NAME SwimmingPool-PT-09-02
FORMULA_NAME SwimmingPool-PT-09-03
FORMULA_NAME SwimmingPool-PT-09-04
FORMULA_NAME SwimmingPool-PT-09-05
FORMULA_NAME SwimmingPool-PT-09-06
FORMULA_NAME SwimmingPool-PT-09-07
FORMULA_NAME SwimmingPool-PT-09-08
FORMULA_NAME SwimmingPool-PT-09-09
FORMULA_NAME SwimmingPool-PT-09-10
FORMULA_NAME SwimmingPool-PT-09-11
FORMULA_NAME SwimmingPool-PT-09-12
FORMULA_NAME SwimmingPool-PT-09-13
FORMULA_NAME SwimmingPool-PT-09-14
FORMULA_NAME SwimmingPool-PT-09-15

=== Now, execution of the tool begins

BK_START 1621227504449

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 04:58:26] [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-17 04:58:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:58:26] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-17 04:58:26] [INFO ] Transformed 9 places.
[2021-05-17 04:58:26] [INFO ] Transformed 7 transitions.
[2021-05-17 04:58:26] [INFO ] Parsed PT model containing 9 places and 7 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 1229 steps, including 0 resets, run visited all 21 properties in 5 ms. (steps per millisecond=245 )
[2021-05-17 04:58:26] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-17 04:58:26] [INFO ] Flatten gal took : 21 ms
FORMULA SwimmingPool-PT-09-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:58:26] [INFO ] Flatten gal took : 3 ms
[2021-05-17 04:58:26] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-17 04:58:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SwimmingPool-PT-09 @ 3570 seconds

FORMULA SwimmingPool-PT-09-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SwimmingPool-PT-09-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2332
rslt: Output for LTLFireability @ SwimmingPool-PT-09

{
"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": "Mon May 17 04:58:27 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((G (((1 <= p3) AND (1 <= p7))) OR ((p0 <= 0) OR ((p7 <= 0) OR (p5 <= 0))))))",
"processed_size": 82,
"rewrites": 110
},
"result":
{
"edges": 193,
"markings": 193,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((1 <= p4)))",
"processed_size": 17,
"rewrites": 110
},
"result":
{
"edges": 149063280,
"markings": 60282886,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 314
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 314
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "X ((F ((p5 <= 0)) OR (p2 <= 0)))",
"processed_size": 32,
"rewrites": 110
},
"result":
{
"edges": 1,
"markings": 2,
"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": 346
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p3) AND (1 <= p7))",
"processed_size": 25,
"rewrites": 110
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 384
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((p2 <= 0)))",
"processed_size": 17,
"rewrites": 110
},
"result":
{
"edges": 190,
"markings": 190,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 346
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((G ((1 <= p4)) AND X ((X ((1 <= p4)) AND (1 <= p4))))))",
"processed_size": 61,
"rewrites": 110
},
"result":
{
"edges": 189,
"markings": 188,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 384
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((p6 <= 0)) OR (F (G (((1 <= p3) AND (1 <= p7)))) AND G ((F ((1 <= p6)) OR G (((1 <= p3) AND (1 <= p7))))))))",
"processed_size": 115,
"rewrites": 110
},
"result":
{
"edges": 198,
"markings": 197,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 432
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p6) OR ((1 <= p0) AND (1 <= p7)))) OR (p4 <= 0)))",
"processed_size": 64,
"rewrites": 110
},
"result":
{
"edges": 186676,
"markings": 81985,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 494
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((G (((p0 <= 0) OR (p7 <= 0))) OR F ((G ((p6 <= 0)) OR ((p6 <= 0) AND X ((p6 <= 0))))))))",
"processed_size": 95,
"rewrites": 110
},
"result":
{
"edges": 229,
"markings": 212,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 581
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 6,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (F ((G ((p5 <= 0)) OR (((p0 <= 0) OR (p7 <= 0)) AND (p5 <= 0))))) OR (X (F ((G ((p5 <= 0)) OR (((p0 <= 0) OR (p7 <= 0)) AND (p5 <= 0))))) AND F (G ((1 <= p5))))))",
"processed_size": 170,
"rewrites": 110
},
"result":
{
"edges": 195,
"markings": 193,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 726
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 726
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p1) AND (1 <= p8) AND (1 <= p3) AND (1 <= p7))",
"processed_size": 53,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 968
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p3) AND (1 <= p7)) R (X (((p1 <= 0) OR (p8 <= 0))) OR ((p1 <= 0) OR (p8 <= 0))))",
"processed_size": 89,
"rewrites": 110
},
"result":
{
"edges": 197,
"markings": 197,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 968
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((p3 <= 0) OR (p7 <= 0))))",
"processed_size": 33,
"rewrites": 110
},
"result":
{
"edges": 202,
"markings": 199,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1453
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p3) AND (1 <= p7))) AND F (G ((1 <= p2))))))",
"processed_size": 88,
"rewrites": 110
},
"result":
{
"edges": 5412069,
"markings": 2058845,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 2902
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((((((1 <= p0) AND (1 <= p7)) OR (1 <= p4)) U (1 <= p4)) AND (p6 <= 0))))",
"processed_size": 79,
"rewrites": 110
},
"result":
{
"edges": 1756,
"markings": 1755,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"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": 3444,
"runtime": 1238.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((G(**) OR (** OR (** OR **))))) : F((** OR (F(**) AND F(G(**))))) : X(F(**)) : (X((F(*) OR *)) AND (X(G(*)) OR **)) : F(G((G(*) AND X((X(**) AND **))))) : X((F(**) OR (F(G(**)) AND G((F(**) OR G(**)))))) : G((X(**) OR **)) : X(G((G(*) OR F((G(*) OR (* AND X(*))))))) : G(F(*)) : X(G(((F(**) U **) OR F((G(**) OR **))))) : F(G(((** U **) AND *))) : F((X(F((G(*) OR (* AND *)))) OR (X(F((G(*) OR (* AND *)))) AND F(G(**))))) : (F(*) AND (* R (X(*) OR (* OR *))))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no yes yes no no no no no no unknown no no no ",
"value": "no yes yes no no no no no no unknown 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: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 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: G (X ((((G (((1 <= p3) AND (1 <= p7))) OR (p0 <= 0)) OR (p7 <= 0)) OR (p5 <= 0)))) : F ((F (G (F (G (F ((((1 <= p3) AND (1 <= p7)) U G ((1 <= p2)))))))) U ((1 <= p3) AND (1 <= p7)))) : X (F ((1 <= p4))) : (NOT(X ((G ((1 <= p5)) AND (1 <= p2)))) AND (NOT(F (X ((((1 <= p3) AND (1 <= p7)) U (1 <= p2))))) OR ((1 <= p3) AND (1 <= p7)))) : F (G (X ((NOT(F ((p4 <= 0))) AND X ((X ((1 <= p4)) AND (1 <= p4))))))) : X ((F ((p6 <= 0)) OR NOT(F (NOT((F ((1 <= p6)) U G (((1 <= p3) AND (1 <= p7))))))))) : G ((X (((1 <= p6) OR ((1 <= p0) AND (1 <= p7)))) OR (p4 <= 0))) : X (NOT(F (((1 <= p4) U (F ((((1 <= p1) AND (1 <= p8)) U ((1 <= p0) AND (1 <= p7)))) AND G (((1 <= p6) U X ((1 <= p6))))))))) : F (NOT((F (X (F (X ((1 <= p5))))) U G (F (G (F (X (G (((1 <= p3) AND (1 <= p7))))))))))) : G (X (((F ((1 <= p6)) U (((p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)))) OR F ((G ((1 <= p6)) OR (1 <= p6)))))) : X (NOT(G (F ((NOT(((((1 <= p0) AND (1 <= p7)) OR (1 <= p4)) U (1 <= p4))) OR (1 <= p6)))))) : F ((X (((p6 <= 0) U F (G ((1 <= p5))))) U NOT(G (X ((((1 <= p0) AND (1 <= p7)) U (1 <= p5))))))) : (NOT(G (((1 <= p1) AND (1 <= p8) AND (1 <= p3) AND (1 <= p7)))) AND NOT((((p3 <= 0) OR (p7 <= 0)) U ((X (((1 <= p1) AND (1 <= p8))) AND (1 <= p1)) AND (1 <= p8)))))
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:338
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:329
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:318
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((1 <= p3) AND (1 <= p7))) OR ((p0 <= 0) OR ((p7 <= 0) OR (p5 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((1 <= p3) AND (1 <= p7))) OR ((p0 <= 0) OR ((p7 <= 0) OR (p5 <= 0))))))
lola: processed formula length: 82
lola: 110 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: 193 markings, 193 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p4)))
lola: processed formula length: 17
lola: 110 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: 3345411 markings, 7874266 edges, 669082 markings/sec, 0 secs
lola: 6171938 markings, 14893194 edges, 565305 markings/sec, 5 secs
lola: 9085485 markings, 22128828 edges, 582709 markings/sec, 10 secs
lola: 11934306 markings, 29202509 edges, 569764 markings/sec, 15 secs
lola: 14668431 markings, 35991878 edges, 546825 markings/sec, 20 secs
lola: 17448645 markings, 42894232 edges, 556043 markings/sec, 25 secs
lola: 20162711 markings, 49633158 edges, 542813 markings/sec, 30 secs
lola: 22911431 markings, 56456124 edges, 549744 markings/sec, 35 secs
lola: 25596669 markings, 63121805 edges, 537048 markings/sec, 40 secs
lola: 28246687 markings, 69698815 edges, 530004 markings/sec, 45 secs
lola: 30922819 markings, 76339268 edges, 535226 markings/sec, 50 secs
lola: 34058851 markings, 84118323 edges, 627206 markings/sec, 55 secs
lola: 36707270 markings, 90687707 edges, 529684 markings/sec, 60 secs
lola: 39358464 markings, 97261468 edges, 530239 markings/sec, 65 secs
lola: 42036325 markings, 103901673 edges, 535572 markings/sec, 70 secs
lola: 44745899 markings, 110620780 edges, 541915 markings/sec, 75 secs
lola: 47508984 markings, 117473257 edges, 552617 markings/sec, 80 secs
lola: 50333140 markings, 124470856 edges, 564831 markings/sec, 85 secs
lola: 53232530 markings, 131655632 edges, 579878 markings/sec, 90 secs
lola: 56258806 markings, 139143446 edges, 605255 markings/sec, 95 secs
lola: 59446782 markings, 147015414 edges, 637595 markings/sec, 100 secs
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: 60282886 markings, 149063280 edges
lola: ========================================
lola: subprocess 2 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((p5 <= 0)) OR (p2 <= 0))) AND (X (G ((p2 <= 0))) OR ((1 <= p3) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p5 <= 0)) OR (p2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p5 <= 0)) OR (p2 <= 0)))
lola: processed formula length: 32
lola: 110 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: subprocess 3 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (1 <= p7))
lola: processed formula length: 25
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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 4 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p2 <= 0)))
lola: processed formula length: 17
lola: 110 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 190 markings, 190 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 3 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((1 <= p4)) AND X ((X ((1 <= p4)) AND (1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((1 <= p4)) AND X ((X ((1 <= p4)) AND (1 <= p4))))))
lola: processed formula length: 61
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 188 markings, 189 edges
lola: ========================================
lola: subprocess 4 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p6 <= 0)) OR (F (G (((1 <= p3) AND (1 <= p7)))) AND G ((F ((1 <= p6)) OR G (((1 <= p3) AND (1 <= p7))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p6 <= 0)) OR (F (G (((1 <= p3) AND (1 <= p7)))) AND G ((F ((1 <= p6)) OR G (((1 <= p3) AND (1 <= p7))))))))
lola: processed formula length: 115
lola: 110 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: 197 markings, 198 edges
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p6) OR ((1 <= p0) AND (1 <= p7)))) OR (p4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p6) OR ((1 <= p0) AND (1 <= p7)))) OR (p4 <= 0)))
lola: processed formula length: 64
lola: 110 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 81985 markings, 186676 edges
lola: ========================================
lola: subprocess 6 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((p0 <= 0) OR (p7 <= 0))) OR F ((G ((p6 <= 0)) OR ((p6 <= 0) AND X ((p6 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((p0 <= 0) OR (p7 <= 0))) OR F ((G ((p6 <= 0)) OR ((p6 <= 0) AND X ((p6 <= 0))))))))
lola: processed formula length: 95
lola: 110 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: 212 markings, 229 edges
lola: ========================================
lola: subprocess 7 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((F ((1 <= p6)) U (((p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)))) OR F ((G ((1 <= p6)) OR (1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F ((1 <= p6)) U (((p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)))) OR F ((G ((1 <= p6)) OR (1 <= p6))))))
lola: processed formula length: 121
lola: 110 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: 2051184 markings, 10290528 edges, 410237 markings/sec, 0 secs
lola: 3904834 markings, 20162637 edges, 370730 markings/sec, 5 secs
lola: 5722479 markings, 29861740 edges, 363529 markings/sec, 10 secs
lola: 7451794 markings, 39290436 edges, 345863 markings/sec, 15 secs
lola: 9189411 markings, 48684181 edges, 347523 markings/sec, 20 secs
lola: 10872256 markings, 57883496 edges, 336569 markings/sec, 25 secs
lola: 12526987 markings, 66970202 edges, 330946 markings/sec, 30 secs
lola: 14163096 markings, 75971432 edges, 327222 markings/sec, 35 secs
lola: 15743801 markings, 84838557 edges, 316141 markings/sec, 40 secs
lola: 17325500 markings, 93580353 edges, 316340 markings/sec, 45 secs
lola: 18940738 markings, 102435425 edges, 323048 markings/sec, 50 secs
lola: 20542970 markings, 111285805 edges, 320446 markings/sec, 55 secs
lola: 22045564 markings, 119771370 edges, 300519 markings/sec, 60 secs
lola: 23658578 markings, 128613446 edges, 322603 markings/sec, 65 secs
lola: 25134075 markings, 137026698 edges, 295099 markings/sec, 70 secs
lola: 26727136 markings, 145730339 edges, 318612 markings/sec, 75 secs
lola: 28194690 markings, 154119672 edges, 293511 markings/sec, 80 secs
lola: 29786858 markings, 162809130 edges, 318434 markings/sec, 85 secs
lola: 31223769 markings, 171024932 edges, 287382 markings/sec, 90 secs
lola: 32826057 markings, 179796716 edges, 320458 markings/sec, 95 secs
lola: 34255918 markings, 187932792 edges, 285972 markings/sec, 100 secs
lola: 35788760 markings, 196584536 edges, 306568 markings/sec, 105 secs
lola: 37275830 markings, 204782880 edges, 297414 markings/sec, 110 secs
lola: 38695703 markings, 212930387 edges, 283975 markings/sec, 115 secs
lola: 40295229 markings, 221691871 edges, 319905 markings/sec, 120 secs
lola: 41673995 markings, 229514761 edges, 275753 markings/sec, 125 secs
lola: 42989562 markings, 237079914 edges, 263113 markings/sec, 130 secs
lola: 44512632 markings, 245408737 edges, 304614 markings/sec, 135 secs
lola: 45895204 markings, 253245697 edges, 276514 markings/sec, 140 secs
lola: 47260564 markings, 261091274 edges, 273072 markings/sec, 145 secs
lola: 48800158 markings, 269623698 edges, 307919 markings/sec, 150 secs
lola: 50239996 markings, 277685145 edges, 287968 markings/sec, 155 secs
lola: 51613164 markings, 285565030 edges, 274634 markings/sec, 160 secs
lola: 53044826 markings, 293843532 edges, 286332 markings/sec, 165 secs
lola: 54614373 markings, 302328345 edges, 313909 markings/sec, 170 secs
lola: 55985155 markings, 310154133 edges, 274156 markings/sec, 175 secs
lola: 57364524 markings, 318107184 edges, 275874 markings/sec, 180 secs
lola: 58857303 markings, 326635394 edges, 298556 markings/sec, 185 secs
lola: 60344930 markings, 334702687 edges, 297525 markings/sec, 190 secs
lola: 61697738 markings, 342455370 edges, 270562 markings/sec, 195 secs
lola: 63076705 markings, 350415187 edges, 275793 markings/sec, 200 secs
lola: 64542480 markings, 358848336 edges, 293155 markings/sec, 205 secs
lola: 66049118 markings, 366956651 edges, 301328 markings/sec, 210 secs
lola: 67395603 markings, 374669775 edges, 269297 markings/sec, 215 secs
lola: 68751080 markings, 382491571 edges, 271095 markings/sec, 220 secs
lola: 70157889 markings, 390643721 edges, 281362 markings/sec, 225 secs
lola: 71729308 markings, 399122771 edges, 314284 markings/sec, 230 secs
lola: 73083618 markings, 406835339 edges, 270862 markings/sec, 235 secs
lola: 74409548 markings, 414472900 edges, 265186 markings/sec, 240 secs
lola: 75774414 markings, 422365938 edges, 272973 markings/sec, 245 secs
lola: 77209080 markings, 430698742 edges, 286933 markings/sec, 250 secs
lola: 78741701 markings, 438872458 edges, 306524 markings/sec, 255 secs
lola: 80068278 markings, 446459704 edges, 265315 markings/sec, 260 secs
lola: 81389879 markings, 454082094 edges, 264320 markings/sec, 265 secs
lola: 82743481 markings, 461921456 edges, 270720 markings/sec, 270 secs
lola: 84160063 markings, 470153707 edges, 283316 markings/sec, 275 secs
lola: 85699503 markings, 478366800 edges, 307888 markings/sec, 280 secs
lola: 87021220 markings, 485921072 edges, 264343 markings/sec, 285 secs
lola: 88329285 markings, 493462553 edges, 261613 markings/sec, 290 secs
lola: 89640534 markings, 501055081 edges, 262250 markings/sec, 295 secs
lola: 90989695 markings, 508884163 edges, 269832 markings/sec, 300 secs
lola: 92559427 markings, 517400482 edges, 313946 markings/sec, 305 secs
lola: 93910832 markings, 525039974 edges, 270281 markings/sec, 310 secs
lola: 95230792 markings, 532625314 edges, 263992 markings/sec, 315 secs
lola: 96524972 markings, 540107594 edges, 258836 markings/sec, 320 secs
lola: 97862305 markings, 547861049 edges, 267467 markings/sec, 325 secs
lola: 99239318 markings, 555868552 edges, 275403 markings/sec, 330 secs
lola: 100822875 markings, 564388393 edges, 316711 markings/sec, 335 secs
lola: 102144635 markings, 571894859 edges, 264352 markings/sec, 340 secs
lola: 103456389 markings, 579440000 edges, 262351 markings/sec, 345 secs
lola: 104749721 markings, 586921206 edges, 258666 markings/sec, 350 secs
lola: 106061330 markings, 594534692 edges, 262322 markings/sec, 355 secs
lola: 107431311 markings, 602493301 edges, 273996 markings/sec, 360 secs
lola: 108989353 markings, 610974958 edges, 311608 markings/sec, 365 secs
lola: 110361336 markings, 618687922 edges, 274397 markings/sec, 370 secs
lola: 111649271 markings, 626084059 edges, 257587 markings/sec, 375 secs
lola: 112940808 markings, 633542876 edges, 258307 markings/sec, 380 secs
lola: 114099111 markings, 640259518 edges, 231661 markings/sec, 385 secs
lola: 115312105 markings, 647307169 edges, 242599 markings/sec, 390 secs
lola: 116574578 markings, 654653701 edges, 252495 markings/sec, 395 secs
lola: 118057545 markings, 662681305 edges, 296593 markings/sec, 400 secs
lola: 119328939 markings, 669819666 edges, 254279 markings/sec, 405 secs
lola: 120502589 markings, 676551681 edges, 234730 markings/sec, 410 secs
lola: 121669494 markings, 683283748 edges, 233381 markings/sec, 415 secs
lola: 122389882 markings, 687454592 edges, 144078 markings/sec, 420 secs
lola: 123528828 markings, 694062978 edges, 227789 markings/sec, 425 secs
lola: 124716302 markings, 700965744 edges, 237495 markings/sec, 430 secs
lola: 125891864 markings, 707814796 edges, 235112 markings/sec, 435 secs
lola: 127128899 markings, 714919855 edges, 247407 markings/sec, 440 secs
lola: 128038798 markings, 719571358 edges, 181980 markings/sec, 445 secs
lola: 128796407 markings, 723855132 edges, 151522 markings/sec, 450 secs
lola: 129905261 markings, 730207065 edges, 221771 markings/sec, 455 secs
lola: 130736561 markings, 734994440 edges, 166260 markings/sec, 460 secs
lola: 131803548 markings, 741168313 edges, 213397 markings/sec, 465 secs
lola: 132775579 markings, 746803115 edges, 194406 markings/sec, 470 secs
lola: 133986593 markings, 753839839 edges, 242203 markings/sec, 475 secs
lola: 135268213 markings, 761298526 edges, 256324 markings/sec, 480 secs
lola: 136536852 markings, 768698744 edges, 253728 markings/sec, 485 secs
lola: 137755405 markings, 775246062 edges, 243711 markings/sec, 490 secs
lola: 138630475 markings, 780047099 edges, 175014 markings/sec, 495 secs
lola: 139653190 markings, 785881274 edges, 204543 markings/sec, 500 secs
lola: 140759224 markings, 792244919 edges, 221207 markings/sec, 505 secs
lola: 141814687 markings, 798344301 edges, 211093 markings/sec, 510 secs
lola: 142941085 markings, 804875949 edges, 225280 markings/sec, 515 secs
lola: 144063854 markings, 811398222 edges, 224554 markings/sec, 520 secs
lola: 145206059 markings, 818050248 edges, 228441 markings/sec, 525 secs
lola: 146322272 markings, 824549114 edges, 223243 markings/sec, 530 secs
lola: 147416186 markings, 830930919 edges, 218783 markings/sec, 535 secs
lola: 148616719 markings, 837267193 edges, 240107 markings/sec, 540 secs
lola: 149801282 markings, 843903402 edges, 236913 markings/sec, 545 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((G ((p5 <= 0)) OR (((p0 <= 0) OR (p7 <= 0)) AND (p5 <= 0))))) OR (X (F ((G ((p5 <= 0)) OR (((p0 <= 0) OR (p7 <= 0)) AND (p5 <= 0))))) AND F (G ((1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((G ((p5 <= 0)) OR (((p0 <= 0) OR (p7 <= 0)) AND (p5 <= 0))))) OR (X (F ((G ((p5 <= 0)) OR (((p0 <= 0) OR (p7 <= 0)) AND (p5 <= 0))))) AND F (G ((1 <= p5))))))
lola: processed formula length: 170
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 193 markings, 195 edges
lola: ========================================
lola: subprocess 9 will run for 726 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p1 <= 0) OR (p8 <= 0) OR (p3 <= 0) OR (p7 <= 0))) AND (((1 <= p3) AND (1 <= p7)) R (X (((p1 <= 0) OR (p8 <= 0))) OR ((p1 <= 0) OR (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 726 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p1 <= 0) OR (p8 <= 0) OR (p3 <= 0) OR (p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p1) AND (1 <= p8) AND (1 <= p3) AND (1 <= p7))
lola: processed formula length: 53
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 968 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p3) AND (1 <= p7)) R (X (((p1 <= 0) OR (p8 <= 0))) OR ((p1 <= 0) OR (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p3) AND (1 <= p7)) R (X (((p1 <= 0) OR (p8 <= 0))) OR ((p1 <= 0) OR (p8 <= 0))))
lola: processed formula length: 89
lola: 110 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 197 markings, 197 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 968 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p3 <= 0) OR (p7 <= 0))))
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 (((p3 <= 0) OR (p7 <= 0))))
lola: processed formula length: 33
lola: 110 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: 199 markings, 202 edges
lola: ========================================
lola: subprocess 11 will run for 1453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p3) AND (1 <= p7))) AND F (G ((1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p3) AND (1 <= p7))) AND F (G ((1 <= p2))))))
lola: processed formula length: 88
lola: 110 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: 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: 2058845 markings, 5412069 edges
lola: ========================================
lola: subprocess 12 will run for 2902 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((((1 <= p0) AND (1 <= p7)) OR (1 <= p4)) U (1 <= p4)) AND (p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((((1 <= p0) AND (1 <= p7)) OR (1 <= p4)) U (1 <= p4)) AND (p6 <= 0))))
lola: processed formula length: 79
lola: 110 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: 1755 markings, 1756 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G (((F ((1 <= p6)) U (((p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)))) OR F ((G ((1 <= p6)) OR (1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F ((1 <= p6)) U (((p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)))) OR F ((G ((1 <= p6)) OR (1 <= p6))))))
lola: processed formula length: 121
lola: 110 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: 2028753 markings, 10169277 edges, 405751 markings/sec, 0 secs
lola: 3826827 markings, 19725804 edges, 359615 markings/sec, 5 secs
lola: 5564390 markings, 29098924 edges, 347513 markings/sec, 10 secs
lola: 7255538 markings, 38185923 edges, 338230 markings/sec, 15 secs
lola: 8878024 markings, 47103559 edges, 324497 markings/sec, 20 secs
lola: 10503710 markings, 55946855 edges, 325137 markings/sec, 25 secs
lola: 12072752 markings, 64572021 edges, 313808 markings/sec, 30 secs
lola: 13591130 markings, 72988990 edges, 303676 markings/sec, 35 secs
lola: 15121970 markings, 81372427 edges, 306168 markings/sec, 40 secs
lola: 16653138 markings, 89757831 edges, 306234 markings/sec, 45 secs
lola: 18182018 markings, 98188975 edges, 305776 markings/sec, 50 secs
lola: 19601502 markings, 106196870 edges, 283897 markings/sec, 55 secs
lola: 21125938 markings, 114539456 edges, 304887 markings/sec, 60 secs
lola: 22527704 markings, 122532272 edges, 280353 markings/sec, 65 secs
lola: 24024652 markings, 130686935 edges, 299390 markings/sec, 70 secs
lola: 25429112 markings, 138724684 edges, 280892 markings/sec, 75 secs
lola: 26904838 markings, 146740939 edges, 295145 markings/sec, 80 secs
lola: 28280547 markings, 154615987 edges, 275142 markings/sec, 85 secs
lola: 29780399 markings, 162772122 edges, 299970 markings/sec, 90 secs
lola: 31111287 markings, 170375369 edges, 266178 markings/sec, 95 secs
lola: 32629147 markings, 178693653 edges, 303572 markings/sec, 100 secs
lola: 33945326 markings, 186154762 edges, 263236 markings/sec, 105 secs
lola: 35307729 markings, 193988293 edges, 272481 markings/sec, 110 secs
lola: 36799642 markings, 202072638 edges, 298383 markings/sec, 115 secs
lola: 38094532 markings, 209468090 edges, 258978 markings/sec, 120 secs
lola: 39468471 markings, 217388842 edges, 274788 markings/sec, 125 secs
lola: 40937361 markings, 225312228 edges, 293778 markings/sec, 130 secs
lola: 42293046 markings, 233068556 edges, 271137 markings/sec, 135 secs
lola: 43721670 markings, 241313075 edges, 285725 markings/sec, 140 secs
lola: 45179062 markings, 249157713 edges, 291478 markings/sec, 145 secs
lola: 46450849 markings, 256432669 edges, 254357 markings/sec, 150 secs
lola: 47770695 markings, 264043018 edges, 263969 markings/sec, 155 secs
lola: 49269854 markings, 272190749 edges, 299832 markings/sec, 160 secs
lola: 50546604 markings, 279436829 edges, 255350 markings/sec, 165 secs
lola: 51820371 markings, 286764910 edges, 254753 markings/sec, 170 secs
lola: 53252153 markings, 295041323 edges, 286356 markings/sec, 175 secs
lola: 54748927 markings, 303091334 edges, 299355 markings/sec, 180 secs
lola: 56008105 markings, 310286563 edges, 251836 markings/sec, 185 secs
lola: 57279258 markings, 317612906 edges, 254231 markings/sec, 190 secs
lola: 58723496 markings, 325977197 edges, 288848 markings/sec, 195 secs
lola: 60252844 markings, 334180114 edges, 305870 markings/sec, 200 secs
lola: 61571720 markings, 341726974 edges, 263775 markings/sec, 205 secs
lola: 62915683 markings, 349480527 edges, 268793 markings/sec, 210 secs
lola: 64341467 markings, 357741900 edges, 285157 markings/sec, 215 secs
lola: 65892798 markings, 366067462 edges, 310266 markings/sec, 220 secs
lola: 67155723 markings, 373290095 edges, 252585 markings/sec, 225 secs
lola: 68395103 markings, 380432778 edges, 247876 markings/sec, 230 secs
lola: 69678534 markings, 387861157 edges, 256686 markings/sec, 235 secs
lola: 71164433 markings, 395992225 edges, 297180 markings/sec, 240 secs
lola: 72450559 markings, 403214969 edges, 257225 markings/sec, 245 secs
lola: 73684055 markings, 410284884 edges, 246699 markings/sec, 250 secs
lola: 74912164 markings, 417376002 edges, 245622 markings/sec, 255 secs
lola: 76186955 markings, 424759391 edges, 254958 markings/sec, 260 secs
lola: 77638508 markings, 432797036 edges, 290311 markings/sec, 265 secs
lola: 78965447 markings, 440143781 edges, 265388 markings/sec, 270 secs
lola: 80190542 markings, 447166557 edges, 245019 markings/sec, 275 secs
lola: 81398431 markings, 454131647 edges, 241578 markings/sec, 280 secs
lola: 82623060 markings, 461228028 edges, 244926 markings/sec, 285 secs
lola: 83930529 markings, 468814205 edges, 261494 markings/sec, 290 secs
lola: 85407594 markings, 476718382 edges, 295413 markings/sec, 295 secs
lola: 86625946 markings, 483652781 edges, 243670 markings/sec, 300 secs
lola: 87830991 markings, 490586764 edges, 241009 markings/sec, 305 secs
lola: 89024622 markings, 497486772 edges, 238726 markings/sec, 310 secs
lola: 90270172 markings, 504706378 edges, 249110 markings/sec, 315 secs
lola: 91576602 markings, 512300004 edges, 261286 markings/sec, 320 secs
lola: 93043838 markings, 520111213 edges, 293447 markings/sec, 325 secs
lola: 94250836 markings, 526986176 edges, 241400 markings/sec, 330 secs
lola: 95468434 markings, 533995635 edges, 243520 markings/sec, 335 secs
lola: 96664765 markings, 540913410 edges, 239266 markings/sec, 340 secs
lola: 97860919 markings, 547853446 edges, 239231 markings/sec, 345 secs
lola: 99122478 markings, 555186349 edges, 252312 markings/sec, 350 secs
lola: 100613375 markings, 563222504 edges, 298179 markings/sec, 355 secs
lola: 101855777 markings, 570243808 edges, 248480 markings/sec, 360 secs
lola: 103040519 markings, 577044085 edges, 236948 markings/sec, 365 secs
lola: 104215703 markings, 583831777 edges, 235037 markings/sec, 370 secs
lola: 105365591 markings, 590489369 edges, 229978 markings/sec, 375 secs
lola: 106576553 markings, 597522873 edges, 242192 markings/sec, 380 secs
lola: 107840268 markings, 604882735 edges, 252743 markings/sec, 385 secs
lola: 109352251 markings, 612971168 edges, 302397 markings/sec, 390 secs
lola: 110562498 markings, 619839392 edges, 242049 markings/sec, 395 secs
lola: 111737359 markings, 626588089 edges, 234972 markings/sec, 400 secs
lola: 112912108 markings, 633376144 edges, 234950 markings/sec, 405 secs
lola: 114080932 markings, 640153451 edges, 233765 markings/sec, 410 secs
lola: 115323560 markings, 647373916 edges, 248526 markings/sec, 415 secs
lola: 116609704 markings, 654858522 edges, 257229 markings/sec, 420 secs
lola: 118117575 markings, 663003861 edges, 301574 markings/sec, 425 secs
lola: 119400406 markings, 670225040 edges, 256566 markings/sec, 430 secs
lola: 120607866 markings, 677154706 edges, 241492 markings/sec, 435 secs
lola: 122050700 markings, 685492581 edges, 288567 markings/sec, 440 secs
lola: 123245015 markings, 692417508 edges, 238863 markings/sec, 445 secs
lola: 124475498 markings, 699567770 edges, 246097 markings/sec, 450 secs
lola: 125733365 markings, 706891509 edges, 251573 markings/sec, 455 secs
lola: 127051402 markings, 714543049 edges, 263607 markings/sec, 460 secs
lola: 127896837 markings, 718780617 edges, 169087 markings/sec, 465 secs
lola: 128884769 markings, 724357034 edges, 197586 markings/sec, 470 secs
lola: 130114128 markings, 731408516 edges, 245872 markings/sec, 475 secs
lola: 131267183 markings, 738059252 edges, 230611 markings/sec, 480 secs
lola: 132502363 markings, 745219319 edges, 247036 markings/sec, 485 secs
lola: 133682474 markings, 752073454 edges, 236022 markings/sec, 490 secs
lola: 134933271 markings, 759350522 edges, 250159 markings/sec, 495 secs
lola: 136233261 markings, 766923250 edges, 259998 markings/sec, 500 secs
lola: 137617096 markings, 774574518 edges, 276767 markings/sec, 505 secs
lola: 138914178 markings, 781654994 edges, 259416 markings/sec, 510 secs
lola: 140017170 markings, 787970346 edges, 220598 markings/sec, 515 secs
lola: 141161528 markings, 794565073 edges, 228872 markings/sec, 520 secs
lola: 142415016 markings, 801820883 edges, 250698 markings/sec, 525 secs
lola: 143622888 markings, 808834660 edges, 241574 markings/sec, 530 secs
lola: 144772652 markings, 815518068 edges, 229953 markings/sec, 535 secs
lola: 145961718 markings, 822450024 edges, 237813 markings/sec, 540 secs
lola: 147148288 markings, 829373088 edges, 237314 markings/sec, 545 secs
lola: 148416750 markings, 836295395 edges, 253692 markings/sec, 550 secs
lola: 149641346 markings, 842994100 edges, 244919 markings/sec, 555 secs
lola: 150207715 markings, 846228305 edges, 113274 markings/sec, 560 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes yes no no no no no no unknown no no no
lola:
preliminary result: no yes yes no no no no no no unknown no no no
lola: memory consumption: 3444 KB
lola: time consumption: 1238 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="SwimmingPool-PT-09"
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 SwimmingPool-PT-09, 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 r265-tall-162106800700390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-09.tgz
mv SwimmingPool-PT-09 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 ;