About the Execution of 2020-gold for Referendum-COL-0015
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8578.327 | 3600000.00 | 1263682.00 | 2332.10 | TFTFTTFTFTFFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432700230.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Referendum-COL-0015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432700230
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.7K May 5 16:51 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 Referendum-COL-0015-00
FORMULA_NAME Referendum-COL-0015-01
FORMULA_NAME Referendum-COL-0015-02
FORMULA_NAME Referendum-COL-0015-03
FORMULA_NAME Referendum-COL-0015-04
FORMULA_NAME Referendum-COL-0015-05
FORMULA_NAME Referendum-COL-0015-06
FORMULA_NAME Referendum-COL-0015-07
FORMULA_NAME Referendum-COL-0015-08
FORMULA_NAME Referendum-COL-0015-09
FORMULA_NAME Referendum-COL-0015-10
FORMULA_NAME Referendum-COL-0015-11
FORMULA_NAME Referendum-COL-0015-12
FORMULA_NAME Referendum-COL-0015-13
FORMULA_NAME Referendum-COL-0015-14
FORMULA_NAME Referendum-COL-0015-15
=== Now, execution of the tool begins
BK_START 1621425182380
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 11:53:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 11:53:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 11:53:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-19 11:53:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 491 ms
[2021-05-19 11:53:05] [INFO ] sort/places :
Dot->ready,
Voters->voting,voted_yes,voted_no,
[2021-05-19 11:53:05] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 46 PT places and 31.0 transition bindings in 7 ms.
[2021-05-19 11:53:05] [INFO ] Computed order based on color domains.
[2021-05-19 11:53:05] [INFO ] Unfolded HLPN to a Petri net with 46 places and 31 transitions in 4 ms.
[2021-05-19 11:53:05] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5882 resets, run finished after 271 ms. (steps per millisecond=369 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 31 rows 46 cols
[2021-05-19 11:53:05] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-19 11:53:05] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-19 11:53:05] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-19 11:53:05] [INFO ] Flatten gal took : 45 ms
FORMULA Referendum-COL-0015-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 11:53:05] [INFO ] Applying decomposition
[2021-05-19 11:53:05] [INFO ] Flatten gal took : 5 ms
[2021-05-19 11:53:05] [INFO ] Decomposing Gal with order
[2021-05-19 11:53:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 11:53:06] [INFO ] Flatten gal took : 508 ms
[2021-05-19 11:53:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 11:53:06] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2021-05-19 11:53:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Referendum-COL-0015 @ 3570 seconds
FORMULA Referendum-COL-0015-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2328
rslt: Output for LTLFireability @ Referendum-COL-0015
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 11:53:06 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 16,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (X (G (((((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)) R (p45 <= 0)) AND ((p45 <= 0) AND ((p0 <= 0) AND ((p1 <= 0) AND ((p2 <= 0) AND ((p3 <= 0) AND ((p4 <= 0) AND ((p5 <= 0) AND ((p6 <= 0) AND ((p7 <= 0) AND ((p8 <= 0) AND ((p9 <= 0) AND ((p10 <= 0) AND ((p11 <= 0) AND ((p12 <= 0) AND ((p13 <= 0) AND (p14 <= 0))))))))))))))))))))",
"processed_size": 501,
"rewrites": 276
},
"result":
{
"edges": 13817484,
"markings": 1594340,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 326
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 3,
"aneg": 0,
"comp": 45,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 45,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))",
"processed_size": 665,
"rewrites": 276
},
"result":
{
"edges": 19,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"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": 362
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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 (F ((p45 <= 0)))",
"processed_size": 18,
"rewrites": 276
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 407
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 3,
"aneg": 0,
"comp": 46,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 46,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) OR (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p45))) AND F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))",
"processed_size": 676,
"rewrites": 276
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"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": 465
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 46,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 46,
"taut": 0,
"tconj": 0,
"tdisj": 15,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X ((((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (1 <= p45)) U X (G ((X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR ((1 <= p0) OR ((1 <= p1) OR ((1 <= p2) OR ((1 <= p3) OR ((1 <= p4) OR ((1 <= p5) OR ((1 <= p6) OR ((1 <= p7) OR ((1 <= p8) OR ((1 <= p9) OR ((1 <= p10) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14))))))))))))))))))))",
"processed_size": 690,
"rewrites": 276
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 543
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 31,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) AND X ((X (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) OR G ((1 <= p45))))))",
"processed_size": 467,
"rewrites": 276
},
"result":
{
"edges": 1712,
"markings": 873,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 652
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 31,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (G ((((p45 <= 0) OR ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))) AND (p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))",
"processed_size": 454,
"rewrites": 276
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 815
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 815
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 31,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "((F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) U (1 <= p45))",
"processed_size": 450,
"rewrites": 276
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"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": 1087
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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 (((p45 <= 0))))",
"processed_size": 20,
"rewrites": 276
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1087
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))",
"processed_size": 220,
"rewrites": 276
},
"result":
{
"edges": 430499949,
"markings": 28697814,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1494
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))",
"processed_size": 220,
"rewrites": 276
},
"result":
{
"edges": 19,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2988
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 3,
"aneg": 0,
"comp": 45,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 45,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) OR (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))))",
"processed_size": 665,
"rewrites": 276
},
"result":
{
"edges": 20,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 3,
"aneg": 3,
"comp": 45,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 45,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G ((X (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))) OR (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)) R X (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))))",
"processed_size": 663,
"rewrites": 276
},
"result":
{
"edges": 1004488938,
"markings": 57395627,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 75496,
"runtime": 1242.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((X(F(*)) OR (* R X(*)))) : X(X(G(((* R *) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))))))))))))))) : F(G((F(**) AND (X(**) OR **)))) : G(F(*)) : X(F(*)) : X((** OR (G(**) AND F(**)))) : X((** U X(G((X(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))))))))))) : X((** AND X((X(F(**)) OR G(**))))) : G((** OR (F(**) AND F(G(**))))) : F(G(**)) : X(G(*)) : (X(F(**)) AND ((F(**) AND **) U **))"
},
"net":
{
"arcs": 76,
"conflict_clusters": 46,
"places": 46,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 31
},
"result":
{
"preliminary_value": "yes no no yes yes yes no yes no no no yes ",
"value": "yes no no yes yes yes no yes no no no yes "
},
"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: 77/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 46
lola: finding significant places
lola: 46 places, 31 transitions, 31 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 (NOT(F ((X (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) AND (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) U X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))))) : X (X (G (((((((((((((((((NOT(((1 <= p45) U (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) U (1 <= p45)))) AND (p45 <= 0)) AND (p0 <= 0)) AND (p1 <= 0)) AND (p2 <= 0)) AND (p3 <= 0)) AND (p4 <= 0)) AND (p5 <= 0)) AND (p6 <= 0)) AND (p7 <= 0)) AND (p8 <= 0)) AND (p9 <= 0)) AND (p10 <= 0)) AND (p11 <= 0)) AND (p12 <= 0)) AND (p13 <= 0)) AND (p14 <= 0))))) : X (F (G (X ((X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) U ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))) : G (X (NOT(G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))) : NOT(X (G (((1 <= p45) U (1 <= p45))))) : (G (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p45)))) U X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) : X ((((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (1 <= p45)) U G (X ((((((((((((((((X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR (1 <= p0)) OR (1 <= p1)) OR (1 <= p2)) OR (1 <= p3)) OR (1 <= p4)) OR (1 <= p5)) OR (1 <= p6)) OR (1 <= p7)) OR (1 <= p8)) OR (1 <= p9)) OR (1 <= p10)) OR (1 <= p11)) OR (1 <= p12)) OR (1 <= p13)) OR (1 <= p14)))))) : X ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) AND (X (F (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))) OR G (X ((1 <= p45)))))) : G ((G (F (NOT(X (G ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) U NOT(G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))))))) U ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) : F (G (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))) : G (NOT(X ((((1 <= p45) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR (1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))) : (X (F (((p45 <= 0)))) AND ((F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) U (1 <= p45)))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:488
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))) OR (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))) OR (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND ... (shortened)
lola: processed formula length: 663
lola: 276 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: 1038794 markings, 8448305 edges, 207759 markings/sec, 0 secs
lola: 1877594 markings, 16080798 edges, 167760 markings/sec, 5 secs
lola: 2629727 markings, 23052825 edges, 150427 markings/sec, 10 secs
lola: 3363820 markings, 29966918 edges, 146819 markings/sec, 15 secs
lola: 4062457 markings, 36708717 edges, 139727 markings/sec, 20 secs
lola: 4675868 markings, 43294910 edges, 122682 markings/sec, 25 secs
lola: 5455012 markings, 50320313 edges, 155829 markings/sec, 30 secs
lola: 6229021 markings, 57551401 edges, 154802 markings/sec, 35 secs
lola: 6929277 markings, 64309091 edges, 140051 markings/sec, 40 secs
lola: 7582569 markings, 70998135 edges, 130658 markings/sec, 45 secs
lola: 8222233 markings, 77617532 edges, 127933 markings/sec, 50 secs
lola: 8905248 markings, 84089521 edges, 136603 markings/sec, 55 secs
lola: 9564160 markings, 90721893 edges, 131782 markings/sec, 60 secs
lola: 10135497 markings, 97023310 edges, 114267 markings/sec, 65 secs
lola: 10828438 markings, 103790248 edges, 138588 markings/sec, 70 secs
lola: 11439979 markings, 110407832 edges, 122308 markings/sec, 75 secs
lola: 12061199 markings, 116886800 edges, 124244 markings/sec, 80 secs
lola: 12636125 markings, 123215724 edges, 114985 markings/sec, 85 secs
lola: 13222532 markings, 129775111 edges, 117281 markings/sec, 90 secs
lola: 13830250 markings, 136841700 edges, 121544 markings/sec, 95 secs
lola: 14370488 markings, 143664468 edges, 108048 markings/sec, 100 secs
lola: 15096679 markings, 151987750 edges, 145238 markings/sec, 105 secs
lola: 15678428 markings, 159268760 edges, 116350 markings/sec, 110 secs
lola: 16253292 markings, 166634588 edges, 114973 markings/sec, 115 secs
lola: 16806601 markings, 173969513 edges, 110662 markings/sec, 120 secs
lola: 17322206 markings, 181384788 edges, 103121 markings/sec, 125 secs
lola: 17881184 markings, 188867892 edges, 111796 markings/sec, 130 secs
lola: 18467716 markings, 196436412 edges, 117306 markings/sec, 135 secs
lola: 19011335 markings, 203815032 edges, 108724 markings/sec, 140 secs
lola: 19510869 markings, 211059509 edges, 99907 markings/sec, 145 secs
lola: 20030591 markings, 218198909 edges, 103944 markings/sec, 150 secs
lola: 20560409 markings, 225460406 edges, 105964 markings/sec, 155 secs
lola: 21088669 markings, 233560128 edges, 105652 markings/sec, 160 secs
lola: 21697680 markings, 241937197 edges, 121802 markings/sec, 165 secs
lola: 22129760 markings, 248532613 edges, 86416 markings/sec, 170 secs
lola: 22589447 markings, 255444124 edges, 91937 markings/sec, 175 secs
lola: 23025273 markings, 262225511 edges, 87165 markings/sec, 180 secs
lola: 23437000 markings, 268872436 edges, 82345 markings/sec, 185 secs
lola: 23814301 markings, 275423155 edges, 75460 markings/sec, 190 secs
lola: 24181293 markings, 283258194 edges, 73398 markings/sec, 195 secs
lola: 24521596 markings, 291787729 edges, 68061 markings/sec, 200 secs
lola: 24861421 markings, 300425423 edges, 67965 markings/sec, 205 secs
lola: 25178760 markings, 308918070 edges, 63468 markings/sec, 210 secs
lola: 25461892 markings, 317222537 edges, 56626 markings/sec, 215 secs
lola: 25799188 markings, 325847946 edges, 67459 markings/sec, 220 secs
lola: 26113017 markings, 334176463 edges, 62766 markings/sec, 225 secs
lola: 26413796 markings, 342511714 edges, 60156 markings/sec, 230 secs
lola: 26699038 markings, 350656583 edges, 57048 markings/sec, 235 secs
lola: 26973530 markings, 358158006 edges, 54898 markings/sec, 240 secs
lola: 27226468 markings, 365553928 edges, 50588 markings/sec, 245 secs
lola: 27492860 markings, 373109327 edges, 53278 markings/sec, 250 secs
lola: 27732511 markings, 380368984 edges, 47930 markings/sec, 255 secs
lola: 27980296 markings, 387655701 edges, 49557 markings/sec, 260 secs
lola: 28210823 markings, 394798308 edges, 46105 markings/sec, 265 secs
lola: 28423415 markings, 401719561 edges, 42518 markings/sec, 270 secs
lola: 28629036 markings, 408693865 edges, 41124 markings/sec, 275 secs
lola: 29119315 markings, 416279044 edges, 98056 markings/sec, 280 secs
lola: 29743047 markings, 424383369 edges, 124746 markings/sec, 285 secs
lola: 30349919 markings, 432706469 edges, 121374 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4538452 KB
lola: time consumption: 300 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)) R (p45 <= 0)) AND ((p45 <= 0) AND ((p0 <= 0) AND ((p1 <= 0) AND ((p2 <= 0) AND ((p3 <= 0) AND ((p4 <= 0) AND ((p5 <= 0) AND ((p6 <= 0) AND ((p7 <= 0) AND ((p8 <= 0) AND ((p9 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)) R (p45 <= 0)) AND ((p45 <= 0) AND ((p0 <= 0) AND ((p1 <= 0) AND ((p2 <= 0) AND ((p3 <= 0) AND ((p4 <= 0) AND ((p5 <= 0) AND ((p6 <= 0) AND ((p7 <= 0) AND ((p8 <= 0) AND ((p9 <=... (shortened)
lola: processed formula length: 501
lola: 276 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1094420 markings, 8961645 edges, 218884 markings/sec, 0 secs
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: 1594340 markings, 13817484 edges
lola: ========================================
lola: subprocess 2 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) O... (shortened)
lola: processed formula length: 665
lola: 276 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: 18 markings, 19 edges
lola: ========================================
lola: subprocess 3 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p45 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p45 <= 0)))
lola: processed formula length: 18
lola: 276 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) OR (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) OR (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <=... (shortened)
lola: processed formula length: 676
lola: 276 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (1 <= p45)) U X (G ((X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (1 <= p45)) U X (G ((X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR ... (shortened)
lola: processed formula length: 690
lola: 276 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 6 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) AND X ((X (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) AND X ((X (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR... (shortened)
lola: processed formula length: 467
lola: 276 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 873 markings, 1712 edges
lola: ========================================
lola: subprocess 7 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p45 <= 0) OR ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))) AND (p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p45 <= 0) OR ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))) AND (p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11... (shortened)
lola: processed formula length: 454
lola: 276 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 8 will run for 815 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((p45 <= 0)))) AND ((F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 815 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= ... (shortened)
lola: processed formula length: 450
lola: 276 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p45 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p45 <= 0))))
lola: processed formula length: 20
lola: 276 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 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 (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))
lola: processed formula length: 220
lola: 276 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: 1088689 markings, 8905776 edges, 217738 markings/sec, 0 secs
lola: 2035400 markings, 17455585 edges, 189342 markings/sec, 5 secs
lola: 2903915 markings, 25505066 edges, 173703 markings/sec, 10 secs
lola: 3742965 markings, 33511543 edges, 167810 markings/sec, 15 secs
lola: 4497934 markings, 41303618 edges, 150994 markings/sec, 20 secs
lola: 5079960 markings, 49072056 edges, 116405 markings/sec, 25 secs
lola: 5558769 markings, 56991637 edges, 95762 markings/sec, 30 secs
lola: 6004534 markings, 64834159 edges, 89153 markings/sec, 35 secs
lola: 6423967 markings, 72928610 edges, 83887 markings/sec, 40 secs
lola: 6925433 markings, 81424414 edges, 100293 markings/sec, 45 secs
lola: 7340403 markings, 89214899 edges, 82994 markings/sec, 50 secs
lola: 7771929 markings, 97130523 edges, 86305 markings/sec, 55 secs
lola: 8197949 markings, 105452950 edges, 85204 markings/sec, 60 secs
lola: 8609085 markings, 113475065 edges, 82227 markings/sec, 65 secs
lola: 9012778 markings, 121550066 edges, 80739 markings/sec, 70 secs
lola: 9385701 markings, 129584875 edges, 74585 markings/sec, 75 secs
lola: 9999782 markings, 137526363 edges, 122816 markings/sec, 80 secs
lola: 10837302 markings, 145261184 edges, 167504 markings/sec, 85 secs
lola: 11643889 markings, 152916912 edges, 161317 markings/sec, 90 secs
lola: 12378224 markings, 160431188 edges, 146867 markings/sec, 95 secs
lola: 12988808 markings, 168426137 edges, 122117 markings/sec, 100 secs
lola: 13488670 markings, 177294248 edges, 99972 markings/sec, 105 secs
lola: 13950151 markings, 186053549 edges, 92296 markings/sec, 110 secs
lola: 14419934 markings, 194789145 edges, 93957 markings/sec, 115 secs
lola: 14861089 markings, 203317235 edges, 88231 markings/sec, 120 secs
lola: 15286447 markings, 211910632 edges, 85072 markings/sec, 125 secs
lola: 15686085 markings, 220337676 edges, 79928 markings/sec, 130 secs
lola: 16164299 markings, 228297694 edges, 95643 markings/sec, 135 secs
lola: 16946999 markings, 235721524 edges, 156540 markings/sec, 140 secs
lola: 17466221 markings, 240988381 edges, 103844 markings/sec, 145 secs
lola: 17924331 markings, 245889902 edges, 91622 markings/sec, 150 secs
lola: 18395326 markings, 253293336 edges, 94199 markings/sec, 155 secs
lola: 18826003 markings, 261694431 edges, 86135 markings/sec, 160 secs
lola: 19257016 markings, 270143873 edges, 86203 markings/sec, 165 secs
lola: 19680392 markings, 278591862 edges, 84675 markings/sec, 170 secs
lola: 20057367 markings, 286794561 edges, 75395 markings/sec, 175 secs
lola: 20624461 markings, 294260855 edges, 113419 markings/sec, 180 secs
lola: 21311294 markings, 301316480 edges, 137367 markings/sec, 185 secs
lola: 21834966 markings, 308825480 edges, 104734 markings/sec, 190 secs
lola: 22256649 markings, 317217709 edges, 84337 markings/sec, 195 secs
lola: 22652554 markings, 325461426 edges, 79181 markings/sec, 200 secs
lola: 23007993 markings, 333537335 edges, 71088 markings/sec, 205 secs
lola: 23677042 markings, 340729935 edges, 133810 markings/sec, 210 secs
lola: 24196693 markings, 348473327 edges, 103930 markings/sec, 215 secs
lola: 24598968 markings, 356896372 edges, 80455 markings/sec, 220 secs
lola: 24982542 markings, 364969047 edges, 76715 markings/sec, 225 secs
lola: 25598222 markings, 372209965 edges, 123136 markings/sec, 230 secs
lola: 25991351 markings, 380656098 edges, 78626 markings/sec, 235 secs
lola: 26439881 markings, 387967797 edges, 89706 markings/sec, 240 secs
lola: 26840718 markings, 395128284 edges, 80167 markings/sec, 245 secs
lola: 27250389 markings, 402059737 edges, 81934 markings/sec, 250 secs
lola: 27604625 markings, 409505110 edges, 70847 markings/sec, 255 secs
lola: 28055304 markings, 417191405 edges, 90136 markings/sec, 260 secs
lola: 28442152 markings, 424923877 edges, 77370 markings/sec, 265 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: 28697814 markings, 430499949 edges
lola: ========================================
lola: subprocess 10 will run for 1494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))
lola: processed formula length: 220
lola: 276 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: 18 markings, 19 edges
lola: ========================================
lola: subprocess 11 will run for 2988 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) OR (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) OR (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <=... (shortened)
lola: processed formula length: 665
lola: 276 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 19 markings, 20 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((X (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))) OR (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))) OR (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND ... (shortened)
lola: processed formula length: 663
lola: 276 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: 989732 markings, 8025984 edges, 197946 markings/sec, 0 secs
lola: 1782945 markings, 15270575 edges, 158643 markings/sec, 5 secs
lola: 2555566 markings, 22260945 edges, 154524 markings/sec, 10 secs
lola: 3401051 markings, 30272668 edges, 169097 markings/sec, 15 secs
lola: 4211408 markings, 38257214 edges, 162071 markings/sec, 20 secs
lola: 4920280 markings, 45679039 edges, 141774 markings/sec, 25 secs
lola: 5711275 markings, 52760291 edges, 158199 markings/sec, 30 secs
lola: 6459450 markings, 59771148 edges, 149635 markings/sec, 35 secs
lola: 7156251 markings, 66584887 edges, 139360 markings/sec, 40 secs
lola: 7853173 markings, 73990749 edges, 139384 markings/sec, 45 secs
lola: 8568858 markings, 80855306 edges, 143137 markings/sec, 50 secs
lola: 9250478 markings, 87540976 edges, 136324 markings/sec, 55 secs
lola: 9891235 markings, 94240027 edges, 128151 markings/sec, 60 secs
lola: 10569500 markings, 101283757 edges, 135653 markings/sec, 65 secs
lola: 11219756 markings, 107911282 edges, 130051 markings/sec, 70 secs
lola: 11817123 markings, 114358696 edges, 119473 markings/sec, 75 secs
lola: 12429288 markings, 121031608 edges, 122433 markings/sec, 80 secs
lola: 13080624 markings, 128242920 edges, 130267 markings/sec, 85 secs
lola: 13716576 markings, 135463799 edges, 127190 markings/sec, 90 secs
lola: 14264247 markings, 142268354 edges, 109534 markings/sec, 95 secs
lola: 14979529 markings, 150519565 edges, 143056 markings/sec, 100 secs
lola: 15636763 markings, 158786764 edges, 131447 markings/sec, 105 secs
lola: 16243524 markings, 166507984 edges, 121352 markings/sec, 110 secs
lola: 16811185 markings, 174037834 edges, 113532 markings/sec, 115 secs
lola: 17298501 markings, 181028347 edges, 97463 markings/sec, 120 secs
lola: 17782038 markings, 187731547 edges, 96707 markings/sec, 125 secs
lola: 18323905 markings, 194650488 edges, 108373 markings/sec, 130 secs
lola: 18856227 markings, 201641589 edges, 106464 markings/sec, 135 secs
lola: 19337759 markings, 208427860 edges, 96306 markings/sec, 140 secs
lola: 19800630 markings, 215234376 edges, 92574 markings/sec, 145 secs
lola: 20346903 markings, 222469272 edges, 109255 markings/sec, 150 secs
lola: 20826455 markings, 229350103 edges, 95910 markings/sec, 155 secs
lola: 21288051 markings, 236119611 edges, 92319 markings/sec, 160 secs
lola: 21804341 markings, 243535893 edges, 103258 markings/sec, 165 secs
lola: 22335078 markings, 251501181 edges, 106147 markings/sec, 170 secs
lola: 22787887 markings, 258521938 edges, 90562 markings/sec, 175 secs
lola: 23221023 markings, 265325733 edges, 86627 markings/sec, 180 secs
lola: 23624119 markings, 272028306 edges, 80619 markings/sec, 185 secs
lola: 24035296 markings, 279887723 edges, 82235 markings/sec, 190 secs
lola: 24391184 markings, 288523095 edges, 71178 markings/sec, 195 secs
lola: 24735524 markings, 297121539 edges, 68868 markings/sec, 200 secs
lola: 25057277 markings, 305644608 edges, 64351 markings/sec, 205 secs
lola: 25361881 markings, 314143790 edges, 60921 markings/sec, 210 secs
lola: 25670692 markings, 322568334 edges, 61762 markings/sec, 215 secs
lola: 26002062 markings, 331110518 edges, 66274 markings/sec, 220 secs
lola: 26313736 markings, 339618731 edges, 62335 markings/sec, 225 secs
lola: 26578212 markings, 347702511 edges, 52895 markings/sec, 230 secs
lola: 26911636 markings, 356358657 edges, 66685 markings/sec, 235 secs
lola: 27197665 markings, 364651107 edges, 57206 markings/sec, 240 secs
lola: 27487458 markings, 372958057 edges, 57959 markings/sec, 245 secs
lola: 27760875 markings, 381308909 edges, 54683 markings/sec, 250 secs
lola: 28047741 markings, 389827774 edges, 57373 markings/sec, 255 secs
lola: 28315199 markings, 398170330 edges, 53492 markings/sec, 260 secs
lola: 28521087 markings, 404942833 edges, 41178 markings/sec, 265 secs
lola: 28765301 markings, 412047618 edges, 48843 markings/sec, 270 secs
lola: 29426233 markings, 420420656 edges, 132186 markings/sec, 275 secs
lola: 30072872 markings, 428825406 edges, 129328 markings/sec, 280 secs
lola: 30636275 markings, 436970309 edges, 112681 markings/sec, 285 secs
lola: 31231442 markings, 445200539 edges, 119033 markings/sec, 290 secs
lola: 31820361 markings, 453386016 edges, 117784 markings/sec, 295 secs
lola: 32310493 markings, 460724099 edges, 98026 markings/sec, 300 secs
lola: 32857096 markings, 468349698 edges, 109321 markings/sec, 305 secs
lola: 33336158 markings, 475616384 edges, 95812 markings/sec, 310 secs
lola: 33808404 markings, 482901201 edges, 94449 markings/sec, 315 secs
lola: 34288230 markings, 490311310 edges, 95965 markings/sec, 320 secs
lola: 34731609 markings, 497575719 edges, 88676 markings/sec, 325 secs
lola: 35109836 markings, 504543286 edges, 75645 markings/sec, 330 secs
lola: 35400362 markings, 511787766 edges, 58105 markings/sec, 335 secs
lola: 35659735 markings, 518635044 edges, 51875 markings/sec, 340 secs
lola: 35924959 markings, 525918634 edges, 53045 markings/sec, 345 secs
lola: 36156269 markings, 532922087 edges, 46262 markings/sec, 350 secs
lola: 36446090 markings, 540474000 edges, 57964 markings/sec, 355 secs
lola: 36706405 markings, 547899853 edges, 52063 markings/sec, 360 secs
lola: 36977577 markings, 555801341 edges, 54234 markings/sec, 365 secs
lola: 37252144 markings, 563807719 edges, 54913 markings/sec, 370 secs
lola: 37516542 markings, 571689638 edges, 52880 markings/sec, 375 secs
lola: 37769354 markings, 579521779 edges, 50562 markings/sec, 380 secs
lola: 38009369 markings, 587292938 edges, 48003 markings/sec, 385 secs
lola: 38219968 markings, 594569843 edges, 42120 markings/sec, 390 secs
lola: 38716268 markings, 602125841 edges, 99260 markings/sec, 395 secs
lola: 39246054 markings, 609394572 edges, 105957 markings/sec, 400 secs
lola: 39708921 markings, 616473816 edges, 92573 markings/sec, 405 secs
lola: 40267411 markings, 624179768 edges, 111698 markings/sec, 410 secs
lola: 40808492 markings, 632354452 edges, 108216 markings/sec, 415 secs
lola: 41339886 markings, 640465428 edges, 106279 markings/sec, 420 secs
lola: 41864141 markings, 648698929 edges, 104851 markings/sec, 425 secs
lola: 42309224 markings, 656197497 edges, 89017 markings/sec, 430 secs
lola: 42665166 markings, 663751743 edges, 71188 markings/sec, 435 secs
lola: 42937237 markings, 671201998 edges, 54414 markings/sec, 440 secs
lola: 43196201 markings, 678946763 edges, 51793 markings/sec, 445 secs
lola: 43502655 markings, 687555326 edges, 61291 markings/sec, 450 secs
lola: 43758643 markings, 695285459 edges, 51198 markings/sec, 455 secs
lola: 44002700 markings, 702759773 edges, 48811 markings/sec, 460 secs
lola: 44244551 markings, 710255584 edges, 48370 markings/sec, 465 secs
lola: 44482082 markings, 718037318 edges, 47506 markings/sec, 470 secs
lola: 44826561 markings, 726225683 edges, 68896 markings/sec, 475 secs
lola: 45394938 markings, 734416111 edges, 113675 markings/sec, 480 secs
lola: 45935348 markings, 742538174 edges, 108082 markings/sec, 485 secs
lola: 46462442 markings, 750640180 edges, 105419 markings/sec, 490 secs
lola: 46962289 markings, 758708531 edges, 99969 markings/sec, 495 secs
lola: 47418220 markings, 766634957 edges, 91186 markings/sec, 500 secs
lola: 47748495 markings, 775269519 edges, 66055 markings/sec, 505 secs
lola: 48008959 markings, 783122857 edges, 52093 markings/sec, 510 secs
lola: 48245516 markings, 790317253 edges, 47311 markings/sec, 515 secs
lola: 48471541 markings, 797417028 edges, 45205 markings/sec, 520 secs
lola: 48692496 markings, 804513951 edges, 44191 markings/sec, 525 secs
lola: 48871021 markings, 810843377 edges, 35705 markings/sec, 530 secs
lola: 49306521 markings, 817630340 edges, 87100 markings/sec, 535 secs
lola: 49753551 markings, 824580361 edges, 89406 markings/sec, 540 secs
lola: 50194936 markings, 831659632 edges, 88277 markings/sec, 545 secs
lola: 50659405 markings, 839575512 edges, 92894 markings/sec, 550 secs
lola: 50989166 markings, 847866026 edges, 65952 markings/sec, 555 secs
lola: 51254142 markings, 856101771 edges, 52995 markings/sec, 560 secs
lola: 51511971 markings, 864472576 edges, 51566 markings/sec, 565 secs
lola: 51730558 markings, 872256602 edges, 43717 markings/sec, 570 secs
lola: 52253259 markings, 880303963 edges, 104540 markings/sec, 575 secs
lola: 52737122 markings, 888380678 edges, 96773 markings/sec, 580 secs
lola: 53112144 markings, 896679757 edges, 75004 markings/sec, 585 secs
lola: 53379510 markings, 905313187 edges, 53473 markings/sec, 590 secs
lola: 53613189 markings, 913623744 edges, 46736 markings/sec, 595 secs
lola: 54098840 markings, 921580430 edges, 97130 markings/sec, 600 secs
lola: 54506109 markings, 929547511 edges, 81454 markings/sec, 605 secs
lola: 54742629 markings, 937378363 edges, 47304 markings/sec, 610 secs
lola: 55027786 markings, 944766314 edges, 57031 markings/sec, 615 secs
lola: 55430878 markings, 952007679 edges, 80618 markings/sec, 620 secs
lola: 55666572 markings, 959982906 edges, 47139 markings/sec, 625 secs
lola: 56063607 markings, 968091883 edges, 79407 markings/sec, 630 secs
lola: 56341668 markings, 976489322 edges, 55612 markings/sec, 635 secs
lola: 56636505 markings, 984025415 edges, 58967 markings/sec, 640 secs
lola: 56916351 markings, 991204484 edges, 55969 markings/sec, 645 secs
lola: 57182364 markings, 998288878 edges, 53203 markings/sec, 650 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: 57395627 markings, 1004488938 edges
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes no yes no no no yes
lola:
preliminary result: yes no no yes yes yes no yes no no no yes
lola: ========================================
lola: memory consumption: 75496 KB
lola: time consumption: 1242 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="Referendum-COL-0015"
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 Referendum-COL-0015, 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 r189-tajo-162089432700230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0015.tgz
mv Referendum-COL-0015 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;