About the Execution of ITS-LoLa for RwMutex-PT-r0010w0500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.330 | 3600000.00 | 52731.00 | 91.20 | FFFFFFFTFTFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987938800274.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RwMutex-PT-r0010w0500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938800274
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 2.9K Apr 12 11:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 12 11:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 12:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 23:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 23:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 836K Mar 24 05:38 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 RwMutex-PT-r0010w0500-00
FORMULA_NAME RwMutex-PT-r0010w0500-01
FORMULA_NAME RwMutex-PT-r0010w0500-02
FORMULA_NAME RwMutex-PT-r0010w0500-03
FORMULA_NAME RwMutex-PT-r0010w0500-04
FORMULA_NAME RwMutex-PT-r0010w0500-05
FORMULA_NAME RwMutex-PT-r0010w0500-06
FORMULA_NAME RwMutex-PT-r0010w0500-07
FORMULA_NAME RwMutex-PT-r0010w0500-08
FORMULA_NAME RwMutex-PT-r0010w0500-09
FORMULA_NAME RwMutex-PT-r0010w0500-10
FORMULA_NAME RwMutex-PT-r0010w0500-11
FORMULA_NAME RwMutex-PT-r0010w0500-12
FORMULA_NAME RwMutex-PT-r0010w0500-13
FORMULA_NAME RwMutex-PT-r0010w0500-14
FORMULA_NAME RwMutex-PT-r0010w0500-15
=== Now, execution of the tool begins
BK_START 1591232837412
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:07:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 01:07:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:07:19] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2020-06-04 01:07:19] [INFO ] Transformed 1030 places.
[2020-06-04 01:07:19] [INFO ] Transformed 1020 transitions.
[2020-06-04 01:07:19] [INFO ] Parsed PT model containing 1030 places and 1020 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 3299 ms. (steps per millisecond=30 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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]
// Phase 1: matrix 1020 rows 1030 cols
[2020-06-04 01:07:23] [INFO ] Computed 520 place invariants in 123 ms
[2020-06-04 01:07:23] [INFO ] [Real]Absence check using 520 positive place invariants in 183 ms returned unsat
[2020-06-04 01:07:23] [INFO ] [Real]Absence check using 520 positive place invariants in 57 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-04 01:07:24] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 01:07:24] [INFO ] Flatten gal took : 264 ms
FORMULA RwMutex-PT-r0010w0500-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 01:07:24] [INFO ] Flatten gal took : 112 ms
[2020-06-04 01:07:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-04 01:07:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RwMutex-PT-r0010w0500 @ 3570 seconds
FORMULA RwMutex-PT-r0010w0500-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0500-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0500-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0500-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0500-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0500-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0500-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0500-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0500-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0500-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0500-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0500-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3532
rslt: Output for LTLFireability @ RwMutex-PT-r0010w0500
{
"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": "Thu Jun 4 01:07:24 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((((p360 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)) U ((1 <= p398) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))",
"processed_size": 355,
"rewrites": 178
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X ((X ((X ((F (((1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511) AND (1 <= p720))) OR (1 <= p591))) OR G ((1 <= p972)))) AND ((p263 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))",
"processed_size": 407,
"rewrites": 178
},
"result":
{
"edges": 17,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 353
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p878 <= 0)",
"processed_size": 11,
"rewrites": 180
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 392
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(F (((1 <= p434) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U (1 <= p878))",
"processed_size": 193,
"rewrites": 178
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 23,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "G (F ((F ((X (((1 <= p313) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) OR (1 <= p555))) OR G (((1 <= p262) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))))",
"processed_size": 389,
"rewrites": 178
},
"result":
{
"edges": 20,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 15,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 14,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "G ((X ((X ((p745 <= 0)) OR ((p752 <= 0) OR (p745 <= 0)))) OR (G ((p745 <= 0)) OR ((p297 <= 0) OR ((p501 <= 0) OR ((p502 <= 0) OR ((p503 <= 0) OR ((p504 <= 0) OR ((p505 <= 0) OR ((p506 <= 0) OR ((p507 <= 0) OR ((p508 <= 0) OR ((p510 <= 0) OR (p511 <= 0))))))))))))))",
"processed_size": 265,
"rewrites": 178
},
"result":
{
"edges": 11750,
"markings": 2034,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 33,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X ((F (G (((1 <= p128) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) OR (G (((1 <= p128) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) AND F (G (((1 <= p128) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))))))",
"processed_size": 556,
"rewrites": 178
},
"result":
{
"edges": 9,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 588
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(F ((1 <= p855)) U ((1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511) AND (1 <= p831)))",
"processed_size": 193,
"rewrites": 178
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 706
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((X ((p762 <= 0)) AND (1 <= p677))))",
"processed_size": 41,
"rewrites": 178
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 706
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (F ((F ((1 <= p991)) OR (G (((p991 <= 0) AND ((1 <= p52) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) AND F ((1 <= p991))))))",
"processed_size": 245,
"rewrites": 178
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 883
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p670 <= 0)",
"processed_size": 11,
"rewrites": 180
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1177
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "F (G (((p279 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))",
"processed_size": 181,
"rewrites": 178
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1766
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p869 <= 0))",
"processed_size": 15,
"rewrites": 178
},
"result":
{
"edges": 422,
"markings": 213,
"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": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3532
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 35,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p232) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) OR F ((G ((F ((1 <= p928)) AND (((1 <= p232) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) OR (1 <= p928)))) AND ((p232 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))))",
"processed_size": 587,
"rewrites": 178
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 169432,
"runtime": 38.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((** U **)) : X((X((X((F(**) OR **)) OR G(**))) AND **)) : ((F(**) U **) OR (F(**) AND F(G((F(**) AND (** OR X(**))))))) : G(F((F((X(**) OR **)) OR G(**)))) : F((G(**) OR F((G((F(**) AND (** OR **))) AND **)))) : F(G(*)) : G(*) : F(**) : G((X((X(*) OR (* OR *))) OR (G(*) OR (* OR (* OR (* OR (* OR (* OR (* OR (* OR (* OR (* OR (* OR *))))))))))))) : X((F(G(**)) OR (G(**) AND F(G(**))))) : ((F(**) U **) AND X(G((X(*) AND **)))) : X(F((F(**) OR (G((* AND **)) AND F(**)))))"
},
"net":
{
"arcs": 12060,
"conflict_clusters": 511,
"places": 1030,
"places_significant": 510,
"singleton_clusters": 0,
"transitions": 1020
},
"result":
{
"preliminary_value": "no no no no no no no no yes no no no ",
"value": "no no no no no no no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2050/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1030
lola: finding significant places
lola: 1030 places, 1020 transitions, 510 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: X ((((p360 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)) U ((1 <= p398) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) : X ((X ((X ((F (((1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511) AND (1 <= p720))) OR (1 <= p591))) OR G ((1 <= p972)))) AND ((p263 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)))) : (F (G (((1 <= p878) U X ((1 <= p871))))) U (F (((1 <= p434) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U (1 <= p878))) : G (F ((F ((((1 <= p177) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) U (X (X (((1 <= p313) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) OR X ((1 <= p555))))) OR X (G (((1 <= p262) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))))) : F ((G (((1 <= p232) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) OR F ((NOT(F (NOT(G ((((1 <= p232) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) U (1 <= p928)))))) AND ((p232 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)))))) : NOT(F (G (X (F (((1 <= p279) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))))) : NOT(F ((1 <= p869))) : F ((1 <= p670)) : NOT(F ((((((((((((((X ((X ((1 <= p745)) AND (1 <= p752))) AND X ((1 <= p745))) AND F ((1 <= p745))) AND (1 <= p297)) AND (1 <= p501)) AND (1 <= p502)) AND (1 <= p503)) AND (1 <= p504)) AND (1 <= p505)) AND (1 <= p506)) AND (1 <= p507)) AND (1 <= p508)) AND (1 <= p510)) AND (1 <= p511)))) : X ((G (((1 <= p128) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U NOT(G (NOT((((1 <= p735) OR (p128 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)) U G (X (((1 <= p128) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))))))))) : ((F ((1 <= p855)) U ((1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511) AND (1 <= p831))) AND NOT(F ((NOT(X (NOT(X ((1 <= p762))))) OR NOT(X ((1 <= p677))))))) : X (F (((NOT((((1 <= p52) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) U F ((1 <= p991)))) AND G (((1 <= p52) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) U F ((1 <= p991)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: 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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p360 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)) U ((1 <= p398) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p360 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)) U ((1 <= p398) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))
lola: processed formula length: 355
lola: 178 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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 1 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((X ((F (((1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511) AND (1 <= p720))) OR (1 <= p591))) OR G ((1 <= p972)))) AND ((p263 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((X ((F (((1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511) AND (1 <= p720))) OR (1 <= p591))) OR G ((1 <= p972)))) AND ((p263 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <... (shortened)
lola: processed formula length: 407
lola: 178 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 13 markings, 17 edges
lola: ========================================
lola: subprocess 2 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p434) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U (1 <= p878)) OR (F ((1 <= p878)) AND F (G ((F ((1 <= p871)) AND ((1 <= p878) OR X ((1 <= p871))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p878))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p878 <= 0)
lola: processed formula length: 11
lola: 180 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p434) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U (1 <= p878))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p434) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U (1 <= p878))
lola: processed formula length: 193
lola: 178 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: 3 markings, 3 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((X (((1 <= p313) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) OR (1 <= p555))) OR G (((1 <= p262) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((X (((1 <= p313) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) OR (1 <= p555))) OR G (((1 <= p262) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))))
lola: processed formula length: 389
lola: 178 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 20 edges
lola: ========================================
lola: subprocess 4 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((X ((p745 <= 0)) OR ((p752 <= 0) OR (p745 <= 0)))) OR (G ((p745 <= 0)) OR ((p297 <= 0) OR ((p501 <= 0) OR ((p502 <= 0) OR ((p503 <= 0) OR ((p504 <= 0) OR ((p505 <= 0) OR ((p506 <= 0) OR ((p507 <= 0) OR ((p508 <= 0) OR ((p510 <= 0) OR (p511 <= 0))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((X ((p745 <= 0)) OR ((p752 <= 0) OR (p745 <= 0)))) OR (G ((p745 <= 0)) OR ((p297 <= 0) OR ((p501 <= 0) OR ((p502 <= 0) OR ((p503 <= 0) OR ((p504 <= 0) OR ((p505 <= 0) OR ((p506 <= 0) OR ((p507 <= 0) OR ((p508 <= 0) OR ((p510 <= 0) OR (p511 <= 0))))))))))))))
lola: processed formula length: 265
lola: 178 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: 2034 markings, 11750 edges
lola: ========================================
lola: subprocess 5 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((1 <= p128) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) OR (G (((1 <= p128) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) AND F (G (((1 <= p128) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((1 <= p128) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) OR (G (((1 <= p128) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) AND F (G (((1 <= p128) AND (1 <=... (shortened)
lola: processed formula length: 556
lola: 178 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: add low 876
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 9 edges
lola: ========================================
lola: subprocess 6 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((1 <= p855)) U ((1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511) AND (1 <= p831))) AND X (G ((X ((p762 <= 0)) AND (1 <= p677)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p855)) U ((1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511) AND (1 <= p831)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((1 <= p855)) U ((1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511) AND (1 <= p831)))
lola: processed formula length: 193
lola: 178 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p762 <= 0)) AND (1 <= p677))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p762 <= 0)) AND (1 <= p677))))
lola: processed formula length: 41
lola: 178 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((1 <= p991)) OR (G (((p991 <= 0) AND ((1 <= p52) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) AND F ((1 <= p991))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((1 <= p991)) OR (G (((p991 <= 0) AND ((1 <= p52) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) AND F ((1 <= p991))))))
lola: processed formula length: 245
lola: 178 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p670))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p670 <= 0)
lola: processed formula length: 11
lola: 180 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 9 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p279 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p279 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))
lola: processed formula length: 181
lola: 178 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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p869 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p869 <= 0))
lola: processed formula length: 15
lola: 178 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: 213 markings, 422 edges
lola: ========================================
lola: subprocess 11 will run for 3532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p232) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) OR F ((G ((F ((1 <= p928)) AND (((1 <= p232) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) OR (1 <= p92... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p232) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) OR F ((G ((F ((1 <= p928)) AND (((1 <= p232) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) OR (1 <= p92... (shortened)
lola: processed formula length: 587
lola: 178 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no no
lola:
preliminary result: no no no no no no no no yes no no no
lola: memory consumption: 169432 KB
lola: time consumption: 38 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="RwMutex-PT-r0010w0500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is RwMutex-PT-r0010w0500, 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 r186-oct2-158987938800274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r0010w0500.tgz
mv RwMutex-PT-r0010w0500 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 ;