About the Execution of 2020-gold for TCPcondis-PT-40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16254.088 | 3600000.00 | 1021621.00 | 20469.40 | FFF?FTFFFFFFTFFF | normal |
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-162106800800426.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 TCPcondis-PT-40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800800426
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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
-rwxr-xr-x 1 mcc users 24K 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 TCPcondis-PT-40-00
FORMULA_NAME TCPcondis-PT-40-01
FORMULA_NAME TCPcondis-PT-40-02
FORMULA_NAME TCPcondis-PT-40-03
FORMULA_NAME TCPcondis-PT-40-04
FORMULA_NAME TCPcondis-PT-40-05
FORMULA_NAME TCPcondis-PT-40-06
FORMULA_NAME TCPcondis-PT-40-07
FORMULA_NAME TCPcondis-PT-40-08
FORMULA_NAME TCPcondis-PT-40-09
FORMULA_NAME TCPcondis-PT-40-10
FORMULA_NAME TCPcondis-PT-40-11
FORMULA_NAME TCPcondis-PT-40-12
FORMULA_NAME TCPcondis-PT-40-13
FORMULA_NAME TCPcondis-PT-40-14
FORMULA_NAME TCPcondis-PT-40-15
=== Now, execution of the tool begins
BK_START 1621228805899
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 05:20:07] [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 05:20:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 05:20:07] [WARNING] Skipping unknown tool specific annotation : Tina
[2021-05-17 05:20:07] [WARNING] Unknown XML tag in source file: size
[2021-05-17 05:20:07] [WARNING] Unknown XML tag in source file: color
[2021-05-17 05:20:07] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-17 05:20:07] [INFO ] Transformed 30 places.
[2021-05-17 05:20:07] [INFO ] Transformed 32 transitions.
[2021-05-17 05:20:07] [INFO ] Parsed PT model containing 30 places and 32 transitions in 73 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 46860 steps, including 0 resets, run visited all 32 properties in 35 ms. (steps per millisecond=1338 )
[2021-05-17 05:20:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-17 05:20:07] [INFO ] Flatten gal took : 27 ms
FORMULA TCPcondis-PT-40-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 05:20:07] [INFO ] Flatten gal took : 6 ms
[2021-05-17 05:20:07] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-17 05:20:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ TCPcondis-PT-40 @ 3570 seconds
FORMULA TCPcondis-PT-40-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA TCPcondis-PT-40-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2553
rslt: Output for LTLFireability @ TCPcondis-PT-40
{
"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 05:20:08 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": "(1 <= p1)",
"processed_size": 9,
"rewrites": 75
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X ((1 <= p1)) AND F (G (((1 <= p6) AND (1 <= p20))))))",
"processed_size": 58,
"rewrites": 75
},
"result":
{
"edges": 368,
"markings": 367,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((X (G ((p16 <= 0))) AND (1 <= p16)))",
"processed_size": 39,
"rewrites": 75
},
"result":
{
"edges": 10480,
"markings": 5081,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((G (((p7 <= 0) OR (p19 <= 0))) AND X (((1 <= p4) AND (1 <= p21)))))",
"processed_size": 71,
"rewrites": 75
},
"result":
{
"edges": 366,
"markings": 366,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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 <= p8) AND (1 <= p20))",
"processed_size": 26,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "F ((X (F (((p8 <= 0) OR (p20 <= 0)))) OR ((1 <= p8) AND (1 <= p20))))",
"processed_size": 70,
"rewrites": 75
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((((1 <= p4) AND (1 <= p21)) AND (F ((X (((1 <= p4) AND (1 <= p21))) OR (1 <= p15))) OR G (((1 <= p4) AND (1 <= p21))))) R (1 <= p15))",
"processed_size": 134,
"rewrites": 75
},
"result":
{
"edges": 366,
"markings": 366,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 329
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (G (((1 <= p6) AND (1 <= p19)))) OR (1 <= p18)))",
"processed_size": 54,
"rewrites": 75
},
"result":
{
"edges": 366,
"markings": 366,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 365
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (F (((1 <= p8) AND (1 <= p20)))) AND F ((((1 <= p8) AND (1 <= p20)) OR (1 <= p15)))))",
"processed_size": 92,
"rewrites": 75
},
"result":
{
"edges": 1192,
"markings": 999,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 411
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "F ((((1 <= p7) AND (1 <= p19)) OR X ((X (((1 <= p5) AND (1 <= p21))) AND ((1 <= p7) AND (1 <= p19))))))",
"processed_size": 103,
"rewrites": 75
},
"result":
{
"edges": 366,
"markings": 366,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 470
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((((1 <= p6) AND (1 <= p20) AND (1 <= p9) AND (1 <= p25)) OR (G ((X (G (((p9 <= 0) OR (p25 <= 0)))) OR ((p4 <= 0) OR (p18 <= 0)))) AND F (((1 <= p6) AND (1 <= p20) AND (1 <= p9) AND (1 <= p25))))))",
"processed_size": 200,
"rewrites": 75
},
"result":
{
"edges": 366,
"markings": 366,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 548
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (G (((((1 <= p4) AND (1 <= p21)) OR (G (((1 <= p4) AND (1 <= p21))) AND F (((1 <= p4) AND (1 <= p21))))) AND ((1 <= p4) AND (1 <= p21))))) U (X (((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0))) OR ((p4 <= 0) OR (p21 <= 0)))))",
"processed_size": 226,
"rewrites": 75
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 9,
"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": 658
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(X ((F (G (((1 <= p13) AND (1 <= p25) AND (1 <= p26)))) AND (X ((1 <= p3)) AND ((1 <= p13) AND ((1 <= p25) AND (1 <= p26)))))) U G (((1 <= p4) AND (1 <= p18))))",
"processed_size": 160,
"rewrites": 75
},
"result":
{
"edges": 366,
"markings": 366,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 17
},
"compoundnumber": 10,
"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": 823
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 823
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p8) AND (1 <= p20))) AND (((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p20))))))",
"processed_size": 103,
"rewrites": 75
},
"result":
{
"edges": 373,
"markings": 372,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1097
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((1 <= p15) AND F ((X ((p3 <= 0)) AND (p1 <= 0)))))",
"processed_size": 54,
"rewrites": 75
},
"result":
{
"edges": 446,
"markings": 446,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"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": 1646
},
"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 (((p10 <= 0) OR (p28 <= 0))))",
"processed_size": 35,
"rewrites": 75
},
"result":
{
"edges": 160507,
"markings": 85466,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3293
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((G ((F ((1 <= p1)) OR ((1 <= p7) AND (1 <= p19)))) OR ((1 <= p5) AND (1 <= p17))))",
"processed_size": 85,
"rewrites": 75
},
"result":
{
"edges": 86657,
"markings": 51134,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3528,
"runtime": 1017.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((X(**) AND F(G(**)))) OR **) : (G((G(**) AND X(**))) OR (G((X(G(*)) AND **)) AND F(G((G(**) AND X(**)))))) : X(G((F(**) AND (X(X(*)) OR **)))) : G(F(*)) : (F(*) AND F((X(F(*)) OR **))) : ((* AND (F((X(**) OR *)) OR G(*))) R *) : X((F(G(**)) OR **)) : X((X(F(**)) AND F(**))) : F((** OR X((X(**) AND **)))) : F((G((F(**) OR **)) OR **)) : X((** OR (G((X(G(**)) OR (** OR **))) AND F(**)))) : X((X(G(((** OR (G(**) AND F(**))) AND (** AND **)))) U (X(*) OR (** OR **)))) : (X((F(G(**)) AND (X(**) AND (** AND (** AND **))))) U G(**)) : ((** U X(**)) AND F(G((F(**) AND (** OR **))))) : G((** AND F((X(*) AND *))))"
},
"net":
{
"arcs": 108,
"conflict_clusters": 10,
"places": 30,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "no no unknown no yes no no no no no no yes no no no ",
"value": "no no unknown no yes no no no no no no 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: 62/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 32 transitions, 21 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: (X ((X ((1 <= p1)) AND F (X (X (G (((1 <= p6) AND (1 <= p20)))))))) OR (1 <= p1)) : (G ((NOT(F (X ((1 <= p16)))) AND (1 <= p16))) U G ((G (((p7 <= 0) OR (p19 <= 0))) AND X (((1 <= p4) AND (1 <= p21)))))) : G (X (G ((NOT(X (X ((1 <= p3)))) U (1 <= p3))))) : X (G (F (NOT(X (((1 <= p10) AND (1 <= p28))))))) : (NOT(G (((1 <= p8) AND (1 <= p20)))) AND F ((NOT(G (X (((1 <= p8) AND (1 <= p20))))) OR ((1 <= p8) AND (1 <= p20))))) : NOT(((G ((NOT(X (((1 <= p4) AND (1 <= p21)))) AND (p15 <= 0))) U ((p4 <= 0) OR (p21 <= 0))) U (p15 <= 0))) : X ((X (F (G (((1 <= p6) AND (1 <= p19))))) OR (1 <= p18))) : (X (F (X (((1 <= p8) AND (1 <= p20))))) AND X (F ((((1 <= p8) AND (1 <= p20)) OR (1 <= p15))))) : F ((((1 <= p7) AND (1 <= p19)) OR (X (X (((1 <= p5) AND (1 <= p21)))) AND X (((1 <= p7) AND (1 <= p19)))))) : F ((G ((F ((1 <= p1)) OR ((1 <= p7) AND (1 <= p19)))) OR ((1 <= p5) AND (1 <= p17)))) : X ((G (((X (G (((p9 <= 0) OR (p25 <= 0)))) OR (p4 <= 0)) OR (p18 <= 0))) U ((1 <= p6) AND (1 <= p20) AND (1 <= p9) AND (1 <= p25)))) : X ((G (X ((((G (((1 <= p4) AND (1 <= p21))) U ((1 <= p4) AND (1 <= p21))) AND (1 <= p4)) AND (1 <= p21)))) U ((NOT(X (((1 <= p13) AND (1 <= p25) AND (1 <= p26)))) OR (p4 <= 0)) OR (p21 <= 0)))) : (X (((((F (G (((1 <= p13) AND (1 <= p25) AND (1 <= p26)))) AND X ((1 <= p3))) AND (1 <= p13)) AND (1 <= p25)) AND (1 <= p26))) U G (((1 <= p4) AND (1 <= p18)))) : ((((1 <= p13) AND (1 <= p25) AND (1 <= p26)) U X (((1 <= p13) AND (1 <= p25) AND (1 <= p26)))) AND F (G ((((1 <= p5) AND (1 <= p23)) U ((1 <= p8) AND (1 <= p20)))))) : G ((G ((1 <= p15)) AND NOT(X (X (G (X (F (G ((X ((1 <= p3)) OR (1 <= p1)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:431
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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: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: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X ((1 <= p1)) AND F (G (((1 <= p6) AND (1 <= p20)))))) OR (1 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p1)
lola: processed formula length: 9
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 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 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((1 <= p1)) AND F (G (((1 <= p6) AND (1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((1 <= p1)) AND F (G (((1 <= p6) AND (1 <= p20))))))
lola: processed formula length: 58
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 367 markings, 368 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((G (((p7 <= 0) OR (p19 <= 0))) AND X (((1 <= p4) AND (1 <= p21))))) OR (G ((X (G ((p16 <= 0))) AND (1 <= p16))) AND F (G ((G (((p7 <= 0) OR (p19 <= 0))) AND X (((1 <= p4) AND (1 <= p21))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((p16 <= 0))) AND (1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((p16 <= 0))) AND (1 <= p16)))
lola: processed formula length: 39
lola: 75 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: 5081 markings, 10480 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p7 <= 0) OR (p19 <= 0))) AND X (((1 <= p4) AND (1 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p7 <= 0) OR (p19 <= 0))) AND X (((1 <= p4) AND (1 <= p21)))))
lola: processed formula length: 71
lola: 75 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: 366 markings, 366 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((1 <= p3)) AND (X (X ((p3 <= 0))) OR (1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((1 <= p3)) AND (X (X ((p3 <= 0))) OR (1 <= p3)))))
lola: processed formula length: 60
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1623041 markings, 7459817 edges, 324608 markings/sec, 0 secs
lola: 3020228 markings, 14104337 edges, 279437 markings/sec, 5 secs
lola: 4371346 markings, 20603187 edges, 270224 markings/sec, 10 secs
lola: 5644521 markings, 26817301 edges, 254635 markings/sec, 15 secs
lola: 6907804 markings, 32996103 edges, 252657 markings/sec, 20 secs
lola: 8113902 markings, 38879287 edges, 241220 markings/sec, 25 secs
lola: 9333368 markings, 44819891 edges, 243893 markings/sec, 30 secs
lola: 10562263 markings, 50827945 edges, 245779 markings/sec, 35 secs
lola: 11688219 markings, 56490897 edges, 225191 markings/sec, 40 secs
lola: 12864333 markings, 62201284 edges, 235223 markings/sec, 45 secs
lola: 14047871 markings, 68131939 edges, 236708 markings/sec, 50 secs
lola: 15137765 markings, 73445704 edges, 217979 markings/sec, 55 secs
lola: 16231434 markings, 78995773 edges, 218734 markings/sec, 60 secs
lola: 17374618 markings, 84524890 edges, 228637 markings/sec, 65 secs
lola: 18388560 markings, 89642161 edges, 202788 markings/sec, 70 secs
lola: 19619110 markings, 95692816 edges, 246110 markings/sec, 75 secs
lola: 20593697 markings, 100545872 edges, 194917 markings/sec, 80 secs
lola: 21601561 markings, 105678525 edges, 201573 markings/sec, 85 secs
lola: 22843328 markings, 111756402 edges, 248353 markings/sec, 90 secs
lola: 23794048 markings, 116495316 edges, 190144 markings/sec, 95 secs
lola: 24770604 markings, 121463872 edges, 195311 markings/sec, 100 secs
lola: 25910727 markings, 127268049 edges, 228025 markings/sec, 105 secs
lola: 27009325 markings, 132547704 edges, 219720 markings/sec, 110 secs
lola: 27943329 markings, 137257535 edges, 186801 markings/sec, 115 secs
lola: 28923831 markings, 142261045 edges, 196100 markings/sec, 120 secs
lola: 30075122 markings, 148094883 edges, 230258 markings/sec, 125 secs
lola: 31138927 markings, 153230665 edges, 212761 markings/sec, 130 secs
lola: 32053590 markings, 157839464 edges, 182933 markings/sec, 135 secs
lola: 33015798 markings, 162750957 edges, 192442 markings/sec, 140 secs
lola: 34075721 markings, 168181343 edges, 211985 markings/sec, 145 secs
lola: 35351199 markings, 174628903 edges, 255096 markings/sec, 150 secs
lola: 36375025 markings, 180343014 edges, 204765 markings/sec, 155 secs
lola: 37301974 markings, 185623379 edges, 185390 markings/sec, 160 secs
lola: 38189270 markings, 190753755 edges, 177459 markings/sec, 165 secs
lola: 39068495 markings, 195791955 edges, 175845 markings/sec, 170 secs
lola: 39923956 markings, 200759345 edges, 171092 markings/sec, 175 secs
lola: 40741319 markings, 205586812 edges, 163473 markings/sec, 180 secs
lola: 41585214 markings, 210461454 edges, 168779 markings/sec, 185 secs
lola: 42443295 markings, 215443092 edges, 171616 markings/sec, 190 secs
lola: 43252510 markings, 220277708 edges, 161843 markings/sec, 195 secs
lola: 44084676 markings, 225076912 edges, 166433 markings/sec, 200 secs
lola: 44894763 markings, 229950530 edges, 162017 markings/sec, 205 secs
lola: 45727786 markings, 234739283 edges, 166605 markings/sec, 210 secs
lola: 46525025 markings, 239535138 edges, 159448 markings/sec, 215 secs
lola: 47392133 markings, 244538115 edges, 173422 markings/sec, 220 secs
lola: 48160667 markings, 249137122 edges, 153707 markings/sec, 225 secs
lola: 49006928 markings, 254192154 edges, 169252 markings/sec, 230 secs
lola: 49813187 markings, 258854457 edges, 161252 markings/sec, 235 secs
lola: 50581836 markings, 263471890 edges, 153730 markings/sec, 240 secs
lola: 51422396 markings, 268517703 edges, 168112 markings/sec, 245 secs
lola: 52225116 markings, 273150839 edges, 160544 markings/sec, 250 secs
lola: 52968324 markings, 277612885 edges, 148642 markings/sec, 255 secs
lola: 53747609 markings, 282341878 edges, 155857 markings/sec, 260 secs
lola: 54630204 markings, 287450835 edges, 176519 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8730460 KB
lola: time consumption: 277 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: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p8 <= 0) OR (p20 <= 0))) AND F ((X (F (((p8 <= 0) OR (p20 <= 0)))) OR ((1 <= p8) AND (1 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p8 <= 0) OR (p20 <= 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 <= p8) AND (1 <= p20))
lola: processed formula length: 26
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((p8 <= 0) OR (p20 <= 0)))) OR ((1 <= p8) AND (1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((p8 <= 0) OR (p20 <= 0)))) OR ((1 <= p8) AND (1 <= p20))))
lola: processed formula length: 70
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p4) AND (1 <= p21)) AND (F ((X (((1 <= p4) AND (1 <= p21))) OR (1 <= p15))) OR G (((1 <= p4) AND (1 <= p21))))) R (1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p4) AND (1 <= p21)) AND (F ((X (((1 <= p4) AND (1 <= p21))) OR (1 <= p15))) OR G (((1 <= p4) AND (1 <= p21))))) R (1 <= p15))
lola: processed formula length: 134
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 366 markings, 366 edges
lola: ========================================
lola: subprocess 5 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((1 <= p6) AND (1 <= p19)))) OR (1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((1 <= p6) AND (1 <= p19)))) OR (1 <= p18)))
lola: processed formula length: 54
lola: 75 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: 366 markings, 366 edges
lola: ========================================
lola: subprocess 6 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F (((1 <= p8) AND (1 <= p20)))) AND F ((((1 <= p8) AND (1 <= p20)) OR (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F (((1 <= p8) AND (1 <= p20)))) AND F ((((1 <= p8) AND (1 <= p20)) OR (1 <= p15)))))
lola: processed formula length: 92
lola: 75 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: 999 markings, 1192 edges
lola: ========================================
lola: subprocess 7 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p7) AND (1 <= p19)) OR X ((X (((1 <= p5) AND (1 <= p21))) AND ((1 <= p7) AND (1 <= p19))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p7) AND (1 <= p19)) OR X ((X (((1 <= p5) AND (1 <= p21))) AND ((1 <= p7) AND (1 <= p19))))))
lola: processed formula length: 103
lola: 75 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: 366 markings, 366 edges
lola: ========================================
lola: subprocess 8 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p6) AND (1 <= p20) AND (1 <= p9) AND (1 <= p25)) OR (G ((X (G (((p9 <= 0) OR (p25 <= 0)))) OR ((p4 <= 0) OR (p18 <= 0)))) AND F (((1 <= p6) AND (1 <= p20) AND (1 <= p9) AND (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p6) AND (1 <= p20) AND (1 <= p9) AND (1 <= p25)) OR (G ((X (G (((p9 <= 0) OR (p25 <= 0)))) OR ((p4 <= 0) OR (p18 <= 0)))) AND F (((1 <= p6) AND (1 <= p20) AND (1 <= p9) AND (1 <= p25))))))
lola: processed formula length: 200
lola: 75 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: 366 markings, 366 edges
lola: ========================================
lola: subprocess 9 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((((1 <= p4) AND (1 <= p21)) OR (G (((1 <= p4) AND (1 <= p21))) AND F (((1 <= p4) AND (1 <= p21))))) AND ((1 <= p4) AND (1 <= p21))))) U (X (((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0))) OR ((p4 <= 0) OR (p21 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((((1 <= p4) AND (1 <= p21)) OR (G (((1 <= p4) AND (1 <= p21))) AND F (((1 <= p4) AND (1 <= p21))))) AND ((1 <= p4) AND (1 <= p21))))) U (X (((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0))) OR ((p4 <= 0) OR (p21 <= 0)))))
lola: processed formula length: 226
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F (G (((1 <= p13) AND (1 <= p25) AND (1 <= p26)))) AND (X ((1 <= p3)) AND ((1 <= p13) AND ((1 <= p25) AND (1 <= p26)))))) U G (((1 <= p4) AND (1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((F (G (((1 <= p13) AND (1 <= p25) AND (1 <= p26)))) AND (X ((1 <= p3)) AND ((1 <= p13) AND ((1 <= p25) AND (1 <= p26)))))) U G (((1 <= p4) AND (1 <= p18))))
lola: processed formula length: 160
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 17 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: 366 markings, 366 edges
lola: ========================================
lola: subprocess 11 will run for 823 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p13) AND (1 <= p25) AND (1 <= p26)) U X (((1 <= p13) AND (1 <= p25) AND (1 <= p26)))) AND F (G ((F (((1 <= p8) AND (1 <= p20))) AND (((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p20)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 823 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p8) AND (1 <= p20))) AND (((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p8) AND (1 <= p20))) AND (((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p20))))))
lola: processed formula length: 103
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 372 markings, 373 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1097 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p15) AND F ((X ((p3 <= 0)) AND (p1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p15) AND F ((X ((p3 <= 0)) AND (p1 <= 0)))))
lola: processed formula length: 54
lola: 75 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: 446 markings, 446 edges
lola: ========================================
lola: subprocess 13 will run for 1646 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p10 <= 0) OR (p28 <= 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 (((p10 <= 0) OR (p28 <= 0))))
lola: processed formula length: 35
lola: 75 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: 85466 markings, 160507 edges
lola: ========================================
lola: subprocess 14 will run for 3293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((1 <= p1)) OR ((1 <= p7) AND (1 <= p19)))) OR ((1 <= p5) AND (1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((1 <= p1)) OR ((1 <= p7) AND (1 <= p19)))) OR ((1 <= p5) AND (1 <= p17))))
lola: processed formula length: 85
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51134 markings, 86657 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((F ((1 <= p3)) AND (X (X ((p3 <= 0))) OR (1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((1 <= p3)) AND (X (X ((p3 <= 0))) OR (1 <= p3)))))
lola: processed formula length: 60
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1652561 markings, 7593901 edges, 330512 markings/sec, 0 secs
lola: 3060442 markings, 14305989 edges, 281576 markings/sec, 5 secs
lola: 4403635 markings, 20757021 edges, 268639 markings/sec, 10 secs
lola: 5677482 markings, 26977965 edges, 254769 markings/sec, 15 secs
lola: 6921719 markings, 33068212 edges, 248847 markings/sec, 20 secs
lola: 8116265 markings, 38891237 edges, 238909 markings/sec, 25 secs
lola: 9316136 markings, 44732021 edges, 239974 markings/sec, 30 secs
lola: 10534911 markings, 50690789 edges, 243755 markings/sec, 35 secs
lola: 11635068 markings, 56215991 edges, 220031 markings/sec, 40 secs
lola: 12794857 markings, 61848028 edges, 231958 markings/sec, 45 secs
lola: 13928177 markings, 67577977 edges, 226664 markings/sec, 50 secs
lola: 15039844 markings, 72959436 edges, 222333 markings/sec, 55 secs
lola: 16127803 markings, 78458630 edges, 217592 markings/sec, 60 secs
lola: 17292471 markings, 84110835 edges, 232934 markings/sec, 65 secs
lola: 18309065 markings, 89235326 edges, 203319 markings/sec, 70 secs
lola: 19539511 markings, 95312226 edges, 246089 markings/sec, 75 secs
lola: 20521345 markings, 100177793 edges, 196367 markings/sec, 80 secs
lola: 21523291 markings, 105269289 edges, 200389 markings/sec, 85 secs
lola: 22736667 markings, 111248069 edges, 242675 markings/sec, 90 secs
lola: 23668517 markings, 115867373 edges, 186370 markings/sec, 95 secs
lola: 24639420 markings, 120780851 edges, 194181 markings/sec, 100 secs
lola: 25729673 markings, 126365514 edges, 218051 markings/sec, 105 secs
lola: 26891753 markings, 131958986 edges, 232416 markings/sec, 110 secs
lola: 27818426 markings, 136627343 edges, 185335 markings/sec, 115 secs
lola: 28805990 markings, 141652791 edges, 197513 markings/sec, 120 secs
lola: 29907099 markings, 147324368 edges, 220222 markings/sec, 125 secs
lola: 31042275 markings, 152737584 edges, 227035 markings/sec, 130 secs
lola: 31956629 markings, 157357525 edges, 182871 markings/sec, 135 secs
lola: 32923244 markings, 162271980 edges, 193323 markings/sec, 140 secs
lola: 33934151 markings, 167477252 edges, 202181 markings/sec, 145 secs
lola: 35211086 markings, 173870479 edges, 255387 markings/sec, 150 secs
lola: 36240738 markings, 179599810 edges, 205930 markings/sec, 155 secs
lola: 37203085 markings, 185051010 edges, 192469 markings/sec, 160 secs
lola: 38104860 markings, 190263391 edges, 180355 markings/sec, 165 secs
lola: 39028883 markings, 195571711 edges, 184805 markings/sec, 170 secs
lola: 39912886 markings, 200697398 edges, 176801 markings/sec, 175 secs
lola: 40757817 markings, 205681665 edges, 168986 markings/sec, 180 secs
lola: 41613010 markings, 210631243 edges, 171039 markings/sec, 185 secs
lola: 42488552 markings, 215707770 edges, 175108 markings/sec, 190 secs
lola: 43318217 markings, 220674584 edges, 165933 markings/sec, 195 secs
lola: 44163738 markings, 225545454 edges, 169104 markings/sec, 200 secs
lola: 44997335 markings, 230519281 edges, 166719 markings/sec, 205 secs
lola: 45804386 markings, 235191944 edges, 161410 markings/sec, 210 secs
lola: 46605213 markings, 240003707 edges, 160165 markings/sec, 215 secs
lola: 47448512 markings, 244875824 edges, 168660 markings/sec, 220 secs
lola: 48216096 markings, 249471348 edges, 153517 markings/sec, 225 secs
lola: 49068161 markings, 254540357 edges, 170413 markings/sec, 230 secs
lola: 49857254 markings, 259121608 edges, 157819 markings/sec, 235 secs
lola: 50625602 markings, 263735541 edges, 153670 markings/sec, 240 secs
lola: 51465154 markings, 268760368 edges, 167910 markings/sec, 245 secs
lola: 52269878 markings, 273411702 edges, 160945 markings/sec, 250 secs
lola: 53023531 markings, 277951138 edges, 150731 markings/sec, 255 secs
lola: 53830486 markings, 282824521 edges, 161391 markings/sec, 260 secs
lola: 54709770 markings, 287913436 edges, 175857 markings/sec, 265 secs
lola: 55443688 markings, 292290814 edges, 146784 markings/sec, 270 secs
lola: 56208948 markings, 296905605 edges, 153052 markings/sec, 275 secs
lola: 57018488 markings, 301816669 edges, 161908 markings/sec, 280 secs
lola: 57908871 markings, 306959076 edges, 178077 markings/sec, 285 secs
lola: 58644643 markings, 311348366 edges, 147154 markings/sec, 290 secs
lola: 59397773 markings, 315888075 edges, 150626 markings/sec, 295 secs
lola: 60181373 markings, 320640495 edges, 156720 markings/sec, 300 secs
lola: 61054657 markings, 325870874 edges, 174657 markings/sec, 305 secs
lola: 61872368 markings, 330596574 edges, 163542 markings/sec, 310 secs
lola: 62593157 markings, 334920579 edges, 144158 markings/sec, 315 secs
lola: 63344636 markings, 339476331 edges, 150296 markings/sec, 320 secs
lola: 64130676 markings, 344243611 edges, 157208 markings/sec, 325 secs
lola: 64994200 markings, 349468133 edges, 172705 markings/sec, 330 secs
lola: 65849732 markings, 354375666 edges, 171106 markings/sec, 335 secs
lola: 66574105 markings, 358708719 edges, 144875 markings/sec, 340 secs
lola: 67314066 markings, 363183213 edges, 147992 markings/sec, 345 secs
lola: 68081479 markings, 367866168 edges, 153483 markings/sec, 350 secs
lola: 68901246 markings, 372876718 edges, 163953 markings/sec, 355 secs
lola: 69873131 markings, 378623706 edges, 194377 markings/sec, 360 secs
lola: 70901113 markings, 384386085 edges, 205596 markings/sec, 365 secs
lola: 71802937 markings, 389521751 edges, 180365 markings/sec, 370 secs
lola: 72672350 markings, 394528922 edges, 173883 markings/sec, 375 secs
lola: 73492247 markings, 399294730 edges, 163979 markings/sec, 380 secs
lola: 74299572 markings, 404001495 edges, 161465 markings/sec, 385 secs
lola: 75106354 markings, 408707326 edges, 161356 markings/sec, 390 secs
lola: 75917402 markings, 413466824 edges, 162210 markings/sec, 395 secs
lola: 76664285 markings, 417897946 edges, 149377 markings/sec, 400 secs
lola: 77457360 markings, 422516087 edges, 158615 markings/sec, 405 secs
lola: 78222648 markings, 427122903 edges, 153058 markings/sec, 410 secs
lola: 79005446 markings, 431654071 edges, 156560 markings/sec, 415 secs
lola: 79773404 markings, 436287932 edges, 153592 markings/sec, 420 secs
lola: 80563165 markings, 440864325 edges, 157952 markings/sec, 425 secs
lola: 81291378 markings, 445256075 edges, 145643 markings/sec, 430 secs
lola: 82113521 markings, 450063997 edges, 164429 markings/sec, 435 secs
lola: 82818519 markings, 454272147 edges, 141000 markings/sec, 440 secs
lola: 83559803 markings, 458765953 edges, 148257 markings/sec, 445 secs
lola: 84380707 markings, 463531165 edges, 164181 markings/sec, 450 secs
lola: 85078372 markings, 467709715 edges, 139533 markings/sec, 455 secs
lola: 85804835 markings, 472108245 edges, 145293 markings/sec, 460 secs
lola: 86632414 markings, 476976593 edges, 165516 markings/sec, 465 secs
lola: 87341560 markings, 481177464 edges, 141829 markings/sec, 470 secs
lola: 88054997 markings, 485492043 edges, 142687 markings/sec, 475 secs
lola: 88803977 markings, 490050713 edges, 149796 markings/sec, 480 secs
lola: 89626314 markings, 494830759 edges, 164467 markings/sec, 485 secs
lola: 90317217 markings, 498957146 edges, 138181 markings/sec, 490 secs
lola: 91020253 markings, 503222497 edges, 140607 markings/sec, 495 secs
lola: 91749498 markings, 507672142 edges, 145849 markings/sec, 500 secs
lola: 92597708 markings, 512665325 edges, 169642 markings/sec, 505 secs
lola: 93296227 markings, 516784284 edges, 139704 markings/sec, 510 secs
lola: 93979906 markings, 520922575 edges, 136736 markings/sec, 515 secs
lola: 94693059 markings, 525264070 edges, 142631 markings/sec, 520 secs
lola: 95458409 markings, 529923300 edges, 153070 markings/sec, 525 secs
lola: 96309564 markings, 534891704 edges, 170231 markings/sec, 530 secs
lola: 96998771 markings, 538984139 edges, 137841 markings/sec, 535 secs
lola: 97682112 markings, 543116218 edges, 136668 markings/sec, 540 secs
lola: 98396416 markings, 547463729 edges, 142861 markings/sec, 545 secs
lola: 99134691 markings, 551978696 edges, 147655 markings/sec, 550 secs
lola: 99945287 markings, 556899619 edges, 162119 markings/sec, 555 secs
lola: 100746523 markings, 561512521 edges, 160247 markings/sec, 560 secs
lola: 101419012 markings, 565554821 edges, 134498 markings/sec, 565 secs
lola: 101914010 markings, 568570366 edges, 99000 markings/sec, 570 secs
lola: 102562315 markings, 572503763 edges, 129661 markings/sec, 575 secs
lola: 103279426 markings, 576892743 edges, 143422 markings/sec, 580 secs
lola: 104045886 markings, 581589531 edges, 153292 markings/sec, 585 secs
lola: 104825312 markings, 586202283 edges, 155885 markings/sec, 590 secs
lola: 105188866 markings, 588225711 edges, 72711 markings/sec, 595 secs
lola: 106090793 markings, 593257917 edges, 180385 markings/sec, 600 secs
lola: 106913228 markings, 597957460 edges, 164487 markings/sec, 605 secs
lola: 107752154 markings, 602738077 edges, 167785 markings/sec, 610 secs
lola: 108458464 markings, 606816238 edges, 141262 markings/sec, 615 secs
lola: 109246705 markings, 611378913 edges, 157648 markings/sec, 620 secs
lola: 110031554 markings, 615931475 edges, 156970 markings/sec, 625 secs
lola: 110826994 markings, 620567611 edges, 159088 markings/sec, 630 secs
lola: 111577520 markings, 625000226 edges, 150105 markings/sec, 635 secs
lola: 112375839 markings, 629622900 edges, 159664 markings/sec, 640 secs
lola: 113125554 markings, 634112611 edges, 149943 markings/sec, 645 secs
lola: 113762465 markings, 637751956 edges, 127382 markings/sec, 650 secs
lola: 114501302 markings, 642173644 edges, 147767 markings/sec, 655 secs
lola: 115223784 markings, 646341504 edges, 144496 markings/sec, 660 secs
lola: 115925388 markings, 650519442 edges, 140321 markings/sec, 665 secs
lola: 116693180 markings, 655104142 edges, 153558 markings/sec, 670 secs
lola: 117429146 markings, 659359330 edges, 147193 markings/sec, 675 secs
lola: 118143047 markings, 663642215 edges, 142780 markings/sec, 680 secs
lola: 118930773 markings, 668315793 edges, 157545 markings/sec, 685 secs
lola: 119546124 markings, 671872800 edges, 123070 markings/sec, 690 secs
lola: 120242987 markings, 676050467 edges, 139373 markings/sec, 695 secs
lola: 120980871 markings, 680519294 edges, 147577 markings/sec, 700 secs
lola: 121776997 markings, 685100676 edges, 159225 markings/sec, 705 secs
lola: 122458782 markings, 689176556 edges, 136357 markings/sec, 710 secs
lola: 123115790 markings, 693127734 edges, 131402 markings/sec, 715 secs
lola: 123839910 markings, 697541926 edges, 144824 markings/sec, 720 secs
lola: 124593638 markings, 701839890 edges, 150746 markings/sec, 725 secs
lola: 125201323 markings, 705460943 edges, 121537 markings/sec, 730 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no unknown no yes no no no no no no yes no no no
lola:
preliminary result: no no unknown no yes no no no no no no yes no no no
lola: memory consumption: 3528 KB
lola: time consumption: 1017 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="TCPcondis-PT-40"
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 TCPcondis-PT-40, 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-162106800800426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-40.tgz
mv TCPcondis-PT-40 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;