Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800700378.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SwimmingPool-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800700378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SwimmingPool-PT-06-00
FORMULA_NAME SwimmingPool-PT-06-01
FORMULA_NAME SwimmingPool-PT-06-02
FORMULA_NAME SwimmingPool-PT-06-03
FORMULA_NAME SwimmingPool-PT-06-04
FORMULA_NAME SwimmingPool-PT-06-05
FORMULA_NAME SwimmingPool-PT-06-06
FORMULA_NAME SwimmingPool-PT-06-07
FORMULA_NAME SwimmingPool-PT-06-08
FORMULA_NAME SwimmingPool-PT-06-09
FORMULA_NAME SwimmingPool-PT-06-10
FORMULA_NAME SwimmingPool-PT-06-11
FORMULA_NAME SwimmingPool-PT-06-12
FORMULA_NAME SwimmingPool-PT-06-13
FORMULA_NAME SwimmingPool-PT-06-14
FORMULA_NAME SwimmingPool-PT-06-15

=== Now, execution of the tool begins

BK_START 1621226207026

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 04:36:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-17 04:36:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:36:48] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-17 04:36:48] [INFO ] Transformed 9 places.
[2021-05-17 04:36:48] [INFO ] Transformed 7 transitions.
[2021-05-17 04:36:48] [INFO ] Parsed PT model containing 9 places and 7 transitions in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 489 steps, including 0 resets, run visited all 14 properties in 4 ms. (steps per millisecond=122 )
[2021-05-17 04:36:48] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-17 04:36:48] [INFO ] Flatten gal took : 21 ms
FORMULA SwimmingPool-PT-06-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:36:48] [INFO ] Flatten gal took : 3 ms
[2021-05-17 04:36:48] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-17 04:36:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SwimmingPool-PT-06 @ 3570 seconds

FORMULA SwimmingPool-PT-06-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2292
rslt: Output for LTLFireability @ SwimmingPool-PT-06

