fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r228-oct2-159033547400290
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Sudoku-COL-BN04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15737.660 3600000.00 17762.00 156.90 TTTFTFFTFFFFTFTF 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-159033547400290.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-BN04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547400290
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 4.0K May 14 04:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 04:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 21:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 21:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K 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.0K May 14 10:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.9K May 13 15:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 15:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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.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 36K 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-BN04-00
FORMULA_NAME Sudoku-COL-BN04-01
FORMULA_NAME Sudoku-COL-BN04-02
FORMULA_NAME Sudoku-COL-BN04-03
FORMULA_NAME Sudoku-COL-BN04-04
FORMULA_NAME Sudoku-COL-BN04-05
FORMULA_NAME Sudoku-COL-BN04-06
FORMULA_NAME Sudoku-COL-BN04-07
FORMULA_NAME Sudoku-COL-BN04-08
FORMULA_NAME Sudoku-COL-BN04-09
FORMULA_NAME Sudoku-COL-BN04-10
FORMULA_NAME Sudoku-COL-BN04-11
FORMULA_NAME Sudoku-COL-BN04-12
FORMULA_NAME Sudoku-COL-BN04-13
FORMULA_NAME Sudoku-COL-BN04-14
FORMULA_NAME Sudoku-COL-BN04-15

=== Now, execution of the tool begins

BK_START 1591292959501

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:49:23] [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:49:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:49:23] [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:49:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 683 ms
[2020-06-04 17:49:24] [INFO ] sort/places :
N2->Rows,Regions,Cells,Columns,
N3->Board,

[2020-06-04 17:49:24] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-06-04 17:49:24] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-06-04 17:49:24] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-06-04 17:49:24] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-06-04 17:49:24] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-06-04 17:49:24] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-06-04 17:49:24] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 63 PT places and 81.0 transition bindings in 52 ms.
[2020-06-04 17:49:24] [INFO ] Computed order based on color domains.
[2020-06-04 17:49:24] [INFO ] Unfolded HLPN to a Petri net with 63 places and 3 transitions in 15 ms.
[2020-06-04 17:49:24] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 2 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 61 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 50000 resets, run finished after 172 ms. (steps per millisecond=581 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1 rows 5 cols
[2020-06-04 17:49:24] [INFO ] Computed 4 place invariants in 3 ms
[2020-06-04 17:49:25] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 17:49:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 17:49:25] [INFO ] Flatten gal took : 24 ms
FORMULA Sudoku-COL-BN04-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 17:49:25] [INFO ] Applying decomposition
[2020-06-04 17:49:25] [INFO ] Flatten gal took : 2 ms
[2020-06-04 17:49:25] [INFO ] Decomposing Gal with order
[2020-06-04 17:49:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 17:49:25] [INFO ] Flatten gal took : 15 ms
[2020-06-04 17:49:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-06-04 17:49:25] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-04 17:49:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Sudoku-COL-BN04 @ 3570 seconds

FORMULA Sudoku-COL-BN04-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-BN04-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-BN04-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-BN04-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-BN04-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-BN04-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-BN04-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-BN04-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-BN04-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-BN04-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-BN04-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-BN04-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ Sudoku-COL-BN04

