About the Execution of ITS-LoLa for Sudoku-COL-AN14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15748.210 | 3600000.00 | 12254.00 | 65.60 | TFTFTTTFTFTTTFFT | 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-159033547300258.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-COL-AN14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547300258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.6K May 14 04:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 04:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 21:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 21:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.6K May 13 15:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 15:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 10:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 13 10:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 20:42 equiv_pt
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 5 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN14-00
FORMULA_NAME Sudoku-COL-AN14-01
FORMULA_NAME Sudoku-COL-AN14-02
FORMULA_NAME Sudoku-COL-AN14-03
FORMULA_NAME Sudoku-COL-AN14-04
FORMULA_NAME Sudoku-COL-AN14-05
FORMULA_NAME Sudoku-COL-AN14-06
FORMULA_NAME Sudoku-COL-AN14-07
FORMULA_NAME Sudoku-COL-AN14-08
FORMULA_NAME Sudoku-COL-AN14-09
FORMULA_NAME Sudoku-COL-AN14-10
FORMULA_NAME Sudoku-COL-AN14-11
FORMULA_NAME Sudoku-COL-AN14-12
FORMULA_NAME Sudoku-COL-AN14-13
FORMULA_NAME Sudoku-COL-AN14-14
FORMULA_NAME Sudoku-COL-AN14-15
=== Now, execution of the tool begins
BK_START 1591292759276
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:46:01] [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 17:46:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:46:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-04 17:46:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 485 ms
[2020-06-04 17:46:01] [INFO ] sort/places :
N2->Rows,Cells,Columns,
N3->Board,
[2020-06-04 17:46:02] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2020-06-04 17:46:02] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2020-06-04 17:46:02] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2020-06-04 17:46:02] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 13 ms.
[2020-06-04 17:46:02] [INFO ] Computed order based on color domains.
[2020-06-04 17:46:02] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions in 59 ms.
[2020-06-04 17:46:02] [INFO ] Unfolded HLPN properties in 7 ms.
Deduced a syphon composed of 2700 places in 2 ms
Reduce places removed 2700 places and 2196 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 525 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 50000 resets, run finished after 114 ms. (steps per millisecond=877 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 1 rows 4 cols
[2020-06-04 17:46:02] [INFO ] Computed 3 place invariants in 1 ms
[2020-06-04 17:46:02] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 17:46:02] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 17:46:02] [INFO ] Flatten gal took : 22 ms
FORMULA Sudoku-COL-AN14-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 17:46:02] [INFO ] Applying decomposition
[2020-06-04 17:46:02] [INFO ] Flatten gal took : 2 ms
[2020-06-04 17:46:02] [INFO ] Decomposing Gal with order
[2020-06-04 17:46:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 17:46:02] [INFO ] Flatten gal took : 17 ms
[2020-06-04 17:46:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-06-04 17:46:02] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-04 17:46:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Sudoku-COL-AN14 @ 3570 seconds
FORMULA Sudoku-COL-AN14-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-COL-AN14-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-COL-AN14-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-COL-AN14-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-COL-AN14-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-COL-AN14-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-COL-AN14-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-COL-AN14-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-COL-AN14-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-COL-AN14-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-COL-AN14-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-COL-AN14-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLFireability @ Sudoku-COL-AN14
{
"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 17:46:03 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((((1 <= p0) AND (1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))",
"processed_size": 129,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 5,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (X (G ((X (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) AND ((1 <= p0) AND ((1 <= p2) AND (1 <= p3))))))))",
"processed_size": 111,
"rewrites": 91
},
"result":
{
"edges": 7,
"markings": 7,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"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": 1,
"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": "X (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))",
"processed_size": 43,
"rewrites": 91
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 2,
"X": 0,
"aconj": 9,
"adisj": 0,
"aneg": 3,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND (F ((G ((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3))))) OR (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))) OR G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))))",
"processed_size": 416,
"rewrites": 91
},
"result":
{
"edges": 101,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 28
},
"compoundnumber": 2,
"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": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (F ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) OR ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))) R ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))",
"processed_size": 136,
"rewrites": 91
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 396
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p0) AND (1 <= p2) AND (1 <= p3))",
"processed_size": 39,
"rewrites": 94
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))",
"processed_size": 39,
"rewrites": 93
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "X (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))",
"processed_size": 47,
"rewrites": 91
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))) AND G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))))",
"processed_size": 101,
"rewrites": 91
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "F ((X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) AND (X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))) OR F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))))",
"processed_size": 150,
"rewrites": 91
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) R (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) R (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))))",
"processed_size": 181,
"rewrites": 91
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))",
"processed_size": 51,
"rewrites": 91
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))) OR ((p0 <= 0) OR ((p2 <= 0) OR (p3 <= 0)))))",
"processed_size": 96,
"rewrites": 91
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 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": 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 (((1 <= p0) AND (1 <= p2) AND (1 <= p3))))",
"processed_size": 47,
"rewrites": 91
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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": 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 (((1 <= p0) AND (1 <= p2) AND (1 <= p3))))",
"processed_size": 47,
"rewrites": 91
},
"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": 3568
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))))",
"processed_size": 93,
"rewrites": 91
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 34992,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G(**)) OR G(F(*))) : (X(X(X(G((X(X(**)) AND (** AND (** AND **))))))) AND (** U **)) : ((** U (* AND (F((G((F(**) AND (** OR **))) OR (* AND (** U **)))) OR G(*)))) OR X(**)) : F(G(**)) : (X(F((* OR *))) R *) : (X(G(**)) AND (G(**) OR (F(**) AND (** AND (** AND **))))) : X((X(F(*)) AND G(**))) : F((X(G(**)) AND (X(**) OR F(**)))) : F(G(**)) : X((* R (* R (G(*) AND *)))) : X(X(F(**))) : G((X(F(*)) OR (** OR (** OR **))))"
},
"net":
{
"arcs": 4,
"conflict_clusters": 2,
"places": 4,
"places_significant": 1,
"singleton_clusters": 0,
"transitions": 1
},
"result":
{
"preliminary_value": "yes no yes no yes yes yes no no yes no yes ",
"value": "yes no yes no yes yes yes no no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 128
lola: finding significant places
lola: 4 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: (F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) OR F (X (NOT(G (F (G ((((1 <= p0) AND (1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))))))) : (G (X (X (X ((((X (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) AND (1 <= p0)) AND (1 <= p2)) AND (1 <= p3)))))) AND ((((1 <= p0) AND (1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) : ((((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U NOT((G ((((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U NOT((((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3))))) OR X (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) : X (NOT(G (F (X (G (NOT(G (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))))))) : NOT((X (G ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) AND G (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))) U ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))) : (G (X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))) AND (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) OR (((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) AND (1 <= p0)) AND (1 <= p2)) AND (1 <= p3)))) : (X (F (X (NOT(G (((1 <= p0) AND (1 <= p2) AND (1 <= p3))))))) AND X (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))) : F ((G (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) AND (X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))) OR F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))))) : G (F (((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) AND NOT((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3))))) U G (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))) : X (NOT((((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U (((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3))))))) : F (X (F (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))) : G ((((X (NOT(G (((1 <= p0) AND (1 <= p2) AND (1 <= p3))))) OR (p0 <= 0)) OR (p2 <= 0)) OR (p3 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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: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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (G ((X (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) AND ((1 <= p0) AND ((1 <= p2) AND (1 <= p3)))))))) AND ((((1 <= p0) AND (1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p0) AND (1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p0) AND (1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))
lola: processed formula length: 129
lola: 91 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((X (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) AND ((1 <= p0) AND ((1 <= p2) AND (1 <= p3))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((X (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) AND ((1 <= p0) AND ((1 <= p2) AND (1 <= p3))))))))
lola: processed formula length: 111
lola: 91 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND (F ((G ((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3))))) OR (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))) OR G (((p0 <= 0) OR (p2 <= 0) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))
lola: processed formula length: 43
lola: 91 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: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND (F ((G ((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3))))) OR (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))) OR G (((p0 <= 0) OR (p2 <= 0) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND (F ((G ((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3))))) OR (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p3)) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))) OR G (((p0 <= 0) OR (p2 <= 0) OR... (shortened)
lola: processed formula length: 416
lola: 91 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 28 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: 17 markings, 101 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) OR ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))) R ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))
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 ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))) R ((1 <= p0) AND (1 <= p2) AND (1 <= p3)))
lola: processed formula length: 136
lola: 91 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))) AND (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) OR (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3))) AND ((1 <= p0) AND ((1 <= p2) AND (1 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) AND ((1 <= p2) AND (1 <= p3)))
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: processed formula: ((1 <= p0) AND (1 <= p2) AND (1 <= p3))
lola: processed formula length: 39
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
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 4 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))
lola: processed formula length: 39
lola: 93 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))
lola: processed formula length: 47
lola: 91 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: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))) AND G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))) AND G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))))
lola: processed formula length: 101
lola: 91 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) AND (X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))) OR F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) AND (X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))) OR F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))))
lola: processed formula length: 150
lola: 91 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) R (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) R (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))))
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)) R (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) R (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))))
lola: processed formula length: 181
lola: 91 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))))
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)))))
lola: processed formula length: 51
lola: 91 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: subprocess 8 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))) OR ((p0 <= 0) OR ((p2 <= 0) OR (p3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))) OR ((p0 <= 0) OR ((p2 <= 0) OR (p3 <= 0)))))
lola: processed formula length: 96
lola: 91 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3))))
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))))
lola: processed formula length: 47
lola: 91 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3))))
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))))
lola: processed formula length: 47
lola: 91 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 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3)))) OR G (F ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0)))))
lola: processed formula length: 93
lola: 91 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: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes yes no no yes no yes
lola:
preliminary result: yes no yes no yes yes yes no no yes no yes
lola: memory consumption: 34992 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-COL-AN14"
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-COL-AN14, 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-159033547300258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN14.tgz
mv Sudoku-COL-AN14 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 ;