About the Execution of 2020-gold for CloudOpsManagement-PT-02560by01280
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16255.323 | 3600000.00 | 905237.00 | 23399.50 | FF?F?FFFFFFFFF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2021-input.r056-oct2-162038334800222.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CloudOpsManagement-PT-02560by01280, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334800222
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K 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 CloudOpsManagement-PT-02560by01280-00
FORMULA_NAME CloudOpsManagement-PT-02560by01280-01
FORMULA_NAME CloudOpsManagement-PT-02560by01280-02
FORMULA_NAME CloudOpsManagement-PT-02560by01280-03
FORMULA_NAME CloudOpsManagement-PT-02560by01280-04
FORMULA_NAME CloudOpsManagement-PT-02560by01280-05
FORMULA_NAME CloudOpsManagement-PT-02560by01280-06
FORMULA_NAME CloudOpsManagement-PT-02560by01280-07
FORMULA_NAME CloudOpsManagement-PT-02560by01280-08
FORMULA_NAME CloudOpsManagement-PT-02560by01280-09
FORMULA_NAME CloudOpsManagement-PT-02560by01280-10
FORMULA_NAME CloudOpsManagement-PT-02560by01280-11
FORMULA_NAME CloudOpsManagement-PT-02560by01280-12
FORMULA_NAME CloudOpsManagement-PT-02560by01280-13
FORMULA_NAME CloudOpsManagement-PT-02560by01280-14
FORMULA_NAME CloudOpsManagement-PT-02560by01280-15
=== Now, execution of the tool begins
BK_START 1620903192626
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:53:15] [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-13 10:53:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:53:15] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-13 10:53:15] [INFO ] Transformed 27 places.
[2021-05-13 10:53:15] [INFO ] Transformed 29 transitions.
[2021-05-13 10:53:15] [INFO ] Parsed PT model containing 27 places and 29 transitions in 49 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 101186 steps, including 0 resets, run finished after 102 ms. (steps per millisecond=992 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:53:15] [INFO ] Computed 11 place invariants in 16 ms
[2021-05-13 10:53:16] [INFO ] [Real]Absence check using 11 positive place invariants in 91 ms returned sat
[2021-05-13 10:53:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:53:16] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-13 10:53:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:53:16] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-13 10:53:16] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:53:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:53:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-13 10:53:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:53:16] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 10:53:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:53:16] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 13 ms.
[2021-05-13 10:53:16] [INFO ] Added : 25 causal constraints over 5 iterations in 60 ms. Result :sat
[2021-05-13 10:53:16] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 10:53:16] [INFO ] Flatten gal took : 22 ms
FORMULA CloudOpsManagement-PT-02560by01280-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-02560by01280-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:53:16] [INFO ] Flatten gal took : 6 ms
[2021-05-13 10:53:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-13 10:53:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudOpsManagement-PT-02560by01280 @ 3570 seconds
FORMULA CloudOpsManagement-PT-02560by01280-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-02560by01280-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2802
rslt: Output for LTLFireability @ CloudOpsManagement-PT-02560by01280
{
"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": "Thu May 13 10:53:17 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F ((X (((p8 <= 0) OR (p9 <= 0))) AND G (((1 <= p8) AND (1 <= p9))))) AND (G (((p8 <= 0) OR (p9 <= 0))) OR ((1 <= p8) AND (1 <= p9)))))",
"processed_size": 140,
"rewrites": 58
},
"result":
{
"edges": 1285,
"markings": 1285,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 287
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F ((F ((1 <= p24)) OR (1 <= p11))) U (X (F ((p24 <= 0))) U G ((F ((1 <= p22)) AND ((1 <= p24) OR (1 <= p22))))))",
"processed_size": 113,
"rewrites": 58
},
"result":
{
"edges": 30725,
"markings": 30724,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 332
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 332
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p8 <= 0) OR (p9 <= 0))",
"processed_size": 25,
"rewrites": 60
},
"result":
{
"edges": 2562,
"markings": 2562,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p11 <= 0) OR (p12 <= 0) OR (p25 <= 0))",
"processed_size": 42,
"rewrites": 60
},
"result":
{
"edges": 7685,
"markings": 7685,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 415
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((p18 <= 0)) AND F (((1 <= p21)))))",
"processed_size": 41,
"rewrites": 58
},
"result":
{
"edges": 7685,
"markings": 7685,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 474
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p18)))",
"processed_size": 18,
"rewrites": 58
},
"result":
{
"edges": 1285,
"markings": 1285,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 415
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((1 <= p7)) OR (G ((p18 <= 0)) OR (G ((1 <= p15)) OR X ((1 <= p7))))))",
"processed_size": 76,
"rewrites": 58
},
"result":
{
"edges": 1286,
"markings": 1286,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 533
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 533
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p21))",
"processed_size": 12,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 640
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p21 <= 0))",
"processed_size": 12,
"rewrites": 60
},
"result":
{
"edges": 7685,
"markings": 7685,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 640
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p24 <= 0))",
"processed_size": 14,
"rewrites": 58
},
"result":
{
"edges": 24436,
"markings": 21819,
"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": 800
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p0) AND (1 <= p26)))",
"processed_size": 30,
"rewrites": 58
},
"result":
{
"edges": 335225,
"markings": 163779,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1066
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1066
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p11)",
"processed_size": 10,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1600
},
"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 <= p2)))",
"processed_size": 17,
"rewrites": 58
},
"result":
{
"edges": 5121,
"markings": 5121,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1600
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1600
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p11))",
"processed_size": 14,
"rewrites": 58
},
"result":
{
"edges": 7685,
"markings": 7685,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3200
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((((1 <= p13) AND (1 <= p17) AND (1 <= p21)) OR (G ((p11 <= 0)) AND F (((1 <= p13) AND (1 <= p17) AND (1 <= p21))))))",
"processed_size": 119,
"rewrites": 58
},
"result":
{
"edges": 1288,
"markings": 1286,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"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": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3199
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3199
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((p20 <= 0) OR (p8 <= 0) OR (p9 <= 0))))",
"processed_size": 48,
"rewrites": 58
},
"result":
{
"edges": 1296,
"markings": 1290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((p20 <= 0) OR (p8 <= 0) OR (p9 <= 0))))",
"processed_size": 48,
"rewrites": 58
},
"result":
{
"edges": 1296,
"markings": 1290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (((1 <= p20) AND (F ((1 <= p20)) OR ((1 <= p8) AND (1 <= p9)))))",
"processed_size": 66,
"rewrites": 58
},
"result":
{
"edges": 1285,
"markings": 1285,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3368,
"runtime": 767.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((F((X(*) AND G(**))) AND (G(*) OR **))) : X(G((G(**) OR **))) : (F((F(**) OR **)) U (X(F(*)) U G((F(**) AND (** OR **))))) : F(G(((* R *) AND X((G(*) OR *))))) : (X((F(**) AND *)) AND F(**)) : (F((** AND (F(**) OR **))) OR (F((** AND (F(**) OR **))) AND F(G(**)))) : (G(F(**)) OR **) : (X(G(**)) OR (F(**) OR (G((F(*) AND F(**))) AND F((X(G(**)) OR F(**)))))) : G((F(**) OR (G(**) OR (G(**) OR X(**))))) : G(**) : G(**) : (F((** OR (G(**) AND F(**)))) OR G(**)) : X(F((** OR ((G(F(**)) AND F(**)) OR (X(**) OR G(**)))))) : (** OR (F(**) AND F(G((F((F(**) AND **)) AND (X(**) OR (F(**) AND **)))))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no unknown no unknown no no no no no no no no unknown no ",
"value": "no unknown no unknown no no no no no no no no unknown 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: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 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: F ((NOT(G ((X (((1 <= p8) AND (1 <= p9))) OR NOT(G (((1 <= p8) AND (1 <= p9))))))) AND (NOT(F (((1 <= p8) AND (1 <= p9)))) OR ((1 <= p8) AND (1 <= p9))))) : G (X ((G (((1 <= p8) AND (1 <= p9))) OR (1 <= p15)))) : (F ((F ((1 <= p24)) OR (1 <= p11))) U (NOT(G (X ((1 <= p24)))) U G (((1 <= p24) U (1 <= p22))))) : F (NOT(F ((((1 <= p24) U ((1 <= p3) AND (1 <= p4))) OR X ((F (((1 <= p8) AND (1 <= p25))) AND ((p8 <= 0) OR (p25 <= 0)))))))) : ((X (F (((1 <= p11) AND (1 <= p12) AND (1 <= p25)))) AND NOT(X (((1 <= p8) AND (1 <= p9))))) AND F (((1 <= p8) AND (1 <= p9)))) : (F (G (((p20 <= 0) OR (p8 <= 0) OR (p9 <= 0)))) U F (((1 <= p20) AND (F ((1 <= p20)) OR ((1 <= p8) AND (1 <= p9)))))) : (X (X (G (F ((F (NOT(G ((1 <= p2)))) U (1 <= p2)))))) OR (1 <= p11)) : (G ((NOT(G ((1 <= p18))) AND F (((1 <= p21))))) U (G (X ((1 <= p18))) OR F (((1 <= p11) AND (1 <= p12) AND (1 <= p25))))) : G ((((((1 <= p18) U F ((1 <= p7))) OR G ((p18 <= 0))) OR G ((1 <= p15))) OR X ((1 <= p7)))) : G ((p24 <= 0)) : G (((1 <= p0) AND (1 <= p26))) : (F ((G ((p11 <= 0)) U ((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) OR G ((1 <= p11))) : X ((F ((G (F (X (((1 <= p8) AND (1 <= p25))))) U ((1 <= p3) AND (1 <= p4)))) OR F ((X (((1 <= p1) AND (1 <= p2))) OR G (((1 <= p8) AND (1 <= p25))))))) : ((F (((p21 <= 0))) U F (G ((X ((1 <= p24)) U (F ((1 <= p15)) AND (1 <= p22)))))) U ((1 <= p21)))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:335
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((X (((p8 <= 0) OR (p9 <= 0))) AND G (((1 <= p8) AND (1 <= p9))))) AND (G (((p8 <= 0) OR (p9 <= 0))) OR ((1 <= p8) AND (1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((X (((p8 <= 0) OR (p9 <= 0))) AND G (((1 <= p8) AND (1 <= p9))))) AND (G (((p8 <= 0) OR (p9 <= 0))) OR ((1 <= p8) AND (1 <= p9)))))
lola: processed formula length: 140
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 1285 markings, 1285 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((1 <= p8) AND (1 <= p9))) OR (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((1 <= p8) AND (1 <= p9))) OR (1 <= p15))))
lola: processed formula length: 53
lola: 58 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: 5130799 markings, 7734815 edges, 1026160 markings/sec, 0 secs
lola: 10039067 markings, 15119273 edges, 981654 markings/sec, 5 secs
lola: 14902265 markings, 22432523 edges, 972640 markings/sec, 10 secs
lola: 19688346 markings, 29627872 edges, 957216 markings/sec, 15 secs
lola: 24427722 markings, 36751658 edges, 947875 markings/sec, 20 secs
lola: 29152599 markings, 43852863 edges, 944975 markings/sec, 25 secs
lola: 33757346 markings, 50772717 edges, 920949 markings/sec, 30 secs
lola: 38384492 markings, 57725700 edges, 925429 markings/sec, 35 secs
lola: 43063448 markings, 64756184 edges, 935791 markings/sec, 40 secs
lola: 47733764 markings, 71772942 edges, 934063 markings/sec, 45 secs
lola: 52388819 markings, 78766771 edges, 931011 markings/sec, 50 secs
lola: 56986044 markings, 85673299 edges, 919445 markings/sec, 55 secs
lola: 61459512 markings, 92393453 edges, 894694 markings/sec, 60 secs
lola: 66054122 markings, 99295282 edges, 918922 markings/sec, 65 secs
lola: 70595443 markings, 106116899 edges, 908264 markings/sec, 70 secs
lola: 72299339 markings, 108677322 edges, 340779 markings/sec, 75 secs
lola: 74848956 markings, 112541119 edges, 509923 markings/sec, 80 secs
lola: 78066689 markings, 117339710 edges, 643547 markings/sec, 85 secs
lola: 81561602 markings, 122589973 edges, 698983 markings/sec, 90 secs
lola: 83490083 markings, 125485510 edges, 385696 markings/sec, 95 secs
lola: 85889715 markings, 129089565 edges, 479926 markings/sec, 100 secs
lola: 89398173 markings, 134359417 edges, 701692 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F ((1 <= p24)) OR (1 <= p11))) U (X (F ((p24 <= 0))) U G ((F ((1 <= p22)) AND ((1 <= p24) OR (1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((F ((1 <= p24)) OR (1 <= p11))) U (X (F ((p24 <= 0))) U G ((F ((1 <= p22)) AND ((1 <= p24) OR (1 <= p22))))))
lola: processed formula length: 113
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 30724 markings, 30725 edges
lola: ========================================
lola: subprocess 3 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p24 <= 0) R ((p3 <= 0) OR (p4 <= 0))) AND X ((G (((p8 <= 0) OR (p25 <= 0))) OR ((1 <= p8) AND (1 <= p25)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p24 <= 0) R ((p3 <= 0) OR (p4 <= 0))) AND X ((G (((p8 <= 0) OR (p25 <= 0))) OR ((1 <= p8) AND (1 <= p25)))))))
lola: processed formula length: 121
lola: 58 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: 4459561 markings, 6733254 edges, 891912 markings/sec, 0 secs
lola: 8751327 markings, 13196314 edges, 858353 markings/sec, 5 secs
lola: 12975030 markings, 19553122 edges, 844741 markings/sec, 10 secs
lola: 17135304 markings, 25812104 edges, 832055 markings/sec, 15 secs
lola: 21251384 markings, 32003198 edges, 823216 markings/sec, 20 secs
lola: 25411584 markings, 38259537 edges, 832040 markings/sec, 25 secs
lola: 29595224 markings, 44550058 edges, 836728 markings/sec, 30 secs
lola: 33698922 markings, 50720265 edges, 820740 markings/sec, 35 secs
lola: 37795215 markings, 56878385 edges, 819259 markings/sec, 40 secs
lola: 41865162 markings, 62996600 edges, 813989 markings/sec, 45 secs
lola: 45927640 markings, 69102757 edges, 812496 markings/sec, 50 secs
lola: 50047760 markings, 75295325 edges, 824024 markings/sec, 55 secs
lola: 54123399 markings, 81421105 edges, 815128 markings/sec, 60 secs
lola: 58109753 markings, 87411934 edges, 797271 markings/sec, 65 secs
lola: 62207033 markings, 93569202 edges, 819456 markings/sec, 70 secs
lola: 66226357 markings, 99609775 edges, 803865 markings/sec, 75 secs
lola: 70225357 markings, 105618894 edges, 799800 markings/sec, 80 secs
lola: 74150922 markings, 111517553 edges, 785113 markings/sec, 85 secs
lola: 78108582 markings, 117464336 edges, 791532 markings/sec, 90 secs
lola: 81384024 markings, 122386211 edges, 655088 markings/sec, 95 secs
lola: 84762623 markings, 127462186 edges, 675720 markings/sec, 100 secs
lola: 88157372 markings, 132563066 edges, 678950 markings/sec, 105 secs
lola: 91479207 markings, 137553905 edges, 664367 markings/sec, 110 secs
lola: 94701851 markings, 142395444 edges, 644529 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F (((1 <= p11) AND (1 <= p12) AND (1 <= p25))) AND ((p8 <= 0) OR (p9 <= 0)))) AND F (((1 <= p8) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p8) AND (1 <= p9)))
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: ((p8 <= 0) OR (p9 <= 0))
lola: processed formula length: 25
lola: 60 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: 2562 markings, 2562 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p18))) OR (F (((1 <= p11) AND (1 <= p12) AND (1 <= p25))) OR (G ((F ((p18 <= 0)) AND F (((1 <= p21))))) AND F ((X (G ((1 <= p18))) OR F (((1 <= p11) AND (1 <= p12) AND (1 <= p25))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p11) AND (1 <= p12) AND (1 <= p25)))
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: ((p11 <= 0) OR (p12 <= 0) OR (p25 <= 0))
lola: processed formula length: 42
lola: 60 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: 7685 markings, 7685 edges
lola: ========================================
lola: subprocess 6 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p18 <= 0)) AND F (((1 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p18 <= 0)) AND F (((1 <= p21)))))
lola: processed formula length: 41
lola: 58 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: 7685 markings, 7685 edges
lola: ========================================
lola: subprocess 7 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p18)))
lola: processed formula length: 18
lola: 58 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: 1285 markings, 1285 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p7)) OR (G ((p18 <= 0)) OR (G ((1 <= p15)) OR X ((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p7)) OR (G ((p18 <= 0)) OR (G ((1 <= p15)) OR X ((1 <= p7))))))
lola: processed formula length: 76
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1286 markings, 1286 edges
lola: ========================================
lola: subprocess 7 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p3) AND (1 <= p4)) OR ((G (F (((1 <= p8) AND (1 <= p25)))) AND F (((1 <= p3) AND (1 <= p4)))) OR (X (((1 <= p1) AND (1 <= p2))) OR G (((1 <= p8) AND (1 <= p25))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p3) AND (1 <= p4)) OR ((G (F (((1 <= p8) AND (1 <= p25)))) AND F (((1 <= p3) AND (1 <= p4)))) OR (X (((1 <= p1) AND (1 <= p2))) OR G (((1 <= p8) AND (1 <= p25))))))))
lola: processed formula length: 180
lola: 58 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: 4547393 markings, 6856674 edges, 909479 markings/sec, 0 secs
lola: 8989187 markings, 13540050 edges, 888359 markings/sec, 5 secs
lola: 13405002 markings, 20181116 edges, 883163 markings/sec, 10 secs
lola: 17913080 markings, 26959145 edges, 901616 markings/sec, 15 secs
lola: 22279220 markings, 33522300 edges, 873228 markings/sec, 20 secs
lola: 26637519 markings, 40072910 edges, 871660 markings/sec, 25 secs
lola: 30908560 markings, 46491810 edges, 854208 markings/sec, 30 secs
lola: 35123011 markings, 52824890 edges, 842890 markings/sec, 35 secs
lola: 39303257 markings, 59106270 edges, 836049 markings/sec, 40 secs
lola: 43570410 markings, 65517754 edges, 853431 markings/sec, 45 secs
lola: 47765942 markings, 71821380 edges, 839106 markings/sec, 50 secs
lola: 52006537 markings, 78192302 edges, 848119 markings/sec, 55 secs
lola: 56136294 markings, 84396641 edges, 825951 markings/sec, 60 secs
lola: 60241641 markings, 90563922 edges, 821069 markings/sec, 65 secs
lola: 64393485 markings, 96800710 edges, 830369 markings/sec, 70 secs
lola: 68580162 markings, 103089985 edges, 837335 markings/sec, 75 secs
lola: 72394855 markings, 108819931 edges, 762939 markings/sec, 80 secs
lola: 73931948 markings, 111129712 edges, 307419 markings/sec, 85 secs
lola: 77266891 markings, 116153809 edges, 666989 markings/sec, 90 secs
lola: 80731912 markings, 121342690 edges, 693004 markings/sec, 95 secs
lola: 82600756 markings, 124149957 edges, 373769 markings/sec, 100 secs
lola: 83718144 markings, 125827993 edges, 223478 markings/sec, 105 secs
lola: 86503143 markings, 130011073 edges, 557000 markings/sec, 110 secs
lola: 89541374 markings, 134574476 edges, 607646 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p21)) OR (F (((1 <= p21))) AND F (G ((F ((F ((1 <= p15)) AND (1 <= p22))) AND (X ((1 <= p24)) OR (F ((1 <= p15)) AND (1 <= p22))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p21))
lola: processed formula length: 12
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p21)))
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: ((p21 <= 0))
lola: processed formula length: 12
lola: 60 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: 7685 markings, 7685 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p24 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p24 <= 0))
lola: processed formula length: 14
lola: 58 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: 21819 markings, 24436 edges
lola: ========================================
lola: subprocess 10 will run for 800 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p0) AND (1 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p0) AND (1 <= p26)))
lola: processed formula length: 30
lola: 58 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: 163779 markings, 335225 edges
lola: ========================================
lola: subprocess 11 will run for 1066 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p2))) OR (1 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1066 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p11)
lola: processed formula length: 10
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 1600 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p2)))
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 <= p2)))
lola: processed formula length: 17
lola: 58 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: 5121 markings, 5121 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1600 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p13) AND (1 <= p17) AND (1 <= p21)) OR (G ((p11 <= 0)) AND F (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))))) OR G ((1 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1600 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p11))
lola: processed formula length: 14
lola: 58 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: 7685 markings, 7685 edges
lola: ========================================
lola: subprocess 13 will run for 3200 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p13) AND (1 <= p17) AND (1 <= p21)) OR (G ((p11 <= 0)) AND F (((1 <= p13) AND (1 <= p17) AND (1 <= p21))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p13) AND (1 <= p17) AND (1 <= p21)) OR (G ((p11 <= 0)) AND F (((1 <= p13) AND (1 <= p17) AND (1 <= p21))))))
lola: processed formula length: 119
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1286 markings, 1288 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 3199 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p20) AND (F ((1 <= p20)) OR ((1 <= p8) AND (1 <= p9))))) OR (F (((1 <= p20) AND (F ((1 <= p20)) OR ((1 <= p8) AND (1 <= p9))))) AND F (G (((p20 <= 0) OR (p8 <= 0) OR (p9 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3199 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p20 <= 0) OR (p8 <= 0) OR (p9 <= 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 (((p20 <= 0) OR (p8 <= 0) OR (p9 <= 0))))
lola: processed formula length: 48
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 25
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: 1290 markings, 1296 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((G (((1 <= p8) AND (1 <= p9))) OR (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((1 <= p8) AND (1 <= p9))) OR (1 <= p15))))
lola: processed formula length: 53
lola: 58 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: 5175385 markings, 7801876 edges, 1035077 markings/sec, 0 secs
lola: 10183863 markings, 15337076 edges, 1001696 markings/sec, 5 secs
lola: 14987405 markings, 22560572 edges, 960708 markings/sec, 10 secs
lola: 19639960 markings, 29555023 edges, 930511 markings/sec, 15 secs
lola: 24290999 markings, 36546382 edges, 930208 markings/sec, 20 secs
lola: 28959470 markings, 43562754 edges, 933694 markings/sec, 25 secs
lola: 33558534 markings, 50473951 edges, 919813 markings/sec, 30 secs
lola: 38132997 markings, 57347878 edges, 914893 markings/sec, 35 secs
lola: 42752846 markings, 64289515 edges, 923970 markings/sec, 40 secs
lola: 47442434 markings, 71335469 edges, 937918 markings/sec, 45 secs
lola: 51998793 markings, 78180631 edges, 911272 markings/sec, 50 secs
lola: 56607200 markings, 85104171 edges, 921681 markings/sec, 55 secs
lola: 61112030 markings, 91871271 edges, 900966 markings/sec, 60 secs
lola: 65752823 markings, 98842526 edges, 928159 markings/sec, 65 secs
lola: 70380180 markings, 105793655 edges, 925471 markings/sec, 70 secs
lola: 73632719 markings, 110680284 edges, 650508 markings/sec, 75 secs
lola: 77077259 markings, 115854106 edges, 688908 markings/sec, 80 secs
lola: 80671646 markings, 121253140 edges, 718877 markings/sec, 85 secs
lola: 82361816 markings, 123790799 edges, 338034 markings/sec, 90 secs
lola: 83540440 markings, 125561204 edges, 235725 markings/sec, 95 secs
lola: 84707689 markings, 127314268 edges, 233450 markings/sec, 100 secs
lola: 87526798 markings, 131548574 edges, 563822 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G ((((p24 <= 0) R ((p3 <= 0) OR (p4 <= 0))) AND X ((G (((p8 <= 0) OR (p25 <= 0))) OR ((1 <= p8) AND (1 <= p25)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p24 <= 0) R ((p3 <= 0) OR (p4 <= 0))) AND X ((G (((p8 <= 0) OR (p25 <= 0))) OR ((1 <= p8) AND (1 <= p25)))))))
lola: processed formula length: 121
lola: 58 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: 4289817 markings, 6477483 edges, 857963 markings/sec, 0 secs
lola: 8398415 markings, 12665168 edges, 821720 markings/sec, 5 secs
lola: 12442363 markings, 18751614 edges, 808790 markings/sec, 10 secs
lola: 16587309 markings, 24987727 edges, 828989 markings/sec, 15 secs
lola: 20564248 markings, 30969722 edges, 795388 markings/sec, 20 secs
lola: 24442050 markings, 36801756 edges, 775560 markings/sec, 25 secs
lola: 28356346 markings, 42687340 edges, 782859 markings/sec, 30 secs
lola: 32137011 markings, 48371805 edges, 756133 markings/sec, 35 secs
lola: 36076273 markings, 54294163 edges, 787852 markings/sec, 40 secs
lola: 39825080 markings, 59929610 edges, 749761 markings/sec, 45 secs
lola: 43639470 markings, 65663394 edges, 762878 markings/sec, 50 secs
lola: 47581916 markings, 71589414 edges, 788489 markings/sec, 55 secs
lola: 51592229 markings, 77616689 edges, 802063 markings/sec, 60 secs
lola: 55440762 markings, 83401160 edges, 769707 markings/sec, 65 secs
lola: 59246946 markings, 89121095 edges, 761237 markings/sec, 70 secs
lola: 62974925 markings, 94723646 edges, 745596 markings/sec, 75 secs
lola: 66870322 markings, 100577418 edges, 779079 markings/sec, 80 secs
lola: 70735097 markings, 106384927 edges, 772955 markings/sec, 85 secs
lola: 74689690 markings, 112327100 edges, 790919 markings/sec, 90 secs
lola: 78274655 markings, 117713868 edges, 716993 markings/sec, 95 secs
lola: 78785392 markings, 118481577 edges, 102147 markings/sec, 100 secs
lola: 79265792 markings, 119203095 edges, 96080 markings/sec, 105 secs
lola: 80014227 markings, 120328042 edges, 149687 markings/sec, 110 secs
lola: 80599704 markings, 121207627 edges, 117095 markings/sec, 115 secs
lola: 81173093 markings, 122069246 edges, 114678 markings/sec, 120 secs
lola: 81960960 markings, 123252755 edges, 157573 markings/sec, 125 secs
lola: 82509824 markings, 124077609 edges, 109773 markings/sec, 130 secs
lola: 84568391 markings, 127170517 edges, 411713 markings/sec, 135 secs
lola: 87761746 markings, 131968510 edges, 638671 markings/sec, 140 secs
lola: 90984613 markings, 136810821 edges, 644573 markings/sec, 145 secs
lola: 94201851 markings, 141644724 edges, 643448 markings/sec, 150 secs
lola: 96833921 markings, 145598915 edges, 526414 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p3) AND (1 <= p4)) OR ((G (F (((1 <= p8) AND (1 <= p25)))) AND F (((1 <= p3) AND (1 <= p4)))) OR (X (((1 <= p1) AND (1 <= p2))) OR G (((1 <= p8) AND (1 <= p25))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p3) AND (1 <= p4)) OR ((G (F (((1 <= p8) AND (1 <= p25)))) AND F (((1 <= p3) AND (1 <= p4)))) OR (X (((1 <= p1) AND (1 <= p2))) OR G (((1 <= p8) AND (1 <= p25))))))))
lola: processed formula length: 180
lola: 58 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: 4645662 markings, 7004523 edges, 929132 markings/sec, 0 secs
lola: 9238552 markings, 13915206 edges, 918578 markings/sec, 5 secs
lola: 13743507 markings, 20690127 edges, 900991 markings/sec, 10 secs
lola: 18175690 markings, 27353781 edges, 886437 markings/sec, 15 secs
lola: 22514427 markings, 33875884 edges, 867747 markings/sec, 20 secs
lola: 26876520 markings, 40432187 edges, 872419 markings/sec, 25 secs
lola: 31198515 markings, 46927503 edges, 864399 markings/sec, 30 secs
lola: 35366023 markings, 53190160 edges, 833502 markings/sec, 35 secs
lola: 39558199 markings, 59489305 edges, 838435 markings/sec, 40 secs
lola: 43810709 markings, 65878900 edges, 850502 markings/sec, 45 secs
lola: 47959701 markings, 72112426 edges, 829798 markings/sec, 50 secs
lola: 52119497 markings, 78362182 edges, 831959 markings/sec, 55 secs
lola: 56177706 markings, 84458845 edges, 811642 markings/sec, 60 secs
lola: 60213749 markings, 90522061 edges, 807209 markings/sec, 65 secs
lola: 64344067 markings, 96726551 edges, 826064 markings/sec, 70 secs
lola: 68339216 markings, 102727668 edges, 799030 markings/sec, 75 secs
lola: 72405520 markings, 108836563 edges, 813261 markings/sec, 80 secs
lola: 75107524 markings, 112905262 edges, 540401 markings/sec, 85 secs
lola: 78242772 markings, 117623390 edges, 627050 markings/sec, 90 secs
lola: 81313743 markings, 122216506 edges, 614194 markings/sec, 95 secs
lola: 84626654 markings, 127192736 edges, 662582 markings/sec, 100 secs
lola: 87726490 markings, 131848610 edges, 619967 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p20) AND (F ((1 <= p20)) OR ((1 <= p8) AND (1 <= p9))))) OR (F (((1 <= p20) AND (F ((1 <= p20)) OR ((1 <= p8) AND (1 <= p9))))) AND F (G (((p20 <= 0) OR (p8 <= 0) OR (p9 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (G (((p20 <= 0) OR (p8 <= 0) OR (p9 <= 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 (((p20 <= 0) OR (p8 <= 0) OR (p9 <= 0))))
lola: processed formula length: 48
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 25
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: 1290 markings, 1296 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (((1 <= p20) AND (F ((1 <= p20)) OR ((1 <= p8) AND (1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((1 <= p20) AND (F ((1 <= p20)) OR ((1 <= p8) AND (1 <= p9)))))
lola: processed formula length: 66
lola: 58 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: 1285 markings, 1285 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no unknown no unknown no no no no no no no no unknown no
lola:
preliminary result: no unknown no unknown no no no no no no no no unknown no
lola: ========================================
lola: memory consumption: 3368 KB
lola: time consumption: 767 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="CloudOpsManagement-PT-02560by01280"
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 CloudOpsManagement-PT-02560by01280, 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 r056-oct2-162038334800222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-02560by01280.tgz
mv CloudOpsManagement-PT-02560by01280 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 ;