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-162106800700370.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-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800700370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.3K 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 16K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-04-00
FORMULA_NAME SwimmingPool-PT-04-01
FORMULA_NAME SwimmingPool-PT-04-02
FORMULA_NAME SwimmingPool-PT-04-03
FORMULA_NAME SwimmingPool-PT-04-04
FORMULA_NAME SwimmingPool-PT-04-05
FORMULA_NAME SwimmingPool-PT-04-06
FORMULA_NAME SwimmingPool-PT-04-07
FORMULA_NAME SwimmingPool-PT-04-08
FORMULA_NAME SwimmingPool-PT-04-09
FORMULA_NAME SwimmingPool-PT-04-10
FORMULA_NAME SwimmingPool-PT-04-11
FORMULA_NAME SwimmingPool-PT-04-12
FORMULA_NAME SwimmingPool-PT-04-13
FORMULA_NAME SwimmingPool-PT-04-14
FORMULA_NAME SwimmingPool-PT-04-15

=== Now, execution of the tool begins

BK_START 1621225237139

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 04:20:38] [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:20:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:20:38] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-17 04:20:38] [INFO ] Transformed 9 places.
[2021-05-17 04:20:38] [INFO ] Transformed 7 transitions.
[2021-05-17 04:20:38] [INFO ] Parsed PT model containing 9 places and 7 transitions in 53 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 329 steps, including 0 resets, run visited all 14 properties in 3 ms. (steps per millisecond=109 )
[2021-05-17 04:20:38] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-17 04:20:38] [INFO ] Flatten gal took : 20 ms
FORMULA SwimmingPool-PT-04-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-04-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-04-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-04-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:20:38] [INFO ] Flatten gal took : 3 ms
[2021-05-17 04:20:38] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-17 04:20:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SwimmingPool-PT-04 @ 3570 seconds

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

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

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

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

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

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

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

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

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

FORMULA SwimmingPool-PT-04-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SwimmingPool-PT-04-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2693
rslt: Output for LTLFireability @ SwimmingPool-PT-04

