About the Execution of ITS-LoLa for Sudoku-PT-BN01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.570 | 3600000.00 | 9058.00 | 50.60 | FFFTTTFFTFFFTFTF | 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.r228-oct2-159033547600442.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 Sudoku-PT-BN01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547600442
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.6K May 14 04:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 04:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 21:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 21:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 10:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 14 10:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 14 10:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 15:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 15:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 13 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.3K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 1.6K May 12 20:42 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-BN01-00
FORMULA_NAME Sudoku-PT-BN01-01
FORMULA_NAME Sudoku-PT-BN01-02
FORMULA_NAME Sudoku-PT-BN01-03
FORMULA_NAME Sudoku-PT-BN01-04
FORMULA_NAME Sudoku-PT-BN01-05
FORMULA_NAME Sudoku-PT-BN01-06
FORMULA_NAME Sudoku-PT-BN01-07
FORMULA_NAME Sudoku-PT-BN01-08
FORMULA_NAME Sudoku-PT-BN01-09
FORMULA_NAME Sudoku-PT-BN01-10
FORMULA_NAME Sudoku-PT-BN01-11
FORMULA_NAME Sudoku-PT-BN01-12
FORMULA_NAME Sudoku-PT-BN01-13
FORMULA_NAME Sudoku-PT-BN01-14
FORMULA_NAME Sudoku-PT-BN01-15
=== Now, execution of the tool begins
BK_START 1591302977604
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:36: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 20:36:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:36:19] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2020-06-04 20:36:19] [INFO ] Transformed 5 places.
[2020-06-04 20:36:19] [INFO ] Transformed 1 transitions.
[2020-06-04 20:36:19] [INFO ] Parsed PT model containing 5 places and 1 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 2 steps, including 1 resets, run visited all 7 properties in 1 ms. (steps per millisecond=2 )
[2020-06-04 20:36:19] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 20:36:19] [INFO ] Flatten gal took : 17 ms
FORMULA Sudoku-PT-BN01-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 20:36:19] [INFO ] Flatten gal took : 2 ms
[2020-06-04 20:36:19] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-04 20:36:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Sudoku-PT-BN01 @ 3570 seconds
FORMULA Sudoku-PT-BN01-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN01-11 FALSE 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-BN01
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 20:36:20 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))",
"processed_size": 249,
"rewrites": 110
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "G (((X (X (X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))",
"processed_size": 200,
"rewrites": 110
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))",
"processed_size": 53,
"rewrites": 115
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))))",
"processed_size": 128,
"rewrites": 110
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 5,
"aconj": 5,
"adisj": 0,
"aneg": 2,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((X ((X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND X (F ((X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))))))))",
"processed_size": 330,
"rewrites": 110
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 10,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) AND ((1 <= p0) AND ((1 <= p2) AND ((1 <= p3) AND (1 <= p4))))) OR (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND F ((X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) AND ((1 <= p0) AND ((1 <= p2) AND ((1 <= p3) AND (1 <= p4))))))))))",
"processed_size": 388,
"rewrites": 110
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 20
},
"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": 446
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))",
"processed_size": 61,
"rewrites": 110
},
"result":
{
"edges": 3,
"markings": 3,
"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": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))))",
"processed_size": 61,
"rewrites": 110
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 3,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND F (G ((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))))))))",
"processed_size": 323,
"rewrites": 110
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 5,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (X (X (X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))))))))",
"processed_size": 77,
"rewrites": 110
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"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": 892
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))",
"processed_size": 61,
"rewrites": 110
},
"result":
{
"edges": 3,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))",
"processed_size": 61,
"rewrites": 110
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))",
"processed_size": 61,
"rewrites": 110
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))",
"processed_size": 57,
"rewrites": 110
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))",
"processed_size": 57,
"rewrites": 110
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))",
"processed_size": 120,
"rewrites": 110
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 43412,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((G(*) R F(*)) AND F(G(**))) : X(X((F(**) OR ((X(**) U **) OR G(**))))) : G(((X(X(X(F(**)))) OR *) AND F(G(**)))) : (G((F(G(*)) OR X(*))) AND (** AND (** AND (** AND **)))) : X(G((X((X(G(**)) OR *)) OR (G(**) AND X(F((X(G(**)) OR *))))))) : X((* AND ((X(F(**)) AND (** AND (** AND (** AND **)))) OR (G(**) AND F((X(F(**)) AND (** AND (** AND (** AND **))))))))) : (X(G(**)) AND F(((X(F(**)) OR **) AND G(**)))) : F(G(**)) : (G((G(**) OR **)) OR (G(**) AND F(G((G(**) OR **))))) : X(F(**)) : X(X(F((** OR (F(**) AND F(G((F(**) AND (** OR X(**)))))))))) : X(X(X(X(X(F(*)))))) : (G(F(**)) AND X(**))"
},
"net":
{
"arcs": 5,
"conflict_clusters": 2,
"places": 5,
"places_significant": 1,
"singleton_clusters": 0,
"transitions": 1
},
"result":
{
"preliminary_value": "no no no yes yes no no no no yes no yes no ",
"value": "no no no yes yes no no no no yes no yes 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: 6/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 160
lola: finding significant places
lola: 5 places, 1 transitions, 1 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: (NOT((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) U G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))) AND (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) U F (X (G (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))) : X (X (((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) : G (NOT(F (((NOT(X (X (X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) OR NOT(F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))))) : ((((G ((NOT(G (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))) OR NOT(X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) AND (1 <= p0)) AND (1 <= p2)) AND (1 <= p3)) AND (1 <= p4)) : X (G ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) U (NOT(X (F (X (NOT(G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))) OR NOT(X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))) : (NOT(X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) AND X ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) U ((((X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) AND (1 <= p0)) AND (1 <= p2)) AND (1 <= p3)) AND (1 <= p4))))) : (X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) AND F ((((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) U ((X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))) : F ((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) U F ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) U G (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))) : (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) U G ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))) : F (X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) : F (X (X (F ((F (G ((((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) U X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))) : F (X (F (X (X (F (X (NOT(G (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))))))) : ((((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) U G (F (X (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))) AND X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))
lola: processed formula length: 249
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (X (X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (X (X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))
lola: processed formula length: 200
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))))) AND ((1 <= p0) AND ((1 <= p2) AND ((1 <= p3) AND (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) AND ((1 <= p2) AND ((1 <= p3) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))
lola: processed formula length: 53
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: ========================================
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))))
lola: processed formula length: 128
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND X (F ((X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND X (F ((X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))))))))
lola: processed formula length: 330
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) AND ((1 <= p0) AND ((1 <= p2) AND ((1 <= p3) AND (1 <= p4))))) OR (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND F ((X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) AND ((1 <= p0) AND ((1 <= p2) AND ((1 <= p3) AND (1 <= p4))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) AND ((1 <= p0) AND ((1 <= p2) AND ((1 <= p3) AND (1 <= p4))))) OR (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND F ((X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) AND ((1 <= p0) AND ((1 <= p2) AND ((1 <= p3) AND (1 <= p4))))))))))
lola: processed formula length: 388
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 20 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) AND F (((X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: processed formula length: 61
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))))
lola: processed formula length: 61
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND F (G ((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND F (G ((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))))))))
lola: processed formula length: 323
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))))))))
lola: processed formula length: 77
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) AND X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
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 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: processed formula length: 61
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: processed formula length: 61
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) R F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) AND F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: processed formula length: 61
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND F (G ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))
lola: processed formula length: 57
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND F (G ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))
lola: processed formula length: 57
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: processed formula length: 120
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes no no no no yes no yes no
lola:
preliminary result: no no no yes yes no no no no yes no yes no
lola: memory consumption: 43412 KB
lola: time consumption: 2 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-BN01"
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 Sudoku-PT-BN01, 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 r228-oct2-159033547600442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN01.tgz
mv Sudoku-PT-BN01 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 ;