{
"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:49:25 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"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": "X (F ((G (F (((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 ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))))))",
"processed_size": 192,
"rewrites": 117
},
"result":
{
"edges": 5,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))) U ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))",
"processed_size": 183,
"rewrites": 117
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 11,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 9,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) OR ((p0 <= 0) OR ((p2 <= 0) OR ((p3 <= 0) OR (p4 <= 0))))) AND (F (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR G ((X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) OR ((p0 <= 0) OR ((p2 <= 0) OR ((p3 <= 0) OR (p4 <= 0)))))))))",
"processed_size": 316,
"rewrites": 117
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (F ((G (F (((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": 132,
"rewrites": 117
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))",
"processed_size": 53,
"rewrites": 117
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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 (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))",
"processed_size": 57,
"rewrites": 117
},
"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": 4,
"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": 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 (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))",
"processed_size": 61,
"rewrites": 117
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 1,
"aneg": 7,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 6,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F ((X ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) OR ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR ((p0 <= 0) OR ((p2 <= 0) OR ((p3 <= 0) OR (p4 <= 0)))))) OR (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))))",
"processed_size": 303,
"rewrites": 117
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 4,
"G": 1,
"U": 0,
"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": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((X (F ((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)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) OR F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))",
"processed_size": 262,
"rewrites": 117
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 117
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1189
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) OR 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 ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))",
"processed_size": 303,
"rewrites": 117
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"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": 117
},
"result":
{
"edges": 3,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) R ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))",
"processed_size": 115,
"rewrites": 117
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) R ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))",
"processed_size": 115,
"rewrites": 117
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 12,
"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": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 4,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F (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 ((p0 <= 0) OR ((p2 <= 0) OR ((p3 <= 0) OR (p4 <= 0))))))",
"processed_size": 185,
"rewrites": 117
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"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": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 41340,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((* OR G((F(**) AND (** OR **))))) : X(F((G(F(*)) OR (G(**) AND **)))) : ((G(*) R *) OR G((F(G(**)) OR (* OR (* OR (* OR *)))))) : ((G(**) AND X(F(**))) U **) : X(((X(*) OR (* OR (* OR (* OR *)))) AND (F(G(*)) OR G((X(*) OR (* OR (* OR (* OR *)))))))) : X(X(F((G(F(**)) OR **)))) : F(G(**)) : G(**) : (X(**) AND (G(**) OR **)) : X(F(**)) : X((F((X((* OR *)) OR (* OR (* OR (* OR *))))) OR *)) : F(G((X(F((X(X(F(**))) OR (** OR **)))) OR F(**))))"
},
"net":
{
"arcs": 5,
"conflict_clusters": 2,
"places": 5,
"places_significant": 1,
"singleton_clusters": 0,
"transitions": 1
},
"result":
{
"preliminary_value": "yes yes no no yes no no no no no yes no ",
"value": "yes yes no no yes no no no no 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(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)))) AND G (F (NOT((((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 ((NOT(X (X (F (G (((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 ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))))) : (NOT((F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) U ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) OR NOT(F (((((G (NOT(G ((((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) AND (1 <= p0)) AND (1 <= p2)) AND (1 <= p3)) AND (1 <= p4))))) : ((NOT((X (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) U NOT(G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) AND X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))) U ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) : NOT(X ((F (G (F (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) U ((((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 (X (F ((X ((((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) U G (F (G (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) : G (F (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))) : G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) : (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND (G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) : X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))) : (NOT(X (G ((((((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)))) AND (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)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) : F (G ((X (F (((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))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))) OR F (((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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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: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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:356
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: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: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:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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 (F ((G (F (((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 ((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 ((G (F (((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 ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))))))
lola: processed formula length: 192
lola: 117 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, 5 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))) U ((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 (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))) U ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))
lola: processed formula length: 183
lola: 117 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) OR ((p0 <= 0) OR ((p2 <= 0) OR ((p3 <= 0) OR (p4 <= 0))))) AND (F (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR G ((X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) 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 (((X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) OR ((p0 <= 0) OR ((p2 <= 0) OR ((p3 <= 0) OR (p4 <= 0))))) AND (F (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR G ((X (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) OR ((p0 <= 0) OR ((p2 <= 0) OR ((p3 <= 0) OR (p4 <= 0)))))))))
lola: processed formula length: 316
lola: 117 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: 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 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G (F (((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: X (X (F ((G (F (((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: 132
lola: 117 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))) AND (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 4 will run for 445 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: processed formula: ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))
lola: processed formula length: 53
lola: 117 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 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 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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 (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))
lola: processed formula length: 57
lola: 117 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 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((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 (F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))
lola: processed formula length: 61
lola: 117 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((X ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) OR ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR ((p0 <= 0) OR ((p2 <= 0) OR ((p3 <= 0) OR (p4 <= 0)))))) OR (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((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 ((X ((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) OR ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))) OR ((p0 <= 0) OR ((p2 <= 0) OR ((p3 <= 0) OR (p4 <= 0)))))) OR (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))))
lola: processed formula length: 303
lola: 117 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, 1 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F ((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)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) OR F (((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: F (G ((X (F ((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)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))) OR F (((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4))))))
lola: processed formula length: 262
lola: 117 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 6 edges
lola: ========================================
lola: subprocess 8 will run for 891 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: 117 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 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) OR 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 ((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: F (((((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) OR 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 ((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)))))))
lola: processed formula length: 303
lola: 117 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: 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 10 will run for 1783 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: 117 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: subprocess 11 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) R ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) OR G ((F (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 ((p0 <= 0) OR ((p2 <= 0) OR ((p3 <= 0) OR (p4 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) R ((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 (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) R ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))
lola: processed formula length: 115
lola: 117 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2 markings, 2 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 (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) R ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) OR G ((F (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 ((p0 <= 0) OR ((p2 <= 0) OR ((p3 <= 0) OR (p4 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (G (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) R ((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 (((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0))) R ((p0 <= 0) OR (p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)))
lola: processed formula length: 115
lola: 117 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2 markings, 2 edges
lola: ========================================
lola: ...considering subproblem: G ((F (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 ((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 ((((1 <= p0) AND (1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR ((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: 185
lola: 117 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: 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: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes no no no no no yes no
lola:
preliminary result: yes yes no no yes no no no no no yes no
lola: memory consumption: 41340 KB
lola: time consumption: 4 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-BN04"
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-BN04, 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-159033547400290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-BN04.tgz
mv Sudoku-COL-BN04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;