About the Execution of 2020-gold for UtilityControlRoom-COL-Z4T4N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4328.491 | 3600000.00 | 9569.00 | 292.60 | TFTTFFFFTFTTTTFF | 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.r322-tall-162132128100258.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 UtilityControlRoom-COL-Z4T4N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128100258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 20K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.0K May 12 04:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 12 04:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 11 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_pt
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 5 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 29K May 12 08:13 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 UtilityControlRoom-COL-Z4T4N10-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-15
=== Now, execution of the tool begins
BK_START 1621451375010
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 19:09:36] [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-19 19:09:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:09:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-19 19:09:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 537 ms
[2021-05-19 19:09:37] [INFO ] sort/places :
Cli->Clients,ControlRoomDispatch,Finished,ClientsWaiting,ClientsTimeout,
CxZ->OpenRequests,Assigned,StartSecuring,DoSecuring,
Dot->Idles,NumClientsReq,
Z->IdleTechs,
CxZxZ->MovetoZ,
[2021-05-19 19:09:37] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignNearZone
[2021-05-19 19:09:37] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition move_between_Municipalities
[2021-05-19 19:09:37] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignFar
[2021-05-19 19:09:37] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 239 PT places and 432.0 transition bindings in 21 ms.
[2021-05-19 19:09:37] [INFO ] Computed order based on color domains.
[2021-05-19 19:09:37] [INFO ] Unfolded HLPN to a Petri net with 239 places and 432 transitions in 22 ms.
[2021-05-19 19:09:37] [INFO ] Unfolded HLPN properties in 1 ms.
[2021-05-19 19:09:37] [INFO ] Reduced 18 identical enabling conditions.
Deduced a syphon composed of 208 places in 2 ms
Reduce places removed 208 places and 384 transitions.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 70 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 330 ms. (steps per millisecond=303 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 39 rows 31 cols
[2021-05-19 19:09:37] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-19 19:09:37] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-19 19:09:37] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-19 19:09:37] [INFO ] Flatten gal took : 28 ms
FORMULA UtilityControlRoom-COL-Z4T4N10-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N10-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N10-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:09:37] [INFO ] Applying decomposition
[2021-05-19 19:09:37] [INFO ] Flatten gal took : 10 ms
[2021-05-19 19:09:37] [INFO ] Decomposing Gal with order
[2021-05-19 19:09:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:09:37] [INFO ] Removed a total of 45 redundant transitions.
[2021-05-19 19:09:37] [INFO ] Flatten gal took : 32 ms
[2021-05-19 19:09:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2021-05-19 19:09:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-19 19:09:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ UtilityControlRoom-COL-Z4T4N10 @ 3570 seconds
FORMULA UtilityControlRoom-COL-Z4T4N10-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N10-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ UtilityControlRoom-COL-Z4T4N10
{
"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": "Wed May 19 19:09:38 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 10,
"aneg": 1,
"comp": 37,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 37,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X ((G (((p10 <= 0) AND (p12 <= 0) AND (p14 <= 0) AND (p16 <= 0) AND (p18 <= 0) AND (p11 <= 0) AND (p13 <= 0) AND (p15 <= 0) AND (p17 <= 0) AND (p25 <= 0))) OR ((p10 <= 0) AND (p12 <= 0) AND (p14 <= 0) AND (p16 <= 0) AND (p18 <= 0) AND (p11 <= 0) AND (p13 <= 0) AND (p15 <= 0) AND (p17 <= 0) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)))))",
"processed_size": 563,
"rewrites": 96
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))",
"processed_size": 93,
"rewrites": 98
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 9,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "(X (X (G ((1 <= p25)))) U (F ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) OR ((1 <= p10) OR ((1 <= p12) OR ((1 <= p14) OR ((1 <= p16) OR ((1 <= p18) OR ((1 <= p11) OR ((1 <= p13) OR ((1 <= p15) OR (1 <= p17)))))))))))",
"processed_size": 268,
"rewrites": 96
},
"result":
{
"edges": 66,
"markings": 44,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((X (((p7 <= 0) AND (p9 <= 0) AND (p8 <= 0))) OR G (F ((1 <= p22)))))))",
"processed_size": 79,
"rewrites": 96
},
"result":
{
"edges": 31,
"markings": 26,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 18,
"aneg": 0,
"comp": 37,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 37,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F (G ((G ((((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)))) OR (X ((1 <= p26)) OR (((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)))))))",
"processed_size": 572,
"rewrites": 96
},
"result":
{
"edges": 16,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 396
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((1 <= p26))",
"processed_size": 14,
"rewrites": 96
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((X ((1 <= p26)) OR (p26 <= 0)))",
"processed_size": 34,
"rewrites": 96
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((((p20 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))))",
"processed_size": 101,
"rewrites": 96
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((((1 <= p7) OR (1 <= p9) OR (1 <= p8)) AND (p25 <= 0)))))",
"processed_size": 68,
"rewrites": 96
},
"result":
{
"edges": 28,
"markings": 21,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"child":
[
{
"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": 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": "((1 <= p7) OR (1 <= p9) OR (1 <= p8))",
"processed_size": 37,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "G (((p7 <= 0) AND (p9 <= 0) AND (p8 <= 0)))",
"processed_size": 43,
"rewrites": 96
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p25)))",
"processed_size": 18,
"rewrites": 96
},
"result":
{
"edges": 168,
"markings": 85,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"aneg": 1,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p3) OR (((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0))))))",
"processed_size": 290,
"rewrites": 96
},
"result":
{
"edges": 16,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((G ((p26 <= 0)) OR (p3 <= 0)))",
"processed_size": 33,
"rewrites": 96
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 4,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p10) OR (1 <= p12) OR (1 <= p14) OR (1 <= p16) OR (1 <= p18) OR (1 <= p11) OR (1 <= p13) OR (1 <= p15) OR (1 <= p17))) AND (((p20 <= 0) OR (p27 <= 0)) AND (((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0))))))",
"processed_size": 242,
"rewrites": 96
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 2,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p10) OR (1 <= p12) OR (1 <= p14) OR (1 <= p16) OR (1 <= p18) OR (1 <= p11) OR (1 <= p13) OR (1 <= p15) OR (1 <= p17))) OR (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6))))))",
"processed_size": 417,
"rewrites": 96
},
"result":
{
"edges": 362,
"markings": 160,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 67960,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(*) OR **)) : ((X(X(G(**))) U (F(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))) AND (F(*) OR **)) : G(F(**)) : X(X(F((X(*) OR G(F(**)))))) : F(G((G(**) OR (X(**) OR **)))) : (G((X(*) OR **)) AND X(**)) : F((F(**) AND (** AND (** AND **)))) : F((G(*) OR *)) : F(G((** OR *))) : X(F(*)) : X(X(F((** AND *)))) : G(F((G(**) OR **))) : (X(X(F(**))) AND (G(*) OR (** OR (** OR **))))"
},
"net":
{
"arcs": 117,
"conflict_clusters": 18,
"places": 31,
"places_significant": 26,
"singleton_clusters": 0,
"transitions": 39
},
"result":
{
"preliminary_value": "yes no yes yes no no no yes no yes yes yes no ",
"value": "yes no yes yes no no no yes no yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 992
lola: finding significant places
lola: 31 places, 39 transitions, 26 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: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: X ((NOT(((1 <= p25) U F (((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6))) U F (((1 <= p10) OR (1 <= p12) OR (1 <= p14) OR (1 <= p16) OR (1 <= p18) OR (1 <= p11) OR (1 <= p13) OR (1 <= p15) OR (1 <= p17) OR (1 <= p25))))))) OR ((p10 <= 0) AND (p12 <= 0) AND (p14 <= 0) AND (p16 <= 0) AND (p18 <= 0) AND (p11 <= 0) AND (p13 <= 0) AND (p15 <= 0) AND (p17 <= 0) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0))))) : ((X (X (G ((1 <= p25)))) U (((((((((F ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) OR (1 <= p10)) OR (1 <= p12)) OR (1 <= p14)) OR (1 <= p16)) OR (1 <= p18)) OR (1 <= p11)) OR (1 <= p13)) OR (1 <= p15)) OR (1 <= p17))) AND (NOT(G ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))) OR ((p10 <= 0) AND (p12 <= 0) AND (p14 <= 0) AND (p16 <= 0) AND (p18 <= 0) AND (p11 <= 0) AND (p13 <= 0) AND (p15 <= 0) AND (p17 <= 0)))) : X (G (F (X ((X (G ((1 <= p25))) U X (G (F ((1 <= p25))))))))) : X (X (F ((NOT(X (((1 <= p7) OR (1 <= p9) OR (1 <= p8)))) OR G (NOT(G (NOT(F ((1 <= p22)))))))))) : G (F (G (((G ((((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)))) OR X ((1 <= p26))) OR (((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0))))))) : (G ((NOT(X ((p26 <= 0))) OR (p26 <= 0))) AND X ((1 <= p26))) : F ((((F (((1 <= p10) OR (1 <= p12) OR (1 <= p14) OR (1 <= p16) OR (1 <= p18) OR (1 <= p11) OR (1 <= p13) OR (1 <= p15) OR (1 <= p17))) AND ((p20 <= 0) OR (p27 <= 0))) AND ((p21 <= 0) OR (p27 <= 0))) AND ((p19 <= 0) OR (p27 <= 0)))) : NOT(G ((F ((1 <= p26)) AND (1 <= p3)))) : F (G (X ((X ((1 <= p3)) OR NOT(X ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6))))))))) : F (NOT(G (X ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))))) : F (X ((X (((1 <= p7) OR (1 <= p9) OR (1 <= p8))) AND NOT(X ((1 <= p25)))))) : G ((F (G (((1 <= p10) OR (1 <= p12) OR (1 <= p14) OR (1 <= p16) OR (1 <= p18) OR (1 <= p11) OR (1 <= p13) OR (1 <= p15) OR (1 <= p17)))) OR F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)))))) : (X (F (X ((1 <= p3)))) AND (((NOT(F ((F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p6)))) U ((1 <= p7) OR (1 <= p9) OR (1 <= p8))))) OR (1 <= p7)) OR (1 <= p9)) OR (1 <= p8)))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: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: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: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p10 <= 0) AND (p12 <= 0) AND (p14 <= 0) AND (p16 <= 0) AND (p18 <= 0) AND (p11 <= 0) AND (p13 <= 0) AND (p15 <= 0) AND (p17 <= 0) AND (p25 <= 0))) OR ((p10 <= 0) AND (p12 <= 0) AND (p14 <= 0) AND (p16 <= 0) AND (p18 <= 0) AND (p11 <= 0) AND (p13 <= 0) AND (p15 <= 0) AND (p17 <= 0) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p10 <= 0) AND (p12 <= 0) AND (p14 <= 0) AND (p16 <= 0) AND (p18 <= 0) AND (p11 <= 0) AND (p13 <= 0) AND (p15 <= 0) AND (p17 <= 0) AND (p25 <= 0))) OR ((p10 <= 0) AND (p12 <= 0) AND (p14 <= 0) AND (p16 <= 0) AND (p18 <= 0) AND (p11 <= 0) AND (p13 <= 0) AND (p15 <= 0) AND (p17 <= 0) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR ... (shortened)
lola: processed formula length: 563
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (X (G ((1 <= p25)))) U (F ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) OR ((1 <= p10) OR ((1 <= p12) OR ((1 <= p14) OR ((1 <= p16) OR ((1 <= p18) OR ((1 <= p11) OR ((1 <= p13) OR ((1 <= p15) OR (1 <= p17))))))))))) AND (F ((((p20 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))) OR ((p10 <= 0) AND (p12 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p20 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 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 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))
lola: processed formula length: 93
lola: 98 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 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((1 <= p25)))) U (F ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) OR ((1 <= p10) OR ((1 <= p12) OR ((1 <= p14) OR ((1 <= p16) OR ((1 <= p18) OR ((1 <= p11) OR ((1 <= p13) OR ((1 <= p15) OR (1 <= p17)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (G ((1 <= p25)))) U (F ((((1 <= p20) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) OR ((1 <= p10) OR ((1 <= p12) OR ((1 <= p14) OR ((1 <= p16) OR ((1 <= p18) OR ((1 <= p11) OR ((1 <= p13) OR ((1 <= p15) OR (1 <= p17)))))))))))
lola: processed formula length: 268
lola: 96 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: 44 markings, 66 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (((p7 <= 0) AND (p9 <= 0) AND (p8 <= 0))) OR G (F ((1 <= p22)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (((p7 <= 0) AND (p9 <= 0) AND (p8 <= 0))) OR G (F ((1 <= p22)))))))
lola: processed formula length: 79
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 26 markings, 31 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)))) OR (X ((1 <= p26)) OR (((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)))) OR (X ((1 <= p26)) OR (((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= ... (shortened)
lola: processed formula length: 572
lola: 96 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: 15 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((X ((1 <= p26)) OR (p26 <= 0))) AND X ((1 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p26))
lola: processed formula length: 14
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((1 <= p26)) OR (p26 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((1 <= p26)) OR (p26 <= 0)))
lola: processed formula length: 34
lola: 96 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: 14 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p20 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p20 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))))
lola: processed formula length: 101
lola: 96 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p7) OR (1 <= p9) OR (1 <= p8)) AND (p25 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p7) OR (1 <= p9) OR (1 <= p8)) AND (p25 <= 0)))))
lola: processed formula length: 68
lola: 96 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: 21 markings, 28 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((1 <= p3)))) AND (G (((p7 <= 0) AND (p9 <= 0) AND (p8 <= 0))) OR ((1 <= p7) OR ((1 <= p9) OR (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p7) OR ((1 <= p9) OR (1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((1 <= p7) OR (1 <= p9) OR (1 <= p8))
lola: processed formula length: 37
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p7 <= 0) AND (p9 <= 0) AND (p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p7 <= 0) AND (p9 <= 0) AND (p8 <= 0)))
lola: processed formula length: 43
lola: 96 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: 14 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p25)))
lola: processed formula length: 18
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 85 markings, 168 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p3) OR (((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p3) OR (((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p6 <= 0))))))
lola: processed formula length: 290
lola: 96 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: 15 markings, 16 edges
lola: ========================================
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p26 <= 0)) OR (p3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p26 <= 0)) OR (p3 <= 0)))
lola: processed formula length: 33
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p10) OR (1 <= p12) OR (1 <= p14) OR (1 <= p16) OR (1 <= p18) OR (1 <= p11) OR (1 <= p13) OR (1 <= p15) OR (1 <= p17))) AND (((p20 <= 0) OR (p27 <= 0)) AND (((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p10) OR (1 <= p12) OR (1 <= p14) OR (1 <= p16) OR (1 <= p18) OR (1 <= p11) OR (1 <= p13) OR (1 <= p15) OR (1 <= p17))) AND (((p20 <= 0) OR (p27 <= 0)) AND (((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0))))))
lola: processed formula length: 242
lola: 96 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: 18 markings, 18 edges
lola: ========================================
lola: subprocess 12 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p10) OR (1 <= p12) OR (1 <= p14) OR (1 <= p16) OR (1 <= p18) OR (1 <= p11) OR (1 <= p13) OR (1 <= p15) OR (1 <= p17))) OR (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p10) OR (1 <= p12) OR (1 <= p14) OR (1 <= p16) OR (1 <= p18) OR (1 <= p11) OR (1 <= p13) OR (1 <= p15) OR (1 <= p17))) OR (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) A... (shortened)
lola: processed formula length: 417
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 160 markings, 362 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no yes no yes yes yes no
lola:
preliminary result: yes no yes yes no no no yes no yes yes yes no
lola: memory consumption: 67960 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="UtilityControlRoom-COL-Z4T4N10"
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 UtilityControlRoom-COL-Z4T4N10, 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 r322-tall-162132128100258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N10.tgz
mv UtilityControlRoom-COL-Z4T4N10 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 ;