{
"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": "Mon May 17 04:36:49 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((((X ((p5 <= 0)) U (p5 <= 0)) OR (1 <= p6)) AND (1 <= p6))))",
"processed_size": 66,
"rewrites": 83
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((X (((1 <= p3) AND (1 <= p7))) OR G (((1 <= p3) AND (1 <= p7)))) U (F ((1 <= p4)) OR (1 <= p4)))",
"processed_size": 97,
"rewrites": 83
},
"result":
{
"edges": 124194624,
"markings": 49168599,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 385
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 385
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((p5 <= 0)))",
"processed_size": 17,
"rewrites": 83
},
"result":
{
"edges": 133,
"markings": 133,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"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": "(((1 <= p3) AND (1 <= p7)) U X (F ((1 <= p2))))",
"processed_size": 47,
"rewrites": 83
},
"result":
{
"edges": 49049,
"markings": 21961,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 6,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(F ((1 <= p4)) U X (X (G ((G ((p2 <= 0)) OR X (X (X (X (((p3 <= 0) OR (p7 <= 0)))))))))))",
"processed_size": 90,
"rewrites": 83
},
"result":
{
"edges": 643243150,
"markings": 145253611,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 135
},
"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": 433
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p1) AND (1 <= p8))",
"processed_size": 25,
"rewrites": 83
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p4))",
"processed_size": 13,
"rewrites": 83
},
"result":
{
"edges": 426,
"markings": 426,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 607
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p1) AND (1 <= p8)))",
"processed_size": 29,
"rewrites": 83
},
"result":
{
"edges": 426,
"markings": 426,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 759
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p1 <= 0) OR (p8 <= 0))",
"processed_size": 25,
"rewrites": 85
},
"result":
{
"edges": 120,
"markings": 121,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 535
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p1) AND (1 <= p8))) OR (1 <= p4))))",
"processed_size": 52,
"rewrites": 83
},
"result":
{
"edges": 18200034,
"markings": 6255608,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 666
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F (G (((1 <= p6) OR (1 <= p5)))) OR ((1 <= p1) AND (1 <= p8))))",
"processed_size": 68,
"rewrites": 83
},
"result":
{
"edges": 241,
"markings": 242,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 888
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 888
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p6))",
"processed_size": 13,
"rewrites": 83
},
"result":
{
"edges": 427,
"markings": 427,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1332
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p4))",
"processed_size": 13,
"rewrites": 83
},
"result":
{
"edges": 426,
"markings": 426,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1332
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p0) AND (1 <= p7))))",
"processed_size": 33,
"rewrites": 83
},
"result":
{
"edges": 1428,
"markings": 837,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2664
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((p0 <= 0) OR (p7 <= 0))))",
"processed_size": 33,
"rewrites": 83
},
"result":
{
"edges": 126,
"markings": 126,
"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": "fairness",
"workflow": "product automaton"
}
},

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((p0 <= 0) OR (p7 <= 0))))",
"processed_size": 33,
"rewrites": 83
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"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": "((1 <= p4) U ((1 <= p0) AND (1 <= p7)))",
"processed_size": 39,
"rewrites": 83
},
"result":
{
"edges": 426,
"markings": 426,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((G (((p0 <= 0) OR (p7 <= 0))) AND F (((p0 <= 0) OR (p7 <= 0)))))",
"processed_size": 69,
"rewrites": 83
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3608,
"runtime": 1277.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F((((X(*) U **) OR *) AND *))) : ((X(**) OR G(**)) U (F(**) OR **)) : (X(G(**)) OR (** U X(F(**)))) : (F(G(**)) AND G((F(**) OR G(**)))) : (F(**) U X(X(G((G(*) OR X(X(X(X(*))))))))) : G(F(**)) : ((** U **) OR (G(F(*)) OR F((G(*) AND F(*))))) : F(G((F(**) OR **))) : F((F(G(**)) OR **)) : (F(**) OR (G(**) OR (** OR (G(**) AND X(**))))) : (G(**) OR G(**))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "yes yes yes no no unknown no yes yes yes no ",
"value": "yes yes yes no no unknown no yes yes 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: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 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(X (G (((NOT((NOT(X ((1 <= p5))) U (p5 <= 0))) AND (p6 <= 0)) OR (p6 <= 0))))) : ((X (((1 <= p3) AND (1 <= p7))) OR G (((1 <= p3) AND (1 <= p7)))) U (F ((1 <= p4)) OR (1 <= p4))) : (NOT(F (NOT(X (G ((p5 <= 0)))))) OR (((1 <= p3) AND (1 <= p7)) U X (F ((1 <= p2))))) : G ((F ((1 <= p4)) U G (((1 <= p0) AND (1 <= p7))))) : (F ((1 <= p4)) U NOT(X (X (F ((F ((1 <= p2)) AND X (X (X (X (((1 <= p3) AND (1 <= p7)))))))))))) : F (G (NOT(F (X (F (NOT(F (((1 <= p0) AND (1 <= p7)))))))))) : (((1 <= p4) U ((1 <= p0) AND (1 <= p7))) OR NOT(G (((((p3 <= 0) OR (p7 <= 0)) U F (((1 <= p0) AND (1 <= p7)))) U G (((1 <= p0) AND (1 <= p7))))))) : F (X (G (NOT(G (F (X (NOT(X ((F (((1 <= p1) AND (1 <= p8))) OR (1 <= p4))))))))))) : F ((G (F (G (((1 <= p6) OR (1 <= p5))))) OR ((1 <= p1) AND (1 <= p8)))) : (((F (((1 <= p1) AND (1 <= p8))) OR G ((1 <= p4))) OR ((1 <= p1) AND (1 <= p8))) OR (G (((1 <= p1) AND (1 <= p8))) AND X (((1 <= p3) AND (1 <= p7))))) : (G ((1 <= p4)) OR G ((1 <= p6)))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k: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 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((X ((p5 <= 0)) U (p5 <= 0)) OR (1 <= p6)) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((X ((p5 <= 0)) U (p5 <= 0)) OR (1 <= p6)) AND (1 <= p6))))
lola: processed formula length: 66
lola: 83 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 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p3) AND (1 <= p7))) OR G (((1 <= p3) AND (1 <= p7)))) U (F ((1 <= p4)) OR (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (((1 <= p3) AND (1 <= p7))) OR G (((1 <= p3) AND (1 <= p7)))) U (F ((1 <= p4)) OR (1 <= p4)))
lola: processed formula length: 97
lola: 83 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: 3340111 markings, 8134222 edges, 668022 markings/sec, 0 secs
lola: 6547706 markings, 16067096 edges, 641519 markings/sec, 5 secs
lola: 9789203 markings, 24072349 edges, 648299 markings/sec, 10 secs
lola: 12955579 markings, 31787049 edges, 633275 markings/sec, 15 secs
lola: 14924985 markings, 36790844 edges, 393881 markings/sec, 20 secs
lola: 16850058 markings, 41676364 edges, 385015 markings/sec, 25 secs
lola: 18791657 markings, 46604693 edges, 388320 markings/sec, 30 secs
lola: 20816452 markings, 51749386 edges, 404959 markings/sec, 35 secs
lola: 22954474 markings, 57196509 edges, 427604 markings/sec, 40 secs
lola: 25638933 markings, 63790276 edges, 536892 markings/sec, 45 secs
lola: 28004258 markings, 69843574 edges, 473065 markings/sec, 50 secs
lola: 30299040 markings, 75700624 edges, 458956 markings/sec, 55 secs
lola: 32593374 markings, 81566972 edges, 458867 markings/sec, 60 secs
lola: 34877400 markings, 87403726 edges, 456805 markings/sec, 65 secs
lola: 37199107 markings, 93351072 edges, 464341 markings/sec, 70 secs
lola: 39538644 markings, 99331075 edges, 467907 markings/sec, 75 secs
lola: 41917186 markings, 105419656 edges, 475708 markings/sec, 80 secs
lola: 44376088 markings, 111712801 edges, 491780 markings/sec, 85 secs
lola: 46946541 markings, 118366684 edges, 514091 markings/sec, 90 secs
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: 49168599 markings, 124194624 edges
lola: ========================================
lola: subprocess 2 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p5 <= 0))) OR (((1 <= p3) AND (1 <= p7)) U X (F ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p5 <= 0)))
lola: processed formula length: 17
lola: 83 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: 133 markings, 133 edges
lola: ========================================
lola: subprocess 3 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p3) AND (1 <= p7)) U X (F ((1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p3) AND (1 <= p7)) U X (F ((1 <= p2))))
lola: processed formula length: 47
lola: 83 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: 21961 markings, 49049 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p4)) U X (X (G ((G ((p2 <= 0)) OR X (X (X (X (((p3 <= 0) OR (p7 <= 0)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((1 <= p4)) U X (X (G ((G ((p2 <= 0)) OR X (X (X (X (((p3 <= 0) OR (p7 <= 0)))))))))))
lola: processed formula length: 90
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 135 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: 3363149 markings, 8158072 edges, 672630 markings/sec, 0 secs
lola: 6576229 markings, 16063764 edges, 642616 markings/sec, 5 secs
lola: 9818776 markings, 24014209 edges, 648509 markings/sec, 10 secs
lola: 12669435 markings, 32260691 edges, 570132 markings/sec, 15 secs
lola: 14099217 markings, 39193507 edges, 285956 markings/sec, 20 secs
lola: 15479914 markings, 45888244 edges, 276139 markings/sec, 25 secs
lola: 16866202 markings, 52608991 edges, 277258 markings/sec, 30 secs
lola: 18258736 markings, 59355099 edges, 278507 markings/sec, 35 secs
lola: 19669727 markings, 66177782 edges, 282198 markings/sec, 40 secs
lola: 21127856 markings, 73211448 edges, 291626 markings/sec, 45 secs
lola: 22651234 markings, 80526064 edges, 304676 markings/sec, 50 secs
lola: 24655422 markings, 88978400 edges, 400838 markings/sec, 55 secs
lola: 27115009 markings, 97609047 edges, 491917 markings/sec, 60 secs
lola: 29139375 markings, 105843086 edges, 404873 markings/sec, 65 secs
lola: 31138417 markings, 113980155 edges, 399808 markings/sec, 70 secs
lola: 33121246 markings, 122065854 edges, 396566 markings/sec, 75 secs
lola: 35114324 markings, 130174500 edges, 398616 markings/sec, 80 secs
lola: 37114817 markings, 138311597 edges, 400099 markings/sec, 85 secs
lola: 39116288 markings, 146451522 edges, 400294 markings/sec, 90 secs
lola: 41114098 markings, 154577300 edges, 399562 markings/sec, 95 secs
lola: 43108218 markings, 162688553 edges, 398824 markings/sec, 100 secs
lola: 45094297 markings, 170767465 edges, 397216 markings/sec, 105 secs
lola: 47085967 markings, 178868519 edges, 398334 markings/sec, 110 secs
lola: 49076601 markings, 186966313 edges, 398127 markings/sec, 115 secs
lola: 51053202 markings, 195011042 edges, 395320 markings/sec, 120 secs
lola: 53025485 markings, 203039090 edges, 394457 markings/sec, 125 secs
lola: 54990387 markings, 211042369 edges, 392980 markings/sec, 130 secs
lola: 56951982 markings, 219029731 edges, 392319 markings/sec, 135 secs
lola: 58928663 markings, 227069584 edges, 395336 markings/sec, 140 secs
lola: 60904933 markings, 235107311 edges, 395254 markings/sec, 145 secs
lola: 62880771 markings, 243143467 edges, 395168 markings/sec, 150 secs
lola: 64863821 markings, 251210545 edges, 396610 markings/sec, 155 secs
lola: 66845818 markings, 259270595 edges, 396399 markings/sec, 160 secs
lola: 68832181 markings, 267349879 edges, 397273 markings/sec, 165 secs
lola: 70825042 markings, 275454565 edges, 398572 markings/sec, 170 secs
lola: 72817337 markings, 283557134 edges, 398459 markings/sec, 175 secs
lola: 74817909 markings, 291692493 edges, 400114 markings/sec, 180 secs
lola: 76820844 markings, 299851407 edges, 400587 markings/sec, 185 secs
lola: 78841794 markings, 308041037 edges, 404190 markings/sec, 190 secs
lola: 80855965 markings, 316218777 edges, 402834 markings/sec, 195 secs
lola: 82861704 markings, 324365559 edges, 401148 markings/sec, 200 secs
lola: 84872392 markings, 332535531 edges, 402138 markings/sec, 205 secs
lola: 86883177 markings, 340709298 edges, 402157 markings/sec, 210 secs
lola: 88906495 markings, 348932931 edges, 404664 markings/sec, 215 secs
lola: 90942554 markings, 357194168 edges, 407212 markings/sec, 220 secs
lola: 92970785 markings, 365418267 edges, 405646 markings/sec, 225 secs
lola: 94991094 markings, 373628158 edges, 404062 markings/sec, 230 secs
lola: 97028632 markings, 381908093 edges, 407508 markings/sec, 235 secs
lola: 99076253 markings, 390198372 edges, 409524 markings/sec, 240 secs
lola: 101110268 markings, 398466032 edges, 406803 markings/sec, 245 secs
lola: 103173034 markings, 406820215 edges, 412553 markings/sec, 250 secs
lola: 105227534 markings, 415169242 edges, 410900 markings/sec, 255 secs
lola: 107300345 markings, 423558622 edges, 414562 markings/sec, 260 secs
lola: 109386554 markings, 432011423 edges, 417242 markings/sec, 265 secs
lola: 111474162 markings, 440473826 edges, 417522 markings/sec, 270 secs
lola: 113572687 markings, 448975740 edges, 419705 markings/sec, 275 secs
lola: 115680516 markings, 457504166 edges, 421566 markings/sec, 280 secs
lola: 117800660 markings, 466079616 edges, 424029 markings/sec, 285 secs
lola: 119933623 markings, 474716295 edges, 426593 markings/sec, 290 secs
lola: 122081077 markings, 483375382 edges, 429491 markings/sec, 295 secs
lola: 124247417 markings, 492113369 edges, 433268 markings/sec, 300 secs
lola: 126439745 markings, 500934225 edges, 438466 markings/sec, 305 secs
lola: 128592677 markings, 509571070 edges, 430586 markings/sec, 310 secs
lola: 130266010 markings, 516250045 edges, 334667 markings/sec, 315 secs
lola: 132020410 markings, 523211002 edges, 350880 markings/sec, 320 secs
lola: 133372801 markings, 529021430 edges, 270478 markings/sec, 325 secs
lola: 133843668 markings, 533384745 edges, 94173 markings/sec, 330 secs
lola: 134393910 markings, 538726456 edges, 110048 markings/sec, 335 secs
lola: 134950687 markings, 544132460 edges, 111355 markings/sec, 340 secs
lola: 135528377 markings, 549724548 edges, 115538 markings/sec, 345 secs
lola: 136096313 markings, 555240948 edges, 113587 markings/sec, 350 secs
lola: 136664734 markings, 560746426 edges, 113684 markings/sec, 355 secs
lola: 137252608 markings, 566453190 edges, 117575 markings/sec, 360 secs
lola: 137761506 markings, 571392208 edges, 101780 markings/sec, 365 secs
lola: 138279432 markings, 576399753 edges, 103585 markings/sec, 370 secs
lola: 138894316 markings, 582357287 edges, 122977 markings/sec, 375 secs
lola: 139501525 markings, 588236605 edges, 121442 markings/sec, 380 secs
lola: 140109228 markings, 594115849 edges, 121541 markings/sec, 385 secs
lola: 140649436 markings, 599338472 edges, 108042 markings/sec, 390 secs
lola: 141190468 markings, 604566332 edges, 108206 markings/sec, 395 secs
lola: 141761511 markings, 610080351 edges, 114209 markings/sec, 400 secs
lola: 142327358 markings, 615539043 edges, 113169 markings/sec, 405 secs
lola: 142893943 markings, 620986475 edges, 113317 markings/sec, 410 secs
lola: 143543544 markings, 627222889 edges, 129920 markings/sec, 415 secs
lola: 144211004 markings, 633595253 edges, 133492 markings/sec, 420 secs
lola: 144976064 markings, 640815959 edges, 153012 markings/sec, 425 secs
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: 145253611 markings, 643243150 edges
lola: ========================================
lola: subprocess 4 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p1) AND (1 <= p8))) OR (G ((1 <= p4)) OR (((1 <= p1) AND (1 <= p8)) OR (G (((1 <= p1) AND (1 <= p8))) AND X (((1 <= p3) AND (1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) AND (1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1) AND (1 <= p8))
lola: processed formula length: 25
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p4))
lola: processed formula length: 13
lola: 83 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: 426 markings, 426 edges
lola: ========================================
lola: subprocess 6 will run for 607 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p1) AND (1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p1) AND (1 <= p8)))
lola: processed formula length: 29
lola: 83 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: 426 markings, 426 edges
lola: ========================================
lola: subprocess 7 will run for 759 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p1) AND (1 <= p8)))
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: ((p1 <= 0) OR (p8 <= 0))
lola: processed formula length: 25
lola: 85 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: 121 markings, 120 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p0) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p0) AND (1 <= p7))))
lola: processed formula length: 33
lola: 83 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: 3203978 markings, 6650235 edges, 640796 markings/sec, 0 secs
lola: 6039474 markings, 12802682 edges, 567099 markings/sec, 5 secs
lola: 8868278 markings, 19481908 edges, 565761 markings/sec, 10 secs
lola: 11696474 markings, 26374075 edges, 565639 markings/sec, 15 secs
lola: 14372322 markings, 33135512 edges, 535170 markings/sec, 20 secs
lola: 16988297 markings, 39710028 edges, 523195 markings/sec, 25 secs
lola: 19578102 markings, 46339668 edges, 517961 markings/sec, 30 secs
lola: 21767833 markings, 53027126 edges, 437946 markings/sec, 35 secs
lola: 23743132 markings, 59227966 edges, 395060 markings/sec, 40 secs
lola: 25601819 markings, 65101221 edges, 371737 markings/sec, 45 secs
lola: 27417722 markings, 70890717 edges, 363181 markings/sec, 50 secs
lola: 29415562 markings, 77155150 edges, 399568 markings/sec, 55 secs
lola: 31572765 markings, 83767538 edges, 431441 markings/sec, 60 secs
lola: 33543852 markings, 89978532 edges, 394217 markings/sec, 65 secs
lola: 35417033 markings, 95924423 edges, 374636 markings/sec, 70 secs
lola: 37263058 markings, 101833793 edges, 369205 markings/sec, 75 secs
lola: 39577129 markings, 109035657 edges, 462814 markings/sec, 80 secs
lola: 41786175 markings, 115988579 edges, 441809 markings/sec, 85 secs
lola: 43856698 markings, 122549181 edges, 414105 markings/sec, 90 secs
lola: 45884854 markings, 129036370 edges, 405631 markings/sec, 95 secs
lola: 48211178 markings, 136274220 edges, 465265 markings/sec, 100 secs
lola: 50406192 markings, 143183445 edges, 439003 markings/sec, 105 secs
lola: 52486606 markings, 149771080 edges, 416083 markings/sec, 110 secs
lola: 54530041 markings, 156247049 edges, 408687 markings/sec, 115 secs
lola: 56830327 markings, 163306637 edges, 460057 markings/sec, 120 secs
lola: 59043371 markings, 170259340 edges, 442609 markings/sec, 125 secs
lola: 61091451 markings, 176747045 edges, 409616 markings/sec, 130 secs
lola: 63092789 markings, 183161558 edges, 400268 markings/sec, 135 secs
lola: 65388856 markings, 190232618 edges, 459213 markings/sec, 140 secs
lola: 67601353 markings, 197183431 edges, 442499 markings/sec, 145 secs
lola: 69648977 markings, 203666954 edges, 409525 markings/sec, 150 secs
lola: 71634069 markings, 210029946 edges, 397018 markings/sec, 155 secs
lola: 73936746 markings, 216999303 edges, 460535 markings/sec, 160 secs
lola: 76148147 markings, 223946700 edges, 442280 markings/sec, 165 secs
lola: 78181190 markings, 230377834 edges, 406609 markings/sec, 170 secs
lola: 80134448 markings, 236649310 edges, 390652 markings/sec, 175 secs
lola: 82205411 markings, 243356501 edges, 414193 markings/sec, 180 secs
lola: 84505749 markings, 250386077 edges, 460068 markings/sec, 185 secs
lola: 86562665 markings, 256887424 edges, 411383 markings/sec, 190 secs
lola: 88436415 markings, 262893401 edges, 374750 markings/sec, 195 secs
lola: 90750684 markings, 270019746 edges, 462854 markings/sec, 200 secs
lola: 92854728 markings, 276631887 edges, 420809 markings/sec, 205 secs
lola: 94778810 markings, 282745577 edges, 384816 markings/sec, 210 secs
lola: 96732402 markings, 288886812 edges, 390718 markings/sec, 215 secs
lola: 99015411 markings, 295961636 edges, 456602 markings/sec, 220 secs
lola: 101089784 markings, 302483853 edges, 414875 markings/sec, 225 secs
lola: 103032311 markings, 308670743 edges, 388505 markings/sec, 230 secs
lola: 104978462 markings, 315018986 edges, 389230 markings/sec, 235 secs
lola: 107268864 markings, 322010031 edges, 458080 markings/sec, 240 secs
lola: 109313638 markings, 328463778 edges, 408955 markings/sec, 245 secs
lola: 111263856 markings, 334701444 edges, 390044 markings/sec, 250 secs
lola: 113176713 markings, 340804401 edges, 382571 markings/sec, 255 secs
lola: 115380983 markings, 347631298 edges, 440854 markings/sec, 260 secs
lola: 117502468 markings, 354290661 edges, 424297 markings/sec, 265 secs
lola: 119267549 markings, 359901969 edges, 353016 markings/sec, 270 secs
lola: 120914459 markings, 365236294 edges, 329382 markings/sec, 275 secs
lola: 122436711 markings, 369797729 edges, 304450 markings/sec, 280 secs
lola: 124033508 markings, 374814935 edges, 319359 markings/sec, 285 secs
lola: 125291758 markings, 378804822 edges, 251650 markings/sec, 290 secs
lola: 126564702 markings, 382910161 edges, 254589 markings/sec, 295 secs
lola: 128325818 markings, 388618896 edges, 352223 markings/sec, 300 secs
lola: 130209077 markings, 394336964 edges, 376652 markings/sec, 305 secs
lola: 131915452 markings, 399716190 edges, 341275 markings/sec, 310 secs
lola: 133546138 markings, 404958415 edges, 326137 markings/sec, 315 secs
lola: 135478661 markings, 410913214 edges, 386505 markings/sec, 320 secs
lola: 136870150 markings, 415273439 edges, 278298 markings/sec, 325 secs
lola: 138304292 markings, 419819142 edges, 286828 markings/sec, 330 secs
lola: 139735370 markings, 424428025 edges, 286216 markings/sec, 335 secs
lola: 141253951 markings, 429309116 edges, 303716 markings/sec, 340 secs
lola: 143104995 markings, 435010697 edges, 370209 markings/sec, 345 secs
lola: 144846386 markings, 440474845 edges, 348278 markings/sec, 350 secs
lola: 146497145 markings, 445736526 edges, 330152 markings/sec, 355 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p1) AND (1 <= p8))) OR (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p1) AND (1 <= p8))) OR (1 <= p4))))
lola: processed formula length: 52
lola: 83 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: 2917662 markings, 8311614 edges, 583532 markings/sec, 0 secs
lola: 5711398 markings, 16601971 edges, 558747 markings/sec, 5 secs
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: 6255608 markings, 18200034 edges
lola: ========================================
lola: subprocess 7 will run for 666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G (((1 <= p6) OR (1 <= p5)))) OR ((1 <= p1) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G (((1 <= p6) OR (1 <= p5)))) OR ((1 <= p1) AND (1 <= p8))))
lola: processed formula length: 68
lola: 83 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: 242 markings, 241 edges
lola: ========================================
lola: subprocess 8 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p4)) OR G ((1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p6))
lola: processed formula length: 13
lola: 83 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: 427 markings, 427 edges
lola: ========================================
lola: subprocess 9 will run for 1332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p4))
lola: processed formula length: 13
lola: 83 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: 426 markings, 426 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 1332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p0) AND (1 <= p7)))) AND G ((F ((1 <= p4)) OR G (((1 <= p0) AND (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p0) AND (1 <= p7))))
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 <= p7))))
lola: processed formula length: 33
lola: 83 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: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
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: 837 markings, 1428 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 2664 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p4) U ((1 <= p0) AND (1 <= p7))) OR (G (F (((p0 <= 0) OR (p7 <= 0)))) OR F ((G (((p0 <= 0) OR (p7 <= 0))) AND F (((p0 <= 0) OR (p7 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 2664 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p0 <= 0) OR (p7 <= 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 (p7 <= 0))))
lola: processed formula length: 33
lola: 83 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: 126 markings, 126 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p0 <= 0) OR (p7 <= 0))) AND F (((p0 <= 0) OR (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p0 <= 0) OR (p7 <= 0))) AND F (((p0 <= 0) OR (p7 <= 0)))))
lola: processed formula length: 69
lola: 83 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: 126 markings, 126 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p0) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p0) AND (1 <= p7))))
lola: processed formula length: 33
lola: 83 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: 3126885 markings, 6487887 edges, 625377 markings/sec, 0 secs
lola: 5913766 markings, 12527486 edges, 557376 markings/sec, 5 secs
lola: 8679781 markings, 19109004 edges, 553203 markings/sec, 10 secs
lola: 11546699 markings, 26019053 edges, 573384 markings/sec, 15 secs
lola: 14217601 markings, 32722340 edges, 534180 markings/sec, 20 secs
lola: 16831363 markings, 39307012 edges, 522752 markings/sec, 25 secs
lola: 19411001 markings, 45892751 edges, 515928 markings/sec, 30 secs
lola: 21580431 markings, 52432746 edges, 433886 markings/sec, 35 secs
lola: 23420458 markings, 58216786 edges, 368005 markings/sec, 40 secs
lola: 25160148 markings, 63701926 edges, 347938 markings/sec, 45 secs
lola: 26876443 markings, 69155517 edges, 343259 markings/sec, 50 secs
lola: 28633752 markings, 74752800 edges, 351462 markings/sec, 55 secs
lola: 30831650 markings, 81441537 edges, 439580 markings/sec, 60 secs
lola: 32796832 markings, 87620321 edges, 393036 markings/sec, 65 secs
lola: 34665232 markings, 93529425 edges, 373680 markings/sec, 70 secs
lola: 36487863 markings, 99340013 edges, 364526 markings/sec, 75 secs
lola: 38486263 markings, 105893720 edges, 399680 markings/sec, 80 secs
lola: 40779689 markings, 112812838 edges, 458685 markings/sec, 85 secs
lola: 42819952 markings, 119256161 edges, 408053 markings/sec, 90 secs
lola: 44775079 markings, 125481315 edges, 391025 markings/sec, 95 secs
lola: 46822447 markings, 132101608 edges, 409474 markings/sec, 100 secs
lola: 49140510 markings, 139191781 edges, 463613 markings/sec, 105 secs
lola: 51229757 markings, 145784192 edges, 417849 markings/sec, 110 secs
lola: 53227519 markings, 152137224 edges, 399552 markings/sec, 115 secs
lola: 55247051 markings, 158431452 edges, 403906 markings/sec, 120 secs
lola: 57600071 markings, 165722696 edges, 470604 markings/sec, 125 secs
lola: 59710575 markings, 172367244 edges, 422101 markings/sec, 130 secs
lola: 61665220 markings, 178572432 edges, 390929 markings/sec, 135 secs
lola: 63568630 markings, 184697022 edges, 380682 markings/sec, 140 secs
lola: 65910223 markings, 191868257 edges, 468319 markings/sec, 145 secs
lola: 68003894 markings, 198452758 edges, 418734 markings/sec, 150 secs
lola: 69958013 markings, 204650123 edges, 390824 markings/sec, 155 secs
lola: 71869480 markings, 210793199 edges, 382293 markings/sec, 160 secs
lola: 74191680 markings, 217797659 edges, 464440 markings/sec, 165 secs
lola: 76321514 markings, 224490950 edges, 425967 markings/sec, 170 secs
lola: 78324877 markings, 230835034 edges, 400673 markings/sec, 175 secs
lola: 80251958 markings, 237029545 edges, 385416 markings/sec, 180 secs
lola: 82349500 markings, 243687365 edges, 419508 markings/sec, 185 secs
lola: 84547794 markings, 250520062 edges, 439659 markings/sec, 190 secs
lola: 86555249 markings, 256863749 edges, 401491 markings/sec, 195 secs
lola: 88511008 markings, 263133623 edges, 391152 markings/sec, 200 secs
lola: 90825946 markings, 270259415 edges, 462988 markings/sec, 205 secs
lola: 92944698 markings, 276919488 edges, 423750 markings/sec, 210 secs
lola: 94935108 markings, 283247726 edges, 398082 markings/sec, 215 secs
lola: 96910093 markings, 289467544 edges, 394997 markings/sec, 220 secs
lola: 99234756 markings, 296644978 edges, 464933 markings/sec, 225 secs
lola: 101316992 markings, 303206669 edges, 416447 markings/sec, 230 secs
lola: 103267849 markings, 309430195 edges, 390171 markings/sec, 235 secs
lola: 105281536 markings, 315917499 edges, 402737 markings/sec, 240 secs
lola: 107530037 markings, 322833494 edges, 449700 markings/sec, 245 secs
lola: 109565107 markings, 329263834 edges, 407014 markings/sec, 250 secs
lola: 111493989 markings, 335455693 edges, 385776 markings/sec, 255 secs
lola: 113408243 markings, 341521134 edges, 382851 markings/sec, 260 secs
lola: 115624114 markings, 348394046 edges, 443174 markings/sec, 265 secs
lola: 117738256 markings, 355034030 edges, 422828 markings/sec, 270 secs
lola: 119503934 markings, 360664546 edges, 353136 markings/sec, 275 secs
lola: 121263343 markings, 366134013 edges, 351882 markings/sec, 280 secs
lola: 122645830 markings, 370455721 edges, 276497 markings/sec, 285 secs
lola: 124214157 markings, 375387742 edges, 313665 markings/sec, 290 secs
lola: 125534903 markings, 379582939 edges, 264149 markings/sec, 295 secs
lola: 127007713 markings, 384364017 edges, 294562 markings/sec, 300 secs
lola: 128440674 markings, 388959829 edges, 286592 markings/sec, 305 secs
lola: 129940342 markings, 393494960 edges, 299934 markings/sec, 310 secs
lola: 131646891 markings, 398862709 edges, 341310 markings/sec, 315 secs
lola: 133447129 markings, 404633223 edges, 360048 markings/sec, 320 secs
lola: 134969587 markings, 409323891 edges, 304492 markings/sec, 325 secs
lola: 136604279 markings, 414440708 edges, 326938 markings/sec, 330 secs
lola: 137973689 markings, 418763689 edges, 273882 markings/sec, 335 secs
lola: 139357341 markings, 423219290 edges, 276730 markings/sec, 340 secs
lola: 140474800 markings, 426761840 edges, 223492 markings/sec, 345 secs
lola: 142487790 markings, 433083091 edges, 402598 markings/sec, 350 secs
lola: 144216971 markings, 438490119 edges, 345836 markings/sec, 355 secs
lola: 145490997 markings, 442512274 edges, 254805 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((1 <= p4) U ((1 <= p0) AND (1 <= p7))) OR (G (F (((p0 <= 0) OR (p7 <= 0)))) OR F ((G (((p0 <= 0) OR (p7 <= 0))) AND F (((p0 <= 0) OR (p7 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (F (((p0 <= 0) OR (p7 <= 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 (p7 <= 0))))
lola: processed formula length: 33
lola: 83 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: 126 markings, 126 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) U ((1 <= p0) AND (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p4) U ((1 <= p0) AND (1 <= p7)))
lola: processed formula length: 39
lola: 83 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: 426 markings, 426 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G (((p0 <= 0) OR (p7 <= 0))) AND F (((p0 <= 0) OR (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p0 <= 0) OR (p7 <= 0))) AND F (((p0 <= 0) OR (p7 <= 0)))))
lola: processed formula length: 69
lola: 83 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: 126 markings, 126 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no unknown no yes yes yes no
lola:
preliminary result: yes yes yes no no unknown no yes yes yes no
lola: memory consumption: 3608 KB
lola: time consumption: 1277 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="SwimmingPool-PT-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is SwimmingPool-PT-06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-162106800700378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-06.tgz
mv SwimmingPool-PT-06 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 ;