{
"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:20:39 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 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": 67
},
"result":
{
"edges": 80,
"markings": 81,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 <= p0) AND (1 <= p7))",
"processed_size": 25,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "(p5 <= 0)",
"processed_size": 9,
"rewrites": 65
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 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 <= p0) AND (1 <= p7)))",
"processed_size": 29,
"rewrites": 65
},
"result":
{
"edges": 286,
"markings": 286,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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 ((1 <= p5))",
"processed_size": 13,
"rewrites": 65
},
"result":
{
"edges": 86,
"markings": 86,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1048
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G ((1 <= p2)))",
"processed_size": 17,
"rewrites": 65
},
"result":
{
"edges": 248,
"markings": 247,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1573
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "(p2 <= 0)",
"processed_size": 9,
"rewrites": 67
},
"result":
{
"edges": 120,
"markings": 121,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3146
},
"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 ((p5 <= 0))",
"processed_size": 13,
"rewrites": 65
},
"result":
{
"edges": 290,
"markings": 290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3146
},
"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 <= p3) AND (1 <= p7))",
"processed_size": 25,
"rewrites": 65
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "(p2 <= 0)",
"processed_size": 9,
"rewrites": 67
},
"result":
{
"edges": 120,
"markings": 121,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"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 ((p5 <= 0))",
"processed_size": 13,
"rewrites": 65
},
"result":
{
"edges": 290,
"markings": 290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"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": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((F ((p2 <= 0)) OR (p2 <= 0)))",
"processed_size": 32,
"rewrites": 65
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 1
},
"compoundnumber": 15,
"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": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"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 <= p3) AND (1 <= p7))",
"processed_size": 25,
"rewrites": 65
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": "((p0 <= 0) OR (p7 <= 0))",
"processed_size": 25,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p3) AND (1 <= p7))) AND F (G (((p0 <= 0) OR (p7 <= 0))))))))",
"processed_size": 108,
"rewrites": 65
},
"result":
{
"edges": 37077020,
"markings": 8977781,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 16,
"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": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3268,
"runtime": 877.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) AND ((G(*) R X(*)) OR F(*))) : X(F((F((F(**) OR **)) AND X(F(*))))) : F((X(X(F(*))) OR (G(**) AND X(X(F(*)))))) : (G(**) OR (F(**) AND F((F(*) OR *)))) : F(G(**)) : X(F((F(G(**)) OR G(*)))) : (X(**) OR (G(**) AND **)) : G(((X(G(**)) U **) OR F((X(*) OR G(*))))) : (** OR (F(**) AND G(F((** OR (F(**) AND F(G(*)))))))) : G((G(F(*)) OR ((X(**) AND **) U **))) : G(F((G(**) AND X((G(*) OR *))))) : X(X(G((** OR (F(*) AND **)))))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "yes yes yes yes no no no unknown yes no no no ",
"value": "yes yes yes yes no no no unknown yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: (F (((1 <= p1) AND (1 <= p8))) AND (NOT((F (((1 <= p3) AND (1 <= p7))) U X ((1 <= p4)))) OR NOT(G (((1 <= p0) AND (1 <= p7)))))) : X (F ((F ((F ((1 <= p2)) OR (1 <= p6))) AND NOT(G (X (((1 <= p3) AND (1 <= p7)))))))) : F ((G ((1 <= p4)) U F (NOT(X (X ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p3) AND (1 <= p7))))))))) : (G ((p5 <= 0)) OR (F ((1 <= p2)) AND NOT(G ((G ((1 <= p2)) AND (1 <= p2)))))) : F (G ((1 <= p2))) : F (NOT(G (X ((G (NOT(G (X ((1 <= p4))))) AND F ((1 <= p2))))))) : (X ((1 <= p5)) OR (G (((1 <= p0) AND (1 <= p7))) AND (p5 <= 0))) : G (((X (G ((1 <= p4))) U ((1 <= p1) AND (1 <= p8))) OR F ((NOT(X (((p0 <= 0) OR (p7 <= 0)))) OR NOT(F ((1 <= p6))))))) : (((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p0) AND (1 <= p7))) AND G (F ((F (NOT(X (F (((1 <= p0) AND (1 <= p7)))))) U ((1 <= p3) AND (1 <= p7))))))) : G ((G (X (NOT(G ((1 <= p6))))) OR ((X ((1 <= p4)) AND (1 <= p4)) U ((p3 <= 0) OR (p7 <= 0))))) : G (F ((G ((1 <= p4)) AND (NOT(X (F ((1 <= p4)))) OR NOT(X ((1 <= p6))))))) : X (G (X (((1 <= p4) OR (NOT(G ((1 <= p6))) AND (p6 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p1) AND (1 <= p8))) AND ((G (((p3 <= 0) OR (p7 <= 0))) R X ((p4 <= 0))) OR F (((p0 <= 0) OR (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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: 67 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: 81 markings, 80 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p0 <= 0) OR (p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p0) AND (1 <= p7))
lola: processed formula length: 25
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((F ((1 <= p2)) OR (1 <= p6))) AND X (F (((p3 <= 0) OR (p7 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((F ((1 <= p2)) OR (1 <= p6))) AND X (F (((p3 <= 0) OR (p7 <= 0)))))))
lola: processed formula length: 80
lola: 65 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (F ((((p3 <= 0) OR (p7 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)))))) OR (G ((1 <= p4)) AND X (X (F ((((p3 <= 0) OR (p7 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (F ((((p3 <= 0) OR (p7 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)))))) OR (G ((1 <= p4)) AND X (X (F ((((p3 <= 0) OR (p7 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)))))))))
lola: processed formula length: 168
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 14 markings, 17 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((1 <= p4))) OR G ((p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((1 <= p4))) OR G ((p2 <= 0)))))
lola: processed formula length: 44
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 93 markings, 94 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((1 <= p5)) OR (G (((1 <= p0) AND (1 <= p7))) AND (p5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p5 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 <= 0)
lola: processed formula length: 9
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p0) AND (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p0) AND (1 <= p7)))
lola: processed formula length: 29
lola: 65 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: 286 markings, 286 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p5))
lola: processed formula length: 13
lola: 65 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: 86 markings, 86 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (G ((1 <= p4))) U ((1 <= p1) AND (1 <= p8))) OR F ((X (((1 <= p0) AND (1 <= p7))) OR G ((p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (G ((1 <= p4))) U ((1 <= p1) AND (1 <= p8))) OR F ((X (((1 <= p0) AND (1 <= p7))) OR G ((p6 <= 0))))))
lola: processed formula length: 109
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2521438 markings, 7841829 edges, 504288 markings/sec, 0 secs
lola: 4585408 markings, 14633975 edges, 412794 markings/sec, 5 secs
lola: 6548676 markings, 21180135 edges, 392654 markings/sec, 10 secs
lola: 8434867 markings, 27532838 edges, 377238 markings/sec, 15 secs
lola: 10265568 markings, 33741243 edges, 366140 markings/sec, 20 secs
lola: 12057845 markings, 39855624 edges, 358455 markings/sec, 25 secs
lola: 13822722 markings, 45891492 edges, 352975 markings/sec, 30 secs
lola: 15560074 markings, 51855468 edges, 347470 markings/sec, 35 secs
lola: 17268522 markings, 57747855 edges, 341690 markings/sec, 40 secs
lola: 18959136 markings, 63598033 edges, 338123 markings/sec, 45 secs
lola: 20628382 markings, 69391505 edges, 333849 markings/sec, 50 secs
lola: 22285440 markings, 75164401 edges, 331412 markings/sec, 55 secs
lola: 23939511 markings, 80929693 edges, 330814 markings/sec, 60 secs
lola: 25570992 markings, 86640353 edges, 326296 markings/sec, 65 secs
lola: 27175704 markings, 92277038 edges, 320942 markings/sec, 70 secs
lola: 28779922 markings, 97920545 edges, 320844 markings/sec, 75 secs
lola: 30370249 markings, 103519654 edges, 318065 markings/sec, 80 secs
lola: 31954852 markings, 109121482 edges, 316921 markings/sec, 85 secs
lola: 33529832 markings, 114696163 edges, 314996 markings/sec, 90 secs
lola: 35079695 markings, 120202829 edges, 309973 markings/sec, 95 secs
lola: 36629960 markings, 125707233 edges, 310053 markings/sec, 100 secs
lola: 38178199 markings, 131220140 edges, 309648 markings/sec, 105 secs
lola: 39707157 markings, 136686754 edges, 305792 markings/sec, 110 secs
lola: 41242149 markings, 142161177 edges, 306998 markings/sec, 115 secs
lola: 42768921 markings, 147639312 edges, 305354 markings/sec, 120 secs
lola: 44295562 markings, 153116219 edges, 305328 markings/sec, 125 secs
lola: 45801999 markings, 158533795 edges, 301287 markings/sec, 130 secs
lola: 47336963 markings, 164054140 edges, 306993 markings/sec, 135 secs
lola: 48852279 markings, 169501850 edges, 303063 markings/sec, 140 secs
lola: 50361921 markings, 174941301 edges, 301928 markings/sec, 145 secs
lola: 51870257 markings, 180400203 edges, 301667 markings/sec, 150 secs
lola: 53373841 markings, 185836694 edges, 300717 markings/sec, 155 secs
lola: 54868832 markings, 191259748 edges, 298998 markings/sec, 160 secs
lola: 56381695 markings, 196743199 edges, 302573 markings/sec, 165 secs
lola: 57859479 markings, 202114945 edges, 295557 markings/sec, 170 secs
lola: 59344882 markings, 207511303 edges, 297081 markings/sec, 175 secs
lola: 60825980 markings, 212906877 edges, 296220 markings/sec, 180 secs
lola: 62294543 markings, 218258460 edges, 293713 markings/sec, 185 secs
lola: 63782329 markings, 223713658 edges, 297557 markings/sec, 190 secs
lola: 65255234 markings, 229076765 edges, 294581 markings/sec, 195 secs
lola: 66721721 markings, 234455055 edges, 293297 markings/sec, 200 secs
lola: 68178247 markings, 239802496 edges, 291305 markings/sec, 205 secs
lola: 69632127 markings, 245108873 edges, 290776 markings/sec, 210 secs
lola: 71071967 markings, 250400411 edges, 287968 markings/sec, 215 secs
lola: 72526587 markings, 255756002 edges, 290924 markings/sec, 220 secs
lola: 73961402 markings, 261034540 edges, 286963 markings/sec, 225 secs
lola: 75406519 markings, 266348575 edges, 289023 markings/sec, 230 secs
lola: 76832805 markings, 271614944 edges, 285257 markings/sec, 235 secs
lola: 78253986 markings, 276876247 edges, 284236 markings/sec, 240 secs
lola: 79693973 markings, 282177449 edges, 287997 markings/sec, 245 secs
lola: 81123364 markings, 287456845 edges, 285878 markings/sec, 250 secs
lola: 82545529 markings, 292732523 edges, 284433 markings/sec, 255 secs
lola: 83958758 markings, 297953802 edges, 282646 markings/sec, 260 secs
lola: 85393297 markings, 303275990 edges, 286908 markings/sec, 265 secs
lola: 86820221 markings, 308572043 edges, 285385 markings/sec, 270 secs
lola: 88241809 markings, 313854773 edges, 284318 markings/sec, 275 secs
lola: 89662750 markings, 319152196 edges, 284188 markings/sec, 280 secs
lola: 91086742 markings, 324452129 edges, 284798 markings/sec, 285 secs
lola: 92517307 markings, 329764710 edges, 286113 markings/sec, 290 secs
lola: 93922040 markings, 335032200 edges, 280947 markings/sec, 295 secs
lola: 95293554 markings, 340147887 edges, 274303 markings/sec, 300 secs
lola: 96426788 markings, 344395405 edges, 226647 markings/sec, 305 secs
lola: 97256375 markings, 347480806 edges, 165917 markings/sec, 310 secs
lola: 98623458 markings, 352611935 edges, 273417 markings/sec, 315 secs
lola: 99732238 markings, 356768567 edges, 221756 markings/sec, 320 secs
lola: 100966876 markings, 361396765 edges, 246928 markings/sec, 325 secs
lola: 102223334 markings, 366098678 edges, 251292 markings/sec, 330 secs
lola: 103341010 markings, 370300375 edges, 223535 markings/sec, 335 secs
lola: 104548418 markings, 374841144 edges, 241482 markings/sec, 340 secs
lola: 105649479 markings, 378986968 edges, 220212 markings/sec, 345 secs
lola: 106641907 markings, 382714850 edges, 198486 markings/sec, 350 secs
lola: 107705167 markings, 386714154 edges, 212652 markings/sec, 355 secs
lola: 108767635 markings, 390717939 edges, 212494 markings/sec, 360 secs
lola: 109819873 markings, 394662552 edges, 210448 markings/sec, 365 secs
lola: 110953064 markings, 398945382 edges, 226638 markings/sec, 370 secs
lola: 112198080 markings, 403631527 edges, 249003 markings/sec, 375 secs
lola: 113156542 markings, 407244423 edges, 191692 markings/sec, 380 secs
lola: 114324407 markings, 411650205 edges, 233573 markings/sec, 385 secs
lola: 115547019 markings, 416296136 edges, 244522 markings/sec, 390 secs
lola: 116633725 markings, 420409446 edges, 217341 markings/sec, 395 secs
lola: 117808129 markings, 424863179 edges, 234881 markings/sec, 400 secs
lola: 118718809 markings, 428296116 edges, 182136 markings/sec, 405 secs
lola: 119279281 markings, 430444509 edges, 112094 markings/sec, 410 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F ((p6 <= 0))) OR ((X ((1 <= p4)) AND (1 <= p4)) U ((p3 <= 0) OR (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F ((p6 <= 0))) OR ((X ((1 <= p4)) AND (1 <= p4)) U ((p3 <= 0) OR (p7 <= 0)))))
lola: processed formula length: 86
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 109 markings, 113 edges
lola: ========================================
lola: subprocess 7 will run for 629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((1 <= p4)) AND X ((G ((p4 <= 0)) OR (p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((1 <= p4)) AND X ((G ((p4 <= 0)) OR (p6 <= 0))))))
lola: processed formula length: 60
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 92 markings, 92 edges
lola: ========================================
lola: subprocess 8 will run for 786 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p4) OR (F ((p6 <= 0)) AND (p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p4) OR (F ((p6 <= 0)) AND (p6 <= 0))))))
lola: processed formula length: 56
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 86 markings, 86 edges
lola: ========================================
lola: subprocess 9 will run for 1048 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p2)))
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 <= p2)))
lola: processed formula length: 17
lola: 65 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: 247 markings, 248 edges
lola: ========================================
lola: subprocess 10 will run for 1573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p5 <= 0)) OR (F ((1 <= p2)) AND F ((F ((p2 <= 0)) OR (p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p2))
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: (p2 <= 0)
lola: processed formula length: 9
lola: 67 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: subprocess 11 will run for 3146 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p5 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= 0))
lola: processed formula length: 13
lola: 65 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: 290 markings, 290 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 11 will run for 3146 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p0) AND (1 <= p7))) AND G (F ((((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p3) AND (1 <= p7))) AND F (G (((p0 <= 0) OR (p7 <= 0))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3146 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (1 <= p7))
lola: processed formula length: 25
lola: 65 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: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p3) AND (1 <= p7))) AND F (G (((p0 <= 0) OR (p7 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p3) AND (1 <= p7))) AND F (G (((p0 <= 0) OR (p7 <= 0))))))))
lola: processed formula length: 108
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: local time limit reached - aborting
lola:
preliminary result: yes yes yes unknown no no no unknown unknown no no no
lola: memory consumption: 58808 KB
lola: time consumption: 425 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((X (G ((1 <= p4))) U ((1 <= p1) AND (1 <= p8))) OR F ((X (((1 <= p0) AND (1 <= p7))) OR G ((p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (G ((1 <= p4))) U ((1 <= p1) AND (1 <= p8))) OR F ((X (((1 <= p0) AND (1 <= p7))) OR G ((p6 <= 0))))))
lola: processed formula length: 109
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2442508 markings, 7580104 edges, 488502 markings/sec, 0 secs
lola: 4459153 markings, 14209740 edges, 403329 markings/sec, 5 secs
lola: 6390802 markings, 20652380 edges, 386330 markings/sec, 10 secs
lola: 8266143 markings, 26964805 edges, 375068 markings/sec, 15 secs
lola: 10095154 markings, 33156512 edges, 365802 markings/sec, 20 secs
lola: 11881116 markings, 39242849 edges, 357192 markings/sec, 25 secs
lola: 13628432 markings, 45231207 edges, 349463 markings/sec, 30 secs
lola: 15363906 markings, 51177256 edges, 347095 markings/sec, 35 secs
lola: 17062464 markings, 57041970 edges, 339712 markings/sec, 40 secs
lola: 18746193 markings, 62861969 edges, 336746 markings/sec, 45 secs
lola: 20401372 markings, 68591759 edges, 331036 markings/sec, 50 secs
lola: 22014869 markings, 74219344 edges, 322699 markings/sec, 55 secs
lola: 23643900 markings, 79897828 edges, 325806 markings/sec, 60 secs
lola: 25271443 markings, 85592464 edges, 325509 markings/sec, 65 secs
lola: 26869037 markings, 91200090 edges, 319519 markings/sec, 70 secs
lola: 28451571 markings, 96768034 edges, 316507 markings/sec, 75 secs
lola: 30048879 markings, 102384339 edges, 319462 markings/sec, 80 secs
lola: 31614704 markings, 107921840 edges, 313165 markings/sec, 85 secs
lola: 33191043 markings, 113498094 edges, 315268 markings/sec, 90 secs
lola: 34757678 markings, 119056615 edges, 313327 markings/sec, 95 secs
lola: 36293891 markings, 124519286 edges, 307243 markings/sec, 100 secs
lola: 37861762 markings, 130092784 edges, 313574 markings/sec, 105 secs
lola: 39407478 markings, 135619511 edges, 309143 markings/sec, 110 secs
lola: 40957877 markings, 141139782 edges, 310080 markings/sec, 115 secs
lola: 42503474 markings, 146691503 edges, 309119 markings/sec, 120 secs
lola: 44038657 markings, 152191085 edges, 307037 markings/sec, 125 secs
lola: 45558587 markings, 157663630 edges, 303986 markings/sec, 130 secs
lola: 47089667 markings, 163157037 edges, 306216 markings/sec, 135 secs
lola: 48609287 markings, 168625159 edges, 303924 markings/sec, 140 secs
lola: 50119108 markings, 174068586 edges, 301964 markings/sec, 145 secs
lola: 51628934 markings, 179528713 edges, 301965 markings/sec, 150 secs
lola: 53128493 markings, 184959694 edges, 299912 markings/sec, 155 secs
lola: 54625979 markings, 190386383 edges, 299497 markings/sec, 160 secs
lola: 56142048 markings, 195882725 edges, 303214 markings/sec, 165 secs
lola: 57621954 markings, 201255543 edges, 295981 markings/sec, 170 secs
lola: 59085548 markings, 206571269 edges, 292719 markings/sec, 175 secs
lola: 60557542 markings, 211937063 edges, 294399 markings/sec, 180 secs
lola: 62028239 markings, 217293437 edges, 294139 markings/sec, 185 secs
lola: 63517704 markings, 222739464 edges, 297893 markings/sec, 190 secs
lola: 64996736 markings, 228130098 edges, 295806 markings/sec, 195 secs
lola: 66456201 markings, 233482317 edges, 291893 markings/sec, 200 secs
lola: 67915993 markings, 238839738 edges, 291958 markings/sec, 205 secs
lola: 69383680 markings, 244198504 edges, 293537 markings/sec, 210 secs
lola: 70842761 markings, 249565826 edges, 291816 markings/sec, 215 secs
lola: 72302618 markings, 254927570 edges, 291971 markings/sec, 220 secs
lola: 73757635 markings, 260283246 edges, 291003 markings/sec, 225 secs
lola: 75215408 markings, 265645228 edges, 291555 markings/sec, 230 secs
lola: 76661288 markings, 270987549 edges, 289176 markings/sec, 235 secs
lola: 78098671 markings, 276294181 edges, 287477 markings/sec, 240 secs
lola: 79543636 markings, 281632207 edges, 288993 markings/sec, 245 secs
lola: 80995276 markings, 286983801 edges, 290328 markings/sec, 250 secs
lola: 82433632 markings, 292321218 edges, 287671 markings/sec, 255 secs
lola: 83839757 markings, 297512721 edges, 281225 markings/sec, 260 secs
lola: 85275115 markings, 302836302 edges, 287072 markings/sec, 265 secs
lola: 86683781 markings, 308062286 edges, 281733 markings/sec, 270 secs
lola: 88077054 markings, 313237790 edges, 278655 markings/sec, 275 secs
lola: 89503654 markings, 318559396 edges, 285320 markings/sec, 280 secs
lola: 90926323 markings, 323854107 edges, 284534 markings/sec, 285 secs
lola: 92348190 markings, 329130944 edges, 284373 markings/sec, 290 secs
lola: 93760028 markings, 334412732 edges, 282368 markings/sec, 295 secs
lola: 95156948 markings, 339639292 edges, 279384 markings/sec, 300 secs
lola: 96300214 markings, 343927484 edges, 228653 markings/sec, 305 secs
lola: 97408666 markings, 348056254 edges, 221690 markings/sec, 310 secs
lola: 98282059 markings, 351332555 edges, 174679 markings/sec, 315 secs
lola: 99255068 markings, 354989425 edges, 194602 markings/sec, 320 secs
lola: 100356152 markings, 359097800 edges, 220217 markings/sec, 325 secs
lola: 100988149 markings, 361476630 edges, 126399 markings/sec, 330 secs
lola: 102042396 markings, 365430990 edges, 210849 markings/sec, 335 secs
lola: 103131788 markings, 369513053 edges, 217878 markings/sec, 340 secs
lola: 104140282 markings, 373294102 edges, 201699 markings/sec, 345 secs
lola: 104699189 markings, 375401558 edges, 111781 markings/sec, 350 secs
lola: 105584132 markings, 378738117 edges, 176989 markings/sec, 355 secs
lola: 106581398 markings, 382484958 edges, 199453 markings/sec, 360 secs
lola: 107575915 markings, 386227065 edges, 198903 markings/sec, 365 secs
lola: 108788841 markings, 390797350 edges, 242585 markings/sec, 370 secs
lola: 109980240 markings, 395261501 edges, 238280 markings/sec, 375 secs
lola: 111045595 markings, 399302160 edges, 213071 markings/sec, 380 secs
lola: 112271845 markings, 403922479 edges, 245250 markings/sec, 385 secs
lola: 113295917 markings, 407771791 edges, 204814 markings/sec, 390 secs
lola: 114445338 markings, 412105357 edges, 229884 markings/sec, 395 secs
lola: 115549207 markings, 416305177 edges, 220774 markings/sec, 400 secs
lola: 116729397 markings, 420773636 edges, 236038 markings/sec, 405 secs
lola: 117758249 markings, 424673187 edges, 205770 markings/sec, 410 secs
lola: 118935846 markings, 429111792 edges, 235519 markings/sec, 415 secs
lola: 119285392 markings, 430467472 edges, 69909 markings/sec, 420 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G ((p5 <= 0)) OR (F ((1 <= p2)) AND F ((F ((p2 <= 0)) OR (p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((1 <= p2))
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: (p2 <= 0)
lola: processed formula length: 9
lola: 67 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: ========================================
lola: ...considering subproblem: G ((p5 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= 0))
lola: processed formula length: 13
lola: 65 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: 290 markings, 290 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((F ((p2 <= 0)) OR (p2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p2 <= 0)) OR (p2 <= 0)))
lola: processed formula length: 32
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p0) AND (1 <= p7))) AND G (F ((((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p3) AND (1 <= p7))) AND F (G (((p0 <= 0) OR (p7 <= 0))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (1 <= p7))
lola: processed formula length: 25
lola: 65 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: ========================================
lola: ...considering subproblem: F (((1 <= p0) AND (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p0 <= 0) OR (p7 <= 0))
lola: processed formula length: 25
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p3) AND (1 <= p7))) AND F (G (((p0 <= 0) OR (p7 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p3) AND (1 <= p7)) OR (F (((1 <= p3) AND (1 <= p7))) AND F (G (((p0 <= 0) OR (p7 <= 0))))))))
lola: processed formula length: 108
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1811968 markings, 9931494 edges, 362394 markings/sec, 0 secs
lola: 3485872 markings, 19343997 edges, 334781 markings/sec, 5 secs
lola: 5505596 markings, 28439819 edges, 403945 markings/sec, 10 secs
lola: 8316528 markings, 35126307 edges, 562186 markings/sec, 15 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: 8977781 markings, 37077020 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no unknown yes no no no
lola:
preliminary result: yes yes yes yes no no no unknown yes no no no
lola: memory consumption: 3268 KB
lola: time consumption: 877 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-04"
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-04, 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-162106800700370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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