About the Execution of 2020-gold for Sudoku-PT-AN02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4348.915 | 3600000.00 | 7614.00 | 221.70 | FTTTFFFTFTFTFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800600282.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is Sudoku-PT-AN02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800600282
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 33K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 207K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.9K Mar 28 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 28 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Mar 28 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.3K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 7.4K May 5 16:52 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN02-00
FORMULA_NAME Sudoku-PT-AN02-01
FORMULA_NAME Sudoku-PT-AN02-02
FORMULA_NAME Sudoku-PT-AN02-03
FORMULA_NAME Sudoku-PT-AN02-04
FORMULA_NAME Sudoku-PT-AN02-05
FORMULA_NAME Sudoku-PT-AN02-06
FORMULA_NAME Sudoku-PT-AN02-07
FORMULA_NAME Sudoku-PT-AN02-08
FORMULA_NAME Sudoku-PT-AN02-09
FORMULA_NAME Sudoku-PT-AN02-10
FORMULA_NAME Sudoku-PT-AN02-11
FORMULA_NAME Sudoku-PT-AN02-12
FORMULA_NAME Sudoku-PT-AN02-13
FORMULA_NAME Sudoku-PT-AN02-14
FORMULA_NAME Sudoku-PT-AN02-15
=== Now, execution of the tool begins
BK_START 1621208814020
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 23:46:55] [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-16 23:46:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 23:46:55] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-16 23:46:55] [INFO ] Transformed 20 places.
[2021-05-16 23:46:55] [INFO ] Transformed 8 transitions.
[2021-05-16 23:46:55] [INFO ] Parsed PT model containing 20 places and 8 transitions in 63 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 7 steps, including 1 resets, run visited all 28 properties in 2 ms. (steps per millisecond=3 )
[2021-05-16 23:46:55] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-16 23:46:55] [INFO ] Flatten gal took : 28 ms
FORMULA Sudoku-PT-AN02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 23:46:55] [INFO ] Flatten gal took : 5 ms
[2021-05-16 23:46:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2021-05-16 23:46:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Sudoku-PT-AN02 @ 3570 seconds
FORMULA Sudoku-PT-AN02-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN02-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN02-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN02-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN02-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN02-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN02-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN02-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ Sudoku-PT-AN02
{
"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": "Sun May 16 23:46:56 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 40,
"adisj": 3,
"aneg": 0,
"comp": 120,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 1,
"tdisj": 17,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((F ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))) OR (((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR (((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR (((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR (((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR (((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR (((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR (((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR (((1 <= p3) AND (1 <= p14) AND (1 <= p17)) OR (G ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))) AND F ((F ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))) OR (((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR (((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR (((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR (((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR (((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR (((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR (((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))))))))))))))))))))))",
"processed_size": 1880,
"rewrites": 189
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 25,
"adisj": 3,
"aneg": 1,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((G (((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))) OR (((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))))) AND F ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))))))",
"processed_size": 1121,
"rewrites": 189
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 24,
"adisj": 3,
"aneg": 0,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G ((X (((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))) U (((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))))) AND (((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))))",
"processed_size": 1115,
"rewrites": 189
},
"result":
{
"edges": 9,
"markings": 9,
"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": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0))))",
"processed_size": 49,
"rewrites": 189
},
"result":
{
"edges": 208,
"markings": 61,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p2) AND (1 <= p15) AND (1 <= p18))))",
"processed_size": 49,
"rewrites": 189
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0))))",
"processed_size": 49,
"rewrites": 189
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X ((F (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)))) OR (G (((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0))) AND F (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)))))))",
"processed_size": 244,
"rewrites": 189
},
"result":
{
"edges": 75,
"markings": 65,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (X (G (((((1 <= p1) AND (1 <= p13) AND (1 <= p19)) U X (F (((1 <= p0) AND (1 <= p13) AND (1 <= p18))))) OR (((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p18)))))))",
"processed_size": 201,
"rewrites": 189
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 713
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0))",
"processed_size": 39,
"rewrites": 192
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 3,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (((X ((((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)))) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0))) OR F (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)))))",
"processed_size": 196,
"rewrites": 189
},
"result":
{
"edges": 171,
"markings": 87,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((G (((1 <= p0) AND (1 <= p13) AND (1 <= p18))) OR (F (G (((1 <= p0) AND (1 <= p13) AND (1 <= p18)))) AND F (G (((1 <= p2) AND (1 <= p14) AND (1 <= p16))))))))",
"processed_size": 164,
"rewrites": 189
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 2,
"aneg": 3,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G (((F ((((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)))) OR G (((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)))) AND ((1 <= p2) AND ((1 <= p14) AND (1 <= p16)))))))",
"processed_size": 206,
"rewrites": 189
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 24,
"adisj": 3,
"aneg": 3,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F (((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))) AND (F (G ((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))))) OR G ((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))))))))",
"processed_size": 1128,
"rewrites": 189
},
"result":
{
"edges": 1296,
"markings": 215,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 0,
"aconj": 40,
"adisj": 3,
"aneg": 19,
"comp": 120,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 17,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F ((G ((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0)))) AND (((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND (((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND (((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND (((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND (((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND (((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND (G ((G ((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0)))) AND (((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND (((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND (((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND (((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND (((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))))))))))) OR G (F ((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))))))))))))))))",
"processed_size": 1900,
"rewrites": 189
},
"result":
{
"edges": 7394,
"markings": 611,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 21
},
"compoundnumber": 10,
"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": 82648,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((* AND (F(G(*)) OR G(*))))) : X((F(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (G(**) AND F((F(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))))))))))) : X((G(*) AND F(**))) : G((X((** U **)) AND **)) : F((G(*) AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND (G((G(*) AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND *))))))))) OR G(F(*))))))))))))) : (X(G(*)) OR (G(F(**)) AND F(G(*)))) : X((F(**) OR (G(**) AND F(**)))) : X(X(G(((** U X(F(**))) OR (** OR **))))) : (G(((X(*) AND *) OR F(*))) OR (** OR (** OR **))) : X(F((G(**) OR (F(G(**)) AND F(G(**)))))) : X(X(G(((F(**) OR G(**)) AND (* AND (* AND *))))))"
},
"net":
{
"arcs": 32,
"conflict_clusters": 9,
"places": 20,
"places_significant": 8,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "yes yes no no yes no yes no yes no no ",
"value": "yes yes no no yes no yes no yes 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: 28/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 20
lola: finding significant places
lola: 20 places, 8 transitions, 8 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: F (G (NOT(F (G ((F (G (F ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))))) U (((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))))))))) : X ((G ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))) U ((((((((F ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p18))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16))) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18))) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19))) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16))) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17))) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19))) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))))) : X ((NOT(F (((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))) AND (((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))))) AND F ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))))) : G (((X ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))) U X ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))))) AND (((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))))) : NOT(G ((F (X (G ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))))) U ((((((((F ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p18))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16))) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18))) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19))) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16))) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17))) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19))) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))))) : (F (G (F (((1 <= p2) AND (1 <= p15) AND (1 <= p18))))) U NOT(X (F (((1 <= p0) AND (1 <= p12) AND (1 <= p16)))))) : X ((G (((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0))) U F (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)))))) : G (X (X ((((((1 <= p1) AND (1 <= p13) AND (1 <= p19)) U X (F (((1 <= p0) AND (1 <= p13) AND (1 <= p18))))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16))) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p18)))))) : (((NOT(F (((X ((((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)))) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19))) AND G (((1 <= p2) AND (1 <= p15) AND (1 <= p18)))))) OR (p1 <= 0)) OR (p13 <= 0)) OR (p19 <= 0)) : F (X ((G (F (X (F ((((1 <= p2) AND (1 <= p14) AND (1 <= p16)) U G (X (((1 <= p2) AND (1 <= p14) AND (1 <= p16))))))))) U G (((1 <= p0) AND (1 <= p13) AND (1 <= p18)))))) : G (X (NOT(X (((((NOT(F ((((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16))))) AND NOT(G (((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0))))) OR (p2 <= 0)) OR (p14 <= 0)) OR (p16 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))) OR (((1 <= p0) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))) OR (((1 <= p0) AND (1 <= p... (shortened)
lola: processed formula length: 1880
lola: 189 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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))) OR (((p0 <= 0) OR (p13 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))) OR (((p0 <= 0) OR (p13 <... (shortened)
lola: processed formula length: 1121
lola: 189 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: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))) U (((1 <= p0) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))) U (((1 <= p0) AND (1 <= p1... (shortened)
lola: processed formula length: 1115
lola: 189 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)))) OR (G (F (((1 <= p2) AND (1 <= p15) AND (1 <= p18)))) AND F (G (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 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 (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0))))
lola: processed formula length: 49
lola: 189 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: 61 markings, 208 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p2) AND (1 <= p15) AND (1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p2) AND (1 <= p15) AND (1 <= p18))))
lola: processed formula length: 49
lola: 189 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0))))
lola: processed formula length: 49
lola: 189 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)))) OR (G (((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0))) AND F (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)))) OR (G (((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0))) AND F (((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)))))))
lola: processed formula length: 244
lola: 189 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 65 markings, 75 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((((1 <= p1) AND (1 <= p13) AND (1 <= p19)) U X (F (((1 <= p0) AND (1 <= p13) AND (1 <= p18))))) OR (((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p18)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((((1 <= p1) AND (1 <= p13) AND (1 <= p19)) U X (F (((1 <= p0) AND (1 <= p13) AND (1 <= p18))))) OR (((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p18)))))))
lola: processed formula length: 201
lola: 189 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((X ((((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)))) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0))) OR F (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0))))) OR ((p1 <= 0) OR ((p13 <= 0) OR (p19 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1 <= 0) OR ((p13 <= 0) OR (p19 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0))
lola: processed formula length: 39
lola: 192 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X ((((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)))) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0))) OR F (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X ((((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)))) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0))) OR F (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)))))
lola: processed formula length: 196
lola: 189 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: 87 markings, 171 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((1 <= p0) AND (1 <= p13) AND (1 <= p18))) OR (F (G (((1 <= p0) AND (1 <= p13) AND (1 <= p18)))) AND F (G (((1 <= p2) AND (1 <= p14) AND (1 <= p16))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((1 <= p0) AND (1 <= p13) AND (1 <= p18))) OR (F (G (((1 <= p0) AND (1 <= p13) AND (1 <= p18)))) AND F (G (((1 <= p2) AND (1 <= p14) AND (1 <= p16))))))))
lola: processed formula length: 164
lola: 189 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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((F ((((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)))) OR G (((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)))) AND ((1 <= p2) AND ((1 <= p14) AND (1 <= p16)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((F ((((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)))) OR G (((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)))) AND ((1 <= p2) AND ((1 <= p14) AND (1 <= p16)))))))
lola: processed formula length: 206
lola: 189 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))) AND (F (G ((((p0 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))) AND (F (G ((((p0 <= 0) OR ... (shortened)
lola: processed formula length: 1128
lola: 189 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 215 markings, 1296 edges
lola: ========================================
lola: subprocess 10 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0)))) AND (((p0 <= 0) OR (p13 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0)))) AND (((p0 <= 0) OR (p13 <... (shortened)
lola: processed formula length: 1900
lola: 189 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 21 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: 611 markings, 7394 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes no yes no yes no no
lola:
preliminary result: yes yes no no yes no yes no yes no no
lola: memory consumption: 82648 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN02"
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 Sudoku-PT-AN02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-162106800600282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN02.tgz
mv Sudoku-PT-AN02 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 ;