About the Execution of 2020-gold for Philosophers-PT-000005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4291.855 | 3600000.00 | 8511.00 | 235.20 | FFTFFFFFFTFFFFFF | 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.r151-tall-162089151600418.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 Philosophers-PT-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151600418
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 24K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 137K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.4K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 22K May 5 16:51 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 Philosophers-PT-000005-00
FORMULA_NAME Philosophers-PT-000005-01
FORMULA_NAME Philosophers-PT-000005-02
FORMULA_NAME Philosophers-PT-000005-03
FORMULA_NAME Philosophers-PT-000005-04
FORMULA_NAME Philosophers-PT-000005-05
FORMULA_NAME Philosophers-PT-000005-06
FORMULA_NAME Philosophers-PT-000005-07
FORMULA_NAME Philosophers-PT-000005-08
FORMULA_NAME Philosophers-PT-000005-09
FORMULA_NAME Philosophers-PT-000005-10
FORMULA_NAME Philosophers-PT-000005-11
FORMULA_NAME Philosophers-PT-000005-12
FORMULA_NAME Philosophers-PT-000005-13
FORMULA_NAME Philosophers-PT-000005-14
FORMULA_NAME Philosophers-PT-000005-15
=== Now, execution of the tool begins
BK_START 1621050454018
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 03:47:35] [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-15 03:47:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 03:47:35] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-15 03:47:35] [INFO ] Transformed 25 places.
[2021-05-15 03:47:35] [INFO ] Transformed 25 transitions.
[2021-05-15 03:47:35] [INFO ] Found NUPN structural information;
[2021-05-15 03:47:35] [INFO ] Parsed PT model containing 25 places and 25 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 43 steps, including 2 resets, run visited all 39 properties in 3 ms. (steps per millisecond=14 )
[2021-05-15 03:47:35] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-15 03:47:35] [INFO ] Flatten gal took : 29 ms
FORMULA Philosophers-PT-000005-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 03:47:35] [INFO ] Applying decomposition
[2021-05-15 03:47:35] [INFO ] Flatten gal took : 6 ms
[2021-05-15 03:47:36] [INFO ] Decomposing Gal with order
[2021-05-15 03:47:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 03:47:36] [INFO ] Removed a total of 9 redundant transitions.
[2021-05-15 03:47:36] [INFO ] Flatten gal took : 32 ms
[2021-05-15 03:47:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-15 03:47:36] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2021-05-15 03:47:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Philosophers-PT-000005 @ 3570 seconds
FORMULA Philosophers-PT-000005-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ Philosophers-PT-000005
{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 15 03:47:37 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 10,
"adisj": 2,
"aneg": 2,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (F ((G ((((p7 <= 0) OR (p17 <= 0)) AND ((p6 <= 0) OR (p18 <= 0)) AND ((p8 <= 0) OR (p20 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))) OR F ((((p19 <= 0)) AND ((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)))))))",
"processed_size": 256,
"rewrites": 74
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 20,
"adisj": 4,
"aneg": 3,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X ((G ((((((p19 <= 0)) AND ((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0))) R (((p7 <= 0) OR (p17 <= 0)) AND ((p6 <= 0) OR (p18 <= 0)) AND ((p8 <= 0) OR (p20 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))) R F ((((p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)))))) AND (((1 <= p19)) OR ((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)))))",
"processed_size": 492,
"rewrites": 74
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 6,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G ((G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))) OR (((p8 <= 0) OR (p14 <= 0)) AND ((p9 <= 0) OR (p13 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)))))",
"processed_size": 313,
"rewrites": 74
},
"result":
{
"edges": 82,
"markings": 56,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 11,
"adisj": 2,
"aneg": 1,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (X (X (G (((((p19 <= 0)) AND ((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0))) OR (((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0))))))))",
"processed_size": 252,
"rewrites": 74
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 35,
"adisj": 7,
"aneg": 0,
"comp": 70,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((X ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))) AND (((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))) OR (G ((F ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9)))) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))))) AND F ((X ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))) AND (((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15))))))) U (((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15))))",
"processed_size": 1113,
"rewrites": 74
},
"result":
{
"edges": 29,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 2,
"aconj": 25,
"adisj": 5,
"aneg": 1,
"comp": 50,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G ((F ((X ((((1 <= p8) AND (1 <= p14)) OR ((1 <= p9) AND (1 <= p13)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) OR G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))))) AND (F ((((p8 <= 0) OR (p14 <= 0)) AND ((p9 <= 0) OR (p13 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)))) OR (X ((((1 <= p8) AND (1 <= p14)) OR ((1 <= p9) AND (1 <= p13)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) OR G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15))))))))",
"processed_size": 813,
"rewrites": 74
},
"result":
{
"edges": 5,
"markings": 5,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X ((F (G (((1 <= p2) AND (1 <= p6)))) OR (((p2 <= 0)) OR ((p6 <= 0))))))",
"processed_size": 75,
"rewrites": 74
},
"result":
{
"edges": 25,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((1 <= p1) AND (1 <= p6))",
"processed_size": 25,
"rewrites": 76
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p23 <= 0)) AND ((p6 <= 0) OR (p18 <= 0)))",
"processed_size": 45,
"rewrites": 76
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p0) AND (1 <= p9)) AND ((p9 <= 0) OR (p13 <= 0)))",
"processed_size": 58,
"rewrites": 79
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (((p4 <= 0) OR (p8 <= 0))) OR G (((1 <= p8) AND (1 <= p14)))))",
"processed_size": 69,
"rewrites": 74
},
"result":
{
"edges": 12,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 12,
"adisj": 17,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 6,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "F (G ((F ((((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))) AND ((((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))) U (((1 <= p19)) OR ((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)))) AND (((p19 <= 0)) AND (((p21 <= 0)) AND (((p22 <= 0)) AND (((p23 <= 0)) AND ((p24 <= 0))))))) OR (((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))))))",
"processed_size": 648,
"rewrites": 74
},
"result":
{
"edges": 5,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 1,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G ((G (F ((((p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p9 <= 0))))) OR (((1 <= p19)) OR (((1 <= p21)) OR (((1 <= p22)) OR (((1 <= p23)) OR ((1 <= p24))))))))",
"processed_size": 249,
"rewrites": 74
},
"result":
{
"edges": 4,
"markings": 4,
"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":
{
"error": null,
"memory": 101732,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((F(**) AND (((** U **) AND (** AND (** AND (** AND (** AND **))))) OR **)))) : X(F((G(*) OR F(*)))) : X((G(((* R *) R F(*))) AND **)) : G((G(F(*)) OR (** OR (** OR (** OR (** OR **)))))) : (X(X(X(G(*)))) OR G((G(**) OR **))) : (((X(**) AND **) OR (G((F(**) AND **)) AND F((X(**) AND **)))) U **) : G((F((X(**) OR G(**))) AND (F(*) OR (X(**) OR G(**))))) : X(X((F(G(**)) OR (* OR *)))) : F(**) : F(**) : F((* OR **)) : F((F(**) OR G(**)))"
},
"net":
{
"arcs": 80,
"conflict_clusters": 6,
"places": 25,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 25
},
"result":
{
"preliminary_value": "no yes no no no no no no no no no no ",
"value": "no yes no no no no no no no 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: 50/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25
lola: finding significant places
lola: 25 places, 25 transitions, 15 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: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: F (G (((((((((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))) U (((1 <= p19)) OR ((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)))) AND ((p19 <= 0))) AND ((p21 <= 0))) AND ((p22 <= 0))) AND ((p23 <= 0))) AND ((p24 <= 0))) U (((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))))) : F (X (((NOT(G (X ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9)))))) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9)))) U (NOT(F ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15))))) OR NOT(G ((((1 <= p19)) OR ((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24))))))))) : (X (G (NOT((((((1 <= p19)) OR ((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24))) U (((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))) U G ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9)))))))) AND X ((((1 <= p19)) OR ((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24))))) : G ((((((NOT(F (G ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9)))))) OR ((1 <= p19))) OR ((1 <= p21))) OR ((1 <= p22))) OR ((1 <= p23))) OR ((1 <= p24)))) : (X (NOT(F (X (X (((((1 <= p19)) OR ((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24))) AND (((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))))))))) OR G ((G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))) OR (((p8 <= 0) OR (p14 <= 0)) AND ((p9 <= 0) OR (p13 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)))))) : ((G ((F ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9)))) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p9))))) U (X ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))) AND (((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15))))) U (((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))) : G ((F (((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15))) U NOT(G ((((1 <= p8) AND (1 <= p14)) OR ((1 <= p9) AND (1 <= p13)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12))))))) U (X ((((1 <= p8) AND (1 <= p14)) OR ((1 <= p9) AND (1 <= p13)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) OR G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15))))))) : NOT(X (X (((NOT(F (G (((1 <= p2) AND (1 <= p6))))) AND ((1 <= p2))) AND ((1 <= p6)))))) : ((0 <= 0) U ((p1 <= 0) OR (p6 <= 0))) : F ((((1 <= p23)) OR ((1 <= p6) AND (1 <= p18)))) : (((G (((1 <= p7) AND (1 <= p12))) OR ((1 <= p0) AND (1 <= p9))) U NOT(G (((1 <= p0) AND (1 <= p9))))) OR F (((1 <= p9) AND (1 <= p13)))) : F ((F (((p4 <= 0) OR (p8 <= 0))) OR G (((1 <= p8) AND (1 <= p14)))))
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: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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((((p7 <= 0) OR (p17 <= 0)) AND ((p6 <= 0) OR (p18 <= 0)) AND ((p8 <= 0) OR (p20 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))) OR F ((((p19 <= 0)) AND ((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((((p7 <= 0) OR (p17 <= 0)) AND ((p6 <= 0) OR (p18 <= 0)) AND ((p8 <= 0) OR (p20 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))) OR F ((((p19 <= 0)) AND ((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)))))))
lola: processed formula length: 256
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((((p19 <= 0)) AND ((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0))) R (((p7 <= 0) OR (p17 <= 0)) AND ((p6 <= 0) OR (p18 <= 0)) AND ((p8 <= 0) OR (p20 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))) R F ((((p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((((p19 <= 0)) AND ((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0))) R (((p7 <= 0) OR (p17 <= 0)) AND ((p6 <= 0) OR (p18 <= 0)) AND ((p8 <= 0) OR (p20 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))) R F ((((p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)))... (shortened)
lola: processed formula length: 492
lola: 74 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (G (((((p19 <= 0)) AND ((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0))) OR (((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))))))) OR G ((G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))) OR (((p8 <= 0) OR (p14 <= 0)) AND ((p9 <= 0) OR (p13 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7)))) OR (((p8 <= 0) OR (p14 <= 0)) AND ((p9 <= 0) OR (p13 <= 0)) AND ((p5 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)))))
lola: processed formula length: 313
lola: 74 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: 56 markings, 82 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G (((((p19 <= 0)) AND ((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0))) OR (((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G (((((p19 <= 0)) AND ((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0))) OR (((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0))))))))
lola: processed formula length: 252
lola: 74 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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((X ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))) AND (((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))) OR (G ((F ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((X ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))) AND (((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))) OR (G ((F ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p3)... (shortened)
lola: processed formula length: 1113
lola: 74 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: 22 markings, 29 edges
lola: ========================================
lola: subprocess 4 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((X ((((1 <= p8) AND (1 <= p14)) OR ((1 <= p9) AND (1 <= p13)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) OR G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))))) AND (F ((((p8 <= 0) OR (p14 <= 0)) AND ((p9 <= 0) OR (p13 <= 0)) AND ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((X ((((1 <= p8) AND (1 <= p14)) OR ((1 <= p9) AND (1 <= p13)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p12)))) OR G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p8) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p15)))))) AND (F ((((p8 <= 0) OR (p14 <= 0)) AND ((p9 <= 0) OR (p13 <= 0)) AND ((... (shortened)
lola: processed formula length: 813
lola: 74 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (G (((1 <= p2) AND (1 <= p6)))) OR (((p2 <= 0)) OR ((p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (G (((1 <= p2) AND (1 <= p6)))) OR (((p2 <= 0)) OR ((p6 <= 0))))))
lola: processed formula length: 75
lola: 74 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: 19 markings, 25 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p1 <= 0) OR (p6 <= 0)))
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: ((1 <= p1) AND (1 <= p6))
lola: processed formula length: 25
lola: 76 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p23)) OR ((1 <= p6) AND (1 <= p18))))
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: (((p23 <= 0)) AND ((p6 <= 0) OR (p18 <= 0)))
lola: processed formula length: 45
lola: 76 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p0 <= 0) OR (p9 <= 0)) OR ((1 <= p9) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((1 <= p0) AND (1 <= p9)) AND ((p9 <= 0) OR (p13 <= 0)))
lola: processed formula length: 58
lola: 79 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((p4 <= 0) OR (p8 <= 0))) OR G (((1 <= p8) AND (1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((p4 <= 0) OR (p8 <= 0))) OR G (((1 <= p8) AND (1 <= p14)))))
lola: processed formula length: 69
lola: 74 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: 8 markings, 12 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))) AND ((((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))) U (((1 <= p19)) OR ((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)))) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((p0 <= 0) OR (p5 <= 0)) AND ((p4 <= 0) OR (p9 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))) AND ((((((1 <= p0) AND (1 <= p5)) OR ((1 <= p4) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7))) U (((1 <= p19)) OR ((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)))) ... (shortened)
lola: processed formula length: 648
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 5 edges
lola: ========================================
lola: subprocess 11 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F ((((p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p9 <= 0))))) OR (((1 <= p19)) OR (((1 <= p21)) OR (((1 <= p22)) OR (((1 <= p23)) OR ((1 <= p24))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F ((((p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p3 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p9 <= 0))))) OR (((1 <= p19)) OR (((1 <= p21)) OR (((1 <= p22)) OR (((1 <= p23)) OR ((1 <= p24))))))))
lola: processed formula length: 249
lola: 74 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: 4 markings, 4 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no no no
lola:
preliminary result: no yes no no no no no no no no no no
lola: memory consumption: 101732 KB
lola: time consumption: 3 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="Philosophers-PT-000005"
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 Philosophers-PT-000005, 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 r151-tall-162089151600418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 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 ;