fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r189-tajo-162089432800262
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for Referendum-PT-0015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8578.899 3600000.00 1595620.00 822.30 TFTFTTFTTTFTFTTT 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-162089432800262.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-PT-0015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432800262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 46K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 267K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K 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 8.2K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 18K 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-PT-0015-00
FORMULA_NAME Referendum-PT-0015-01
FORMULA_NAME Referendum-PT-0015-02
FORMULA_NAME Referendum-PT-0015-03
FORMULA_NAME Referendum-PT-0015-04
FORMULA_NAME Referendum-PT-0015-05
FORMULA_NAME Referendum-PT-0015-06
FORMULA_NAME Referendum-PT-0015-07
FORMULA_NAME Referendum-PT-0015-08
FORMULA_NAME Referendum-PT-0015-09
FORMULA_NAME Referendum-PT-0015-10
FORMULA_NAME Referendum-PT-0015-11
FORMULA_NAME Referendum-PT-0015-12
FORMULA_NAME Referendum-PT-0015-13
FORMULA_NAME Referendum-PT-0015-14
FORMULA_NAME Referendum-PT-0015-15

=== Now, execution of the tool begins

BK_START 1621426469028

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 12:14:30] [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 12:14:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 12:14:30] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2021-05-19 12:14:30] [INFO ] Transformed 46 places.
[2021-05-19 12:14:30] [INFO ] Transformed 31 transitions.
[2021-05-19 12:14:30] [INFO ] Found NUPN structural information;
[2021-05-19 12:14:30] [INFO ] Parsed PT model containing 46 places and 31 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5882 resets, run finished after 194 ms. (steps per millisecond=515 ) 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, 0, 1, 1, 1]
// Phase 1: matrix 31 rows 46 cols
[2021-05-19 12:14:30] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-19 12:14:31] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned unsat
[2021-05-19 12:14:31] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-19 12:14:31] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-19 12:14:31] [INFO ] Flatten gal took : 25 ms
FORMULA Referendum-PT-0015-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 12:14:31] [INFO ] Applying decomposition
[2021-05-19 12:14:31] [INFO ] Flatten gal took : 5 ms
[2021-05-19 12:14:31] [INFO ] Decomposing Gal with order
[2021-05-19 12:14:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 12:14:31] [INFO ] Flatten gal took : 25 ms
[2021-05-19 12:14:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 12:14:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-19 12:14:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Referendum-PT-0015 @ 3570 seconds

FORMULA Referendum-PT-0015-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1995
rslt: Output for LTLFireability @ Referendum-PT-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 12:14:31 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 16,
"adisj": 17,
"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 ((((((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 ((p15 <= 0))) R ((p0 <= 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)) AND ((p15 <= 0)))))))))))))))))))))",
"processed_size": 565,
"rewrites": 177
},
"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": 400
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 45,
"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 <= 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 <= p15)))) AND (X ((((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 <= p15)))) 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 <= p15)))))))",
"processed_size": 758,
"rewrites": 177
},
"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": 457
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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 (((p0 <= 0))))",
"processed_size": 19,
"rewrites": 177
},
"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": 533
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 46,
"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 <= 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 <= p15))) OR (G ((((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 <= p15)) OR ((1 <= p0)))) AND F ((((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 <= p15)))))))",
"processed_size": 770,
"rewrites": 177
},
"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": 640
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (X (X (F ((G (((p3 <= 0))) OR (((p12 <= 0)) AND ((p0 <= 0)))))))))",
"processed_size": 71,
"rewrites": 177
},
"result":
{
"edges": 148652175,
"markings": 22316540,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 773
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((((p11 <= 0)) U ((1 <= p0))) AND G (F ((X (((1 <= p11))) AND G (((1 <= p0))))))))",
"processed_size": 85,
"rewrites": 177
},
"result":
{
"edges": 20,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"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": 1031
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X ((G (((p0 <= 0))) OR (X (F (((1 <= p6)))) OR G (((1 <= p0)))))) U ((1 <= p9)))",
"processed_size": 81,
"rewrites": 177
},
"result":
{
"edges": 267944630,
"markings": 19131935,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (((X (F (((1 <= p14) AND (1 <= p7)))) U ((1 <= p6))) AND ((1 <= p7))))",
"processed_size": 72,
"rewrites": 177
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2926
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 15,
"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 ((((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 ((p15 <= 0)))))",
"processed_size": 251,
"rewrites": 177
},
"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"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 45,
"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 ((((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 ((p15 <= 0))))) OR ((((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 ((p15 <= 0))) R X ((((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 ((p15 <= 0)))))))",
"processed_size": 756,
"rewrites": 177
},
"result":
{
"edges": 1004488938,
"markings": 57395627,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 73424,
"runtime": 1575.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(X(X(X(F((G(*) OR *)))))) : G(((** U **) AND G(F((X(**) AND G(**)))))) : (X((G(*) OR (X(F(**)) OR G(**)))) U **) : F(((X(F(**)) U **) AND **))"
},
"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 yes no yes yes ",
"value": "yes no no yes yes yes yes no yes 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: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: G (NOT(F ((X (G ((((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 <= p15))))) AND ((((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 <= p15))) U X ((((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 <= p15))))))))) : X (X (G (((((((((((((((((NOT((((1 <= p0)) U ((((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 <= p15))) U ((1 <= p0))))) 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))) AND ((p15 <= 0)))))) : X (F (G (X ((X ((((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 <= p15)))) U (((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 <= p15)))))))) : G (X (NOT(G ((((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 <= p15))))))) : NOT(X (G ((((1 <= p0)) U ((1 <= p0)))))) : (G (X ((((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 <= p15)) OR ((1 <= p0))))) U X ((((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 <= p15))))) : X (NOT(X (G (X (X ((F (((1 <= p3))) AND (((1 <= p12)) OR ((1 <= p0)))))))))) : G (((((p11 <= 0)) U ((1 <= p0))) AND G (F ((X (((1 <= p11))) AND G (((1 <= p0)))))))) : (NOT(X (((F (((1 <= p0))) AND NOT(X (F (((1 <= p6)))))) AND NOT(G (((1 <= p0))))))) U ((1 <= p9))) : F (((X (F (((1 <= p14) AND (1 <= p7)))) U ((1 <= p6))) AND ((1 <= p7))))
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F ((((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 ((p15 <= 0))))) OR ((((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))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((((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 ((p15 <= 0))))) OR ((((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))... (shortened)
lola: processed formula length: 756
lola: 177 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: 868683 markings, 7017053 edges, 173737 markings/sec, 0 secs
lola: 1545711 markings, 13249846 edges, 135406 markings/sec, 5 secs
lola: 2272912 markings, 19561662 edges, 145440 markings/sec, 10 secs
lola: 2949443 markings, 25892971 edges, 135306 markings/sec, 15 secs
lola: 3668241 markings, 32758167 edges, 143760 markings/sec, 20 secs
lola: 4307750 markings, 39245832 edges, 127902 markings/sec, 25 secs
lola: 4916235 markings, 45649048 edges, 121697 markings/sec, 30 secs
lola: 5601345 markings, 51678837 edges, 137022 markings/sec, 35 secs
lola: 6231241 markings, 57575833 edges, 125979 markings/sec, 40 secs
lola: 6825470 markings, 63288041 edges, 118846 markings/sec, 45 secs
lola: 7387427 markings, 68953120 edges, 112391 markings/sec, 50 secs
lola: 7918257 markings, 74766568 edges, 106166 markings/sec, 55 secs
lola: 8560821 markings, 80774974 edges, 128513 markings/sec, 60 secs
lola: 9148044 markings, 86580171 edges, 117445 markings/sec, 65 secs
lola: 9727375 markings, 92458328 edges, 115866 markings/sec, 70 secs
lola: 10268971 markings, 98251152 edges, 108319 markings/sec, 75 secs
lola: 10865761 markings, 104203038 edges, 119358 markings/sec, 80 secs
lola: 11409574 markings, 110043609 edges, 108763 markings/sec, 85 secs
lola: 11971067 markings, 115908140 edges, 112299 markings/sec, 90 secs
lola: 12479605 markings, 121621364 edges, 101708 markings/sec, 95 secs
lola: 13024138 markings, 127525663 edges, 108907 markings/sec, 100 secs
lola: 13520679 markings, 133242077 edges, 99308 markings/sec, 105 secs
lola: 14009855 markings, 139022962 edges, 97835 markings/sec, 110 secs
lola: 14478734 markings, 144768233 edges, 93776 markings/sec, 115 secs
lola: 15066119 markings, 151560174 edges, 117477 markings/sec, 120 secs
lola: 15595552 markings, 158249526 edges, 105887 markings/sec, 125 secs
lola: 16111653 markings, 164942238 edges, 103220 markings/sec, 130 secs
lola: 16638220 markings, 171758052 edges, 105313 markings/sec, 135 secs
lola: 17121568 markings, 178475499 edges, 96670 markings/sec, 140 secs
lola: 17549477 markings, 185041513 edges, 85582 markings/sec, 145 secs
lola: 18129805 markings, 192063765 edges, 116066 markings/sec, 150 secs
lola: 18653581 markings, 198926388 edges, 104755 markings/sec, 155 secs
lola: 19151016 markings, 205740596 edges, 99487 markings/sec, 160 secs
lola: 19595503 markings, 212423620 edges, 88897 markings/sec, 165 secs
lola: 20064133 markings, 218670055 edges, 93726 markings/sec, 170 secs
lola: 20534844 markings, 225114153 edges, 94142 markings/sec, 175 secs
lola: 20981753 markings, 231752638 edges, 89382 markings/sec, 180 secs
lola: 21460676 markings, 238562047 edges, 95785 markings/sec, 185 secs
lola: 21892645 markings, 244915836 edges, 86394 markings/sec, 190 secs
lola: 22326917 markings, 251374165 edges, 86854 markings/sec, 195 secs
lola: 22740929 markings, 257799030 edges, 82802 markings/sec, 200 secs
lola: 23154712 markings, 264293797 edges, 82757 markings/sec, 205 secs
lola: 23552807 markings, 270853943 edges, 79619 markings/sec, 210 secs
lola: 23898372 markings, 277040755 edges, 69113 markings/sec, 215 secs
lola: 24216130 markings, 284144086 edges, 63552 markings/sec, 220 secs
lola: 24496329 markings, 291214136 edges, 56040 markings/sec, 225 secs
lola: 24768434 markings, 298034200 edges, 54421 markings/sec, 230 secs
lola: 25028505 markings, 304893447 edges, 52014 markings/sec, 235 secs
lola: 25285046 markings, 311901147 edges, 51308 markings/sec, 240 secs
lola: 25504130 markings, 318668360 edges, 43817 markings/sec, 245 secs
lola: 25805633 markings, 326016015 edges, 60301 markings/sec, 250 secs
lola: 26080027 markings, 333249985 edges, 54879 markings/sec, 255 secs
lola: 26342802 markings, 340451476 edges, 52555 markings/sec, 260 secs
lola: 26567219 markings, 347382142 edges, 44883 markings/sec, 265 secs
lola: 26852014 markings, 354782517 edges, 56959 markings/sec, 270 secs
lola: 27113732 markings, 362099077 edges, 52344 markings/sec, 275 secs
lola: 27355011 markings, 369276639 edges, 48256 markings/sec, 280 secs
lola: 27593242 markings, 376013179 edges, 47646 markings/sec, 285 secs
lola: 27816020 markings, 382790624 edges, 44556 markings/sec, 290 secs
lola: 28041831 markings, 389630263 edges, 45162 markings/sec, 295 secs
lola: 28255845 markings, 396273309 edges, 42803 markings/sec, 300 secs
lola: 28464211 markings, 402999970 edges, 41673 markings/sec, 305 secs
lola: 28656513 markings, 409705059 edges, 38460 markings/sec, 310 secs
lola: 29110668 markings, 416177828 edges, 90831 markings/sec, 315 secs
lola: 29604184 markings, 422571957 edges, 98703 markings/sec, 320 secs
lola: 30098207 markings, 429178233 edges, 98805 markings/sec, 325 secs
lola: 30570071 markings, 435944265 edges, 94373 markings/sec, 330 secs
lola: 31049252 markings, 442753322 edges, 95836 markings/sec, 335 secs
lola: 31573523 markings, 449850234 edges, 104854 markings/sec, 340 secs
lola: 32059107 markings, 456890733 edges, 97117 markings/sec, 345 secs
lola: 32542218 markings, 463919669 edges, 96622 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4835780 KB
lola: time consumption: 360 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 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((((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 ((p15 <= 0))) R ((p0 <= 0))) AND (((p0 <= 0)) AND (((p1 <= 0)) AND (((p2 <= 0)) AND (((p3 <= 0)) AND (((p4 <= 0)) AND (((p5 <= 0)) AND (((p6 <= 0)) AND (((p7 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((((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 ((p15 <= 0))) R ((p0 <= 0))) AND (((p0 <= 0)) AND (((p1 <= 0)) AND (((p2 <= 0)) AND (((p3 <= 0)) AND (((p4 <= 0)) AND (((p5 <= 0)) AND (((p6 <= 0)) AND (((p7 <... (shortened)
lola: processed formula length: 565
lola: 177 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: 961320 markings, 7799939 edges, 192264 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 400 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((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 <= p15)))) AND (X ((((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 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((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 <= p15)))) AND (X ((((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 <= p... (shortened)
lola: processed formula length: 758
lola: 177 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 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p0 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p0 <= 0))))
lola: processed formula length: 19
lola: 177 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 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((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 <= p15))) OR (G ((((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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((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 <= p15))) OR (G ((((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 ... (shortened)
lola: processed formula length: 770
lola: 177 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 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (F ((G (((p3 <= 0))) OR (((p12 <= 0)) AND ((p0 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (F ((G (((p3 <= 0))) OR (((p12 <= 0)) AND ((p0 <= 0)))))))))
lola: processed formula length: 71
lola: 177 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: 1526318 markings, 8527698 edges, 305264 markings/sec, 0 secs
lola: 2885201 markings, 16859168 edges, 271777 markings/sec, 5 secs
lola: 4169875 markings, 24899239 edges, 256935 markings/sec, 10 secs
lola: 5446050 markings, 32892689 edges, 255235 markings/sec, 15 secs
lola: 6607837 markings, 40616241 edges, 232357 markings/sec, 20 secs
lola: 7650317 markings, 47859398 edges, 208496 markings/sec, 25 secs
lola: 8870660 markings, 55249416 edges, 244069 markings/sec, 30 secs
lola: 10001726 markings, 62371790 edges, 226213 markings/sec, 35 secs
lola: 11042939 markings, 69188383 edges, 208243 markings/sec, 40 secs
lola: 11889030 markings, 74967333 edges, 169218 markings/sec, 45 secs
lola: 12669513 markings, 80386768 edges, 156097 markings/sec, 50 secs
lola: 13670640 markings, 86766065 edges, 200225 markings/sec, 55 secs
lola: 14513843 markings, 92301980 edges, 168641 markings/sec, 60 secs
lola: 15443292 markings, 98813387 edges, 185890 markings/sec, 65 secs
lola: 16440212 markings, 105638939 edges, 199384 markings/sec, 70 secs
lola: 17479488 markings, 112702862 edges, 207855 markings/sec, 75 secs
lola: 18459679 markings, 119623202 edges, 196038 markings/sec, 80 secs
lola: 19397375 markings, 126439631 edges, 187539 markings/sec, 85 secs
lola: 20350985 markings, 133331108 edges, 190722 markings/sec, 90 secs
lola: 21286132 markings, 140236651 edges, 187029 markings/sec, 95 secs
lola: 22121360 markings, 146739705 edges, 167046 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 22316540 markings, 148652175 edges
lola: ========================================
lola: subprocess 6 will run for 773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((((p11 <= 0)) U ((1 <= p0))) AND G (F ((X (((1 <= p11))) AND G (((1 <= p0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((p11 <= 0)) U ((1 <= p0))) AND G (F ((X (((1 <= p11))) AND G (((1 <= p0))))))))
lola: processed formula length: 85
lola: 177 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20 markings, 20 edges
lola: ========================================
lola: subprocess 7 will run for 1031 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G (((p0 <= 0))) OR (X (F (((1 <= p6)))) OR G (((1 <= p0)))))) U ((1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((G (((p0 <= 0))) OR (X (F (((1 <= p6)))) OR G (((1 <= p0)))))) U ((1 <= p9)))
lola: processed formula length: 81
lola: 177 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: 992770 markings, 8058915 edges, 198554 markings/sec, 0 secs
lola: 1868938 markings, 16008367 edges, 175234 markings/sec, 5 secs
lola: 2663678 markings, 23436136 edges, 158948 markings/sec, 10 secs
lola: 3460229 markings, 30808189 edges, 159310 markings/sec, 15 secs
lola: 4161397 markings, 37796705 edges, 140234 markings/sec, 20 secs
lola: 4771353 markings, 44484406 edges, 121991 markings/sec, 25 secs
lola: 5282589 markings, 52506867 edges, 102247 markings/sec, 30 secs
lola: 5760418 markings, 60526404 edges, 95566 markings/sec, 35 secs
lola: 6180418 markings, 68190006 edges, 84000 markings/sec, 40 secs
lola: 6621565 markings, 76151983 edges, 88229 markings/sec, 45 secs
lola: 7088790 markings, 84394772 edges, 93445 markings/sec, 50 secs
lola: 7506190 markings, 92464455 edges, 83480 markings/sec, 55 secs
lola: 7961809 markings, 100750636 edges, 91124 markings/sec, 60 secs
lola: 8385294 markings, 108925787 edges, 84697 markings/sec, 65 secs
lola: 8791235 markings, 117009496 edges, 81188 markings/sec, 70 secs
lola: 9178851 markings, 125081797 edges, 77523 markings/sec, 75 secs
lola: 9525993 markings, 132898133 edges, 69428 markings/sec, 80 secs
lola: 10487417 markings, 141441844 edges, 192285 markings/sec, 85 secs
lola: 11376824 markings, 149483911 edges, 177881 markings/sec, 90 secs
lola: 12208480 markings, 157180614 edges, 166331 markings/sec, 95 secs
lola: 13027124 markings, 164789945 edges, 163729 markings/sec, 100 secs
lola: 13772225 markings, 172192846 edges, 149020 markings/sec, 105 secs
lola: 14416253 markings, 179514876 edges, 128806 markings/sec, 110 secs
lola: 14943926 markings, 188038863 edges, 105535 markings/sec, 115 secs
lola: 15440942 markings, 196522544 edges, 99403 markings/sec, 120 secs
lola: 15877418 markings, 204780204 edges, 87295 markings/sec, 125 secs
lola: 16361696 markings, 213174339 edges, 96856 markings/sec, 130 secs
lola: 16823825 markings, 221572812 edges, 92426 markings/sec, 135 secs
lola: 17267733 markings, 229903721 edges, 88782 markings/sec, 140 secs
lola: 17698481 markings, 238244175 edges, 86150 markings/sec, 145 secs
lola: 18137162 markings, 246623466 edges, 87736 markings/sec, 150 secs
lola: 18545412 markings, 254876368 edges, 81650 markings/sec, 155 secs
lola: 18929672 markings, 263069871 edges, 76852 markings/sec, 160 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: 19131935 markings, 267944630 edges
lola: ========================================
lola: subprocess 8 will run for 1463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((X (F (((1 <= p14) AND (1 <= p7)))) U ((1 <= p6))) AND ((1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((X (F (((1 <= p14) AND (1 <= p7)))) U ((1 <= p6))) AND ((1 <= p7))))
lola: processed formula length: 72
lola: 177 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 2926 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((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 ((p15 <= 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 ((((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 ((p15 <= 0)))))
lola: processed formula length: 251
lola: 177 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: 1044055 markings, 8495370 edges, 208811 markings/sec, 0 secs
lola: 1869808 markings, 16005748 edges, 165151 markings/sec, 5 secs
lola: 2650428 markings, 23291162 edges, 156124 markings/sec, 10 secs
lola: 3440962 markings, 30618525 edges, 158107 markings/sec, 15 secs
lola: 4143303 markings, 37583965 edges, 140468 markings/sec, 20 secs
lola: 4756302 markings, 44273595 edges, 122600 markings/sec, 25 secs
lola: 5269214 markings, 52237133 edges, 102582 markings/sec, 30 secs
lola: 5745392 markings, 60270245 edges, 95236 markings/sec, 35 secs
lola: 6169976 markings, 67985106 edges, 84917 markings/sec, 40 secs
lola: 6609780 markings, 75915319 edges, 87961 markings/sec, 45 secs
lola: 7068577 markings, 83992556 edges, 91759 markings/sec, 50 secs
lola: 7465267 markings, 91781874 edges, 79338 markings/sec, 55 secs
lola: 7924713 markings, 99997930 edges, 91889 markings/sec, 60 secs
lola: 8341927 markings, 108099915 edges, 83443 markings/sec, 65 secs
lola: 8764914 markings, 116450072 edges, 84597 markings/sec, 70 secs
lola: 9174053 markings, 124950008 edges, 81828 markings/sec, 75 secs
lola: 9542578 markings, 133291787 edges, 73705 markings/sec, 80 secs
lola: 10376370 markings, 140903978 edges, 166758 markings/sec, 85 secs
lola: 11149750 markings, 148146877 edges, 154676 markings/sec, 90 secs
lola: 11867692 markings, 155194647 edges, 143588 markings/sec, 95 secs
lola: 12537295 markings, 162153325 edges, 133921 markings/sec, 100 secs
lola: 13068060 markings, 169836867 edges, 106153 markings/sec, 105 secs
lola: 13529531 markings, 178046271 edges, 92294 markings/sec, 110 secs
lola: 13958262 markings, 186181163 edges, 85746 markings/sec, 115 secs
lola: 14403126 markings, 194456575 edges, 88973 markings/sec, 120 secs
lola: 14829371 markings, 202666520 edges, 85249 markings/sec, 125 secs
lola: 15236512 markings, 210825837 edges, 81428 markings/sec, 130 secs
lola: 15621646 markings, 218912747 edges, 77027 markings/sec, 135 secs
lola: 15958318 markings, 226520552 edges, 67334 markings/sec, 140 secs
lola: 16640499 markings, 232885713 edges, 136436 markings/sec, 145 secs
lola: 17320989 markings, 239456945 edges, 136098 markings/sec, 150 secs
lola: 17952374 markings, 246222768 edges, 126277 markings/sec, 155 secs
lola: 18436608 markings, 254053003 edges, 96847 markings/sec, 160 secs
lola: 18849937 markings, 262102168 edges, 82666 markings/sec, 165 secs
lola: 19257173 markings, 270146258 edges, 81447 markings/sec, 170 secs
lola: 19667457 markings, 278312856 edges, 82057 markings/sec, 175 secs
lola: 20038289 markings, 286355897 edges, 74166 markings/sec, 180 secs
lola: 20572047 markings, 293711382 edges, 106752 markings/sec, 185 secs
lola: 21239776 markings, 300556069 edges, 133546 markings/sec, 190 secs
lola: 21777332 markings, 307793316 edges, 107511 markings/sec, 195 secs
lola: 22187927 markings, 315894839 edges, 82119 markings/sec, 200 secs
lola: 22584256 markings, 324003548 edges, 79266 markings/sec, 205 secs
lola: 22932701 markings, 331684048 edges, 69689 markings/sec, 210 secs
lola: 23446695 markings, 338267822 edges, 102799 markings/sec, 215 secs
lola: 24011697 markings, 344856889 edges, 113000 markings/sec, 220 secs
lola: 24401242 markings, 352690911 edges, 77909 markings/sec, 225 secs
lola: 24740693 markings, 360055730 edges, 67890 markings/sec, 230 secs
lola: 25194903 markings, 367191805 edges, 90842 markings/sec, 235 secs
lola: 25712100 markings, 374545025 edges, 103439 markings/sec, 240 secs
lola: 26079543 markings, 382647314 edges, 73489 markings/sec, 245 secs
lola: 26588463 markings, 389760184 edges, 101784 markings/sec, 250 secs
lola: 26959172 markings, 397881833 edges, 74142 markings/sec, 255 secs
lola: 27419806 markings, 405346956 edges, 92127 markings/sec, 260 secs
lola: 27830373 markings, 412941887 edges, 82113 markings/sec, 265 secs
lola: 28200791 markings, 420552418 edges, 74084 markings/sec, 270 secs
lola: 28581546 markings, 427828886 edges, 76151 markings/sec, 275 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: ========================================
lola: ...considering subproblem: G ((X (F ((((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 ((p15 <= 0))))) OR ((((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))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((((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 ((p15 <= 0))))) OR ((((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))... (shortened)
lola: processed formula length: 756
lola: 177 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: 1010955 markings, 8209756 edges, 202191 markings/sec, 0 secs
lola: 1898775 markings, 16269028 edges, 177564 markings/sec, 5 secs
lola: 2733461 markings, 23985750 edges, 166937 markings/sec, 10 secs
lola: 3541871 markings, 31563356 edges, 161682 markings/sec, 15 secs
lola: 4279483 markings, 38947565 edges, 147522 markings/sec, 20 secs
lola: 4990131 markings, 46249625 edges, 142130 markings/sec, 25 secs
lola: 5780826 markings, 53465538 edges, 158139 markings/sec, 30 secs
lola: 6530943 markings, 60532114 edges, 150023 markings/sec, 35 secs
lola: 7252537 markings, 67546000 edges, 144319 markings/sec, 40 secs
lola: 7888821 markings, 74415047 edges, 127257 markings/sec, 45 secs
lola: 8621358 markings, 81404039 edges, 146507 markings/sec, 50 secs
lola: 9332220 markings, 88339983 edges, 142172 markings/sec, 55 secs
lola: 9973118 markings, 95188875 edges, 128180 markings/sec, 60 secs
lola: 10659352 markings, 102098013 edges, 137247 markings/sec, 65 secs
lola: 11318351 markings, 109001040 edges, 131800 markings/sec, 70 secs
lola: 11970018 markings, 115895560 edges, 130333 markings/sec, 75 secs
lola: 12590941 markings, 122730679 edges, 124185 markings/sec, 80 secs
lola: 13208804 markings, 129612608 edges, 123573 markings/sec, 85 secs
lola: 13789181 markings, 136398378 edges, 116075 markings/sec, 90 secs
lola: 14324233 markings, 143102087 edges, 107010 markings/sec, 95 secs
lola: 15006430 markings, 150830790 edges, 136439 markings/sec, 100 secs
lola: 15614341 markings, 158486342 edges, 121582 markings/sec, 105 secs
lola: 16213495 markings, 166139095 edges, 119831 markings/sec, 110 secs
lola: 16795808 markings, 173819428 edges, 116463 markings/sec, 115 secs
lola: 17321699 markings, 181375875 edges, 105178 markings/sec, 120 secs
lola: 17889990 markings, 188979309 edges, 113658 markings/sec, 125 secs
lola: 18485363 markings, 196662397 edges, 119075 markings/sec, 130 secs
lola: 19040891 markings, 204271325 edges, 111106 markings/sec, 135 secs
lola: 19560716 markings, 211850353 edges, 103965 markings/sec, 140 secs
lola: 20118880 markings, 219489467 edges, 111633 markings/sec, 145 secs
lola: 20675541 markings, 227154723 edges, 111332 markings/sec, 150 secs
lola: 21179218 markings, 234691311 edges, 100735 markings/sec, 155 secs
lola: 21729438 markings, 242423121 edges, 110044 markings/sec, 160 secs
lola: 22229733 markings, 250011438 edges, 100059 markings/sec, 165 secs
lola: 22729899 markings, 257639429 edges, 100033 markings/sec, 170 secs
lola: 23216066 markings, 265244192 edges, 97233 markings/sec, 175 secs
lola: 23663038 markings, 272738306 edges, 89394 markings/sec, 180 secs
lola: 24065539 markings, 280597280 edges, 80500 markings/sec, 185 secs
lola: 24408678 markings, 289012546 edges, 68628 markings/sec, 190 secs
lola: 24745434 markings, 297382899 edges, 67351 markings/sec, 195 secs
lola: 25058729 markings, 305678687 edges, 62659 markings/sec, 200 secs
lola: 25354933 markings, 313927522 edges, 59241 markings/sec, 205 secs
lola: 25652345 markings, 322141576 edges, 59482 markings/sec, 210 secs
lola: 25982268 markings, 330586499 edges, 65985 markings/sec, 215 secs
lola: 26286825 markings, 338882747 edges, 60911 markings/sec, 220 secs
lola: 26557348 markings, 347024911 edges, 54105 markings/sec, 225 secs
lola: 26879719 markings, 355501689 edges, 64474 markings/sec, 230 secs
lola: 27171217 markings, 363819539 edges, 58300 markings/sec, 235 secs
lola: 27452632 markings, 372029085 edges, 56283 markings/sec, 240 secs
lola: 27730207 markings, 380290892 edges, 55515 markings/sec, 245 secs
lola: 28009299 markings, 388565062 edges, 55818 markings/sec, 250 secs
lola: 28268233 markings, 396709762 edges, 51787 markings/sec, 255 secs
lola: 28518447 markings, 404865140 edges, 50043 markings/sec, 260 secs
lola: 28827499 markings, 412747519 edges, 61810 markings/sec, 265 secs
lola: 29430790 markings, 420466873 edges, 120658 markings/sec, 270 secs
lola: 30026097 markings, 428194262 edges, 119061 markings/sec, 275 secs
lola: 30560870 markings, 435813800 edges, 106955 markings/sec, 280 secs
lola: 31100470 markings, 443428970 edges, 107920 markings/sec, 285 secs
lola: 31666897 markings, 451157551 edges, 113285 markings/sec, 290 secs
lola: 32172416 markings, 458680526 edges, 101104 markings/sec, 295 secs
lola: 32723167 markings, 466414160 edges, 110150 markings/sec, 300 secs
lola: 33219257 markings, 474007196 edges, 99218 markings/sec, 305 secs
lola: 33739071 markings, 481698104 edges, 103963 markings/sec, 310 secs
lola: 34222222 markings, 489294030 edges, 96630 markings/sec, 315 secs
lola: 34668133 markings, 496486972 edges, 89182 markings/sec, 320 secs
lola: 35045282 markings, 503195627 edges, 75430 markings/sec, 325 secs
lola: 35383735 markings, 511322424 edges, 67691 markings/sec, 330 secs
lola: 35694718 markings, 519524248 edges, 62197 markings/sec, 335 secs
lola: 35991843 markings, 527848659 edges, 59425 markings/sec, 340 secs
lola: 36286173 markings, 536152433 edges, 58866 markings/sec, 345 secs
lola: 36594171 markings, 544585349 edges, 61600 markings/sec, 350 secs
lola: 36863715 markings, 552779206 edges, 53909 markings/sec, 355 secs
lola: 37168377 markings, 561247813 edges, 60932 markings/sec, 360 secs
lola: 37416484 markings, 568768024 edges, 49621 markings/sec, 365 secs
lola: 37667009 markings, 576426965 edges, 50105 markings/sec, 370 secs
lola: 37930587 markings, 584678930 edges, 52716 markings/sec, 375 secs
lola: 38170921 markings, 592785308 edges, 48067 markings/sec, 380 secs
lola: 38572184 markings, 600089048 edges, 80253 markings/sec, 385 secs
lola: 39093528 markings, 607235507 edges, 104269 markings/sec, 390 secs
lola: 39590640 markings, 614578202 edges, 99422 markings/sec, 395 secs
lola: 40140212 markings, 622334083 edges, 109914 markings/sec, 400 secs
lola: 40594994 markings, 629282081 edges, 90956 markings/sec, 405 secs
lola: 41080578 markings, 636393233 edges, 97117 markings/sec, 410 secs
lola: 41564275 markings, 643901619 edges, 96739 markings/sec, 415 secs
lola: 42033830 markings, 651505062 edges, 93911 markings/sec, 420 secs
lola: 42460906 markings, 658973525 edges, 85415 markings/sec, 425 secs
lola: 42797155 markings, 667349263 edges, 67250 markings/sec, 430 secs
lola: 43097142 markings, 675822477 edges, 59997 markings/sec, 435 secs
lola: 43380700 markings, 684167390 edges, 56712 markings/sec, 440 secs
lola: 43666811 markings, 692576790 edges, 57222 markings/sec, 445 secs
lola: 43949779 markings, 700999044 edges, 56594 markings/sec, 450 secs
lola: 44212717 markings, 709271793 edges, 52588 markings/sec, 455 secs
lola: 44439827 markings, 716603608 edges, 45422 markings/sec, 460 secs
lola: 44661860 markings, 724101538 edges, 44407 markings/sec, 465 secs
lola: 45228749 markings, 731910230 edges, 113378 markings/sec, 470 secs
lola: 45735842 markings, 739582524 edges, 101419 markings/sec, 475 secs
lola: 46232063 markings, 747229957 edges, 99244 markings/sec, 480 secs
lola: 46728790 markings, 754932312 edges, 99345 markings/sec, 485 secs
lola: 47190694 markings, 762540273 edges, 92381 markings/sec, 490 secs
lola: 47574090 markings, 770313200 edges, 76679 markings/sec, 495 secs
lola: 47860400 markings, 778595682 edges, 57262 markings/sec, 500 secs
lola: 48117955 markings, 786308903 edges, 51511 markings/sec, 505 secs
lola: 48375230 markings, 794243142 edges, 51455 markings/sec, 510 secs
lola: 48632729 markings, 802540249 edges, 51500 markings/sec, 515 secs
lola: 48866426 markings, 810667315 edges, 46739 markings/sec, 520 secs
lola: 49363521 markings, 818514812 edges, 99419 markings/sec, 525 secs
lola: 49858538 markings, 826233947 edges, 99003 markings/sec, 530 secs
lola: 50332487 markings, 833906768 edges, 94790 markings/sec, 535 secs
lola: 50756317 markings, 841413263 edges, 84766 markings/sec, 540 secs
lola: 51051869 markings, 849840911 edges, 59110 markings/sec, 545 secs
lola: 51316354 markings, 858185279 edges, 52897 markings/sec, 550 secs
lola: 51572089 markings, 866510595 edges, 51147 markings/sec, 555 secs
lola: 51882894 markings, 874453747 edges, 62161 markings/sec, 560 secs
lola: 52366188 markings, 882106188 edges, 96659 markings/sec, 565 secs
lola: 52810124 markings, 889627090 edges, 88787 markings/sec, 570 secs
lola: 53137981 markings, 897496596 edges, 65571 markings/sec, 575 secs
lola: 53391513 markings, 905708688 edges, 50706 markings/sec, 580 secs
lola: 53615764 markings, 913747484 edges, 44850 markings/sec, 585 secs
lola: 54084630 markings, 921367460 edges, 93773 markings/sec, 590 secs
lola: 54487842 markings, 928962417 edges, 80642 markings/sec, 595 secs
lola: 54728206 markings, 936871457 edges, 48073 markings/sec, 600 secs
lola: 55014015 markings, 944528714 edges, 57162 markings/sec, 605 secs
lola: 55430750 markings, 952004502 edges, 83347 markings/sec, 610 secs
lola: 55675270 markings, 960298080 edges, 48904 markings/sec, 615 secs
lola: 56026144 markings, 967365803 edges, 70175 markings/sec, 620 secs
lola: 56271404 markings, 975158456 edges, 49052 markings/sec, 625 secs
lola: 56600859 markings, 982665860 edges, 65891 markings/sec, 630 secs
lola: 56887934 markings, 990432529 edges, 57415 markings/sec, 635 secs
lola: 57173997 markings, 998122251 edges, 57213 markings/sec, 640 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 yes no yes yes
lola:
preliminary result: yes no no yes yes yes yes no yes yes
lola: ========================================
lola: memory consumption: 73424 KB
lola: time consumption: 1575 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-PT-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-PT-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-162089432800262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0015.tgz
mv Referendum-PT-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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;