About the Execution of 2020-gold for CloudOpsManagement-PT-00160by00080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16253.979 | 3600000.00 | 510258.00 | 2257.30 | FF??FFFFFFFFFFFF | 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-162038334700206.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-00160by00080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334700206
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K 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 4.1K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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.7K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 17K 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-00160by00080-00
FORMULA_NAME CloudOpsManagement-PT-00160by00080-01
FORMULA_NAME CloudOpsManagement-PT-00160by00080-02
FORMULA_NAME CloudOpsManagement-PT-00160by00080-03
FORMULA_NAME CloudOpsManagement-PT-00160by00080-04
FORMULA_NAME CloudOpsManagement-PT-00160by00080-05
FORMULA_NAME CloudOpsManagement-PT-00160by00080-06
FORMULA_NAME CloudOpsManagement-PT-00160by00080-07
FORMULA_NAME CloudOpsManagement-PT-00160by00080-08
FORMULA_NAME CloudOpsManagement-PT-00160by00080-09
FORMULA_NAME CloudOpsManagement-PT-00160by00080-10
FORMULA_NAME CloudOpsManagement-PT-00160by00080-11
FORMULA_NAME CloudOpsManagement-PT-00160by00080-12
FORMULA_NAME CloudOpsManagement-PT-00160by00080-13
FORMULA_NAME CloudOpsManagement-PT-00160by00080-14
FORMULA_NAME CloudOpsManagement-PT-00160by00080-15
=== Now, execution of the tool begins
BK_START 1620902337009
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:38:58] [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:38:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:38:58] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-13 10:38:58] [INFO ] Transformed 27 places.
[2021-05-13 10:38:58] [INFO ] Transformed 29 transitions.
[2021-05-13 10:38:58] [INFO ] Parsed PT model containing 27 places and 29 transitions in 106 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 100134 steps, including 0 resets, run finished after 71 ms. (steps per millisecond=1410 ) properties seen :[1, 1, 1, 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, 1, 0]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:38:58] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-13 10:38:58] [INFO ] [Real]Absence check using 11 positive place invariants in 37 ms returned sat
[2021-05-13 10:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:38:59] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-13 10:38:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:38:59] [INFO ] [Real]Added 3 Read/Feed constraints in 6 ms returned sat
[2021-05-13 10:38:59] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 15 ms.
[2021-05-13 10:38:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:38:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 83 ms returned sat
[2021-05-13 10:38:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:38:59] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2021-05-13 10:38:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2021-05-13 10:38:59] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 10:38:59] [INFO ] Added : 25 causal constraints over 6 iterations in 128 ms. Result :sat
[2021-05-13 10:38:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 10:38:59] [INFO ] Flatten gal took : 22 ms
[2021-05-13 10:38:59] [INFO ] Flatten gal took : 7 ms
[2021-05-13 10:38:59] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-13 10:38:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudOpsManagement-PT-00160by00080 @ 3570 seconds
FORMULA CloudOpsManagement-PT-00160by00080-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3140
rslt: Output for LTLFireability @ CloudOpsManagement-PT-00160by00080
{
"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:39:00 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X ((((1 <= p8) AND (1 <= p9)) U G (((1 <= p8) AND (1 <= p9))))))",
"processed_size": 67,
"rewrites": 90
},
"result":
{
"edges": 538766,
"markings": 354787,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((G ((1 <= p15)) OR (G ((p7 <= 0)) OR ((p0 <= 0) OR (p26 <= 0)))) U (1 <= p15)))",
"processed_size": 83,
"rewrites": 90
},
"result":
{
"edges": 617978,
"markings": 407111,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 279
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 279
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": 6,
"visible_transitions": 0
},
"processed": "((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0) OR (p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))",
"processed_size": 85,
"rewrites": 90
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 304
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (F ((G ((((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) AND ((1 <= p8) AND (1 <= p25)))))",
"processed_size": 134,
"rewrites": 90
},
"result":
{
"edges": 85,
"markings": 85,
"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": 304
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 304
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p11 <= 0)))",
"processed_size": 18,
"rewrites": 90
},
"result":
{
"edges": 85,
"markings": 85,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 335
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 335
},
"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": 92
},
"result":
{
"edges": 485,
"markings": 485,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 372
},
"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": 90
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 419
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((((1 <= p21)) OR (G ((1 <= p18)) AND F (((1 <= p21))))))",
"processed_size": 59,
"rewrites": 90
},
"result":
{
"edges": 485,
"markings": 485,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 372
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((G (F ((X (X ((1 <= p18))) AND (p15 <= 0)))) OR (p15 <= 0))))",
"processed_size": 67,
"rewrites": 90
},
"result":
{
"edges": 96,
"markings": 93,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 419
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G (((p8 <= 0) OR (p9 <= 0) OR (1 <= p22)))))",
"processed_size": 52,
"rewrites": 90
},
"result":
{
"edges": 85,
"markings": 85,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 478
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 478
},
"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": "((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))",
"processed_size": 40,
"rewrites": 93
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 558
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p14 <= 0))",
"processed_size": 14,
"rewrites": 90
},
"result":
{
"edges": 1544,
"markings": 1375,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 558
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 558
},
"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": "((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))",
"processed_size": 42,
"rewrites": 92
},
"result":
{
"edges": 485,
"markings": 485,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 670
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((p22 <= 0) AND (G ((1 <= p15)) OR X ((G ((p15 <= 0)) OR (p21 <= 0)))))))",
"processed_size": 79,
"rewrites": 90
},
"result":
{
"edges": 272,
"markings": 262,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 11,
"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": 838
},
"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": 92
},
"result":
{
"edges": 162,
"markings": 162,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1117
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G (((1 <= p13))))",
"processed_size": 20,
"rewrites": 90
},
"result":
{
"edges": 487,
"markings": 486,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1676
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p10) AND (1 <= p25)) U ((1 <= p8) AND (1 <= p9)))",
"processed_size": 57,
"rewrites": 90
},
"result":
{
"edges": 244,
"markings": 244,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3352
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p13 <= 0)) U (((1 <= p11) AND (1 <= p12) AND (1 <= p25)) U ((1 <= p13))))",
"processed_size": 76,
"rewrites": 90
},
"result":
{
"edges": 83,
"markings": 83,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"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": 3104,
"runtime": 430.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((** U G(**)))) : X(((G(**) OR (G(*) OR (** OR **))) U **)) : X(X(X(((* R *) OR (* R *))))) : (X(**) U (X(G((F(**) AND (** OR **)))) OR (** U G(*)))) : (X(F((G(**) AND (** AND **)))) AND **) : (** U (** U **)) : (** U **) : (G(F(*)) AND X(X((G(F(**)) OR X(**))))) : (** OR ((G(**) AND F(**)) OR (G(((G(**) AND X(*)) OR (* OR (* OR *)))) AND F((** OR (G(**) AND F(**))))))) : F(**) : X(G((G(F((X(X(**)) AND *))) OR *))) : X(X(G(*))) : (G(*) AND (X(G(*)) OR (** OR (** OR **)))) : (F(**) AND X((X(G(**)) OR **))) : F(G(**)) : G(F((** AND (G(*) OR X((G(*) OR *))))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no unknown unknown no no no no no no no no no no no no ",
"value": "no no unknown unknown no no no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 <= p16)
lola: LP says that atomic proposition is always true: (1 <= p16)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p16)
lola: X ((X (((1 <= p8) AND (1 <= p9))) U G (X (((1 <= p8) AND (1 <= p9)))))) : (X ((((G ((1 <= p15)) OR NOT(F ((1 <= p7)))) OR (p0 <= 0)) OR (p26 <= 0))) U X ((1 <= p15))) : X (X (X ((NOT((((1 <= p8) AND (1 <= p9)) U (p15 <= 0))) OR NOT(((1 <= p11) U (1 <= p22))))))) : (X ((p22 <= 0)) U (G (X (((1 <= p24) U ((1 <= p10) AND (1 <= p25))))) OR ((1 <= p22) U NOT(F (((1 <= p10) AND (1 <= p25))))))) : (X (F (((G ((((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) AND (1 <= p8)) AND (1 <= p25)))) AND ((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0) OR (p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))) : (((p13 <= 0)) U (((1 <= p11) AND (1 <= p12) AND (1 <= p25)) U ((1 <= p13)))) : (((1 <= p10) AND (1 <= p25)) U ((1 <= p8) AND (1 <= p9))) : (NOT(F (G ((1 <= p11)))) AND X (X ((G (F (((1 <= p11) AND (1 <= p12) AND (1 <= p25)))) OR X (((1 <= p2) AND (1 <= p8) AND (1 <= p25))))))) : (NOT(F (((((NOT(G (((1 <= p5) AND (1 <= p7) AND (1 <= p26)))) OR X (((1 <= p5) AND (1 <= p7) AND (1 <= p26)))) AND (1 <= p11)) AND (1 <= p12)) AND (1 <= p25)))) U (G ((1 <= p18)) U ((1 <= p21)))) : F ((X (((1 <= p8) AND (1 <= p9))) U ((1 <= p8) AND (1 <= p9)))) : NOT(F (X (F ((F (G ((X (NOT(X ((1 <= p18)))) OR (1 <= p15)))) AND (1 <= p15)))))) : NOT(F (X (((X (((1 <= p8) AND (1 <= p9))) AND (1 <= p24)) U X (((1 <= p8) AND (1 <= p9) AND (p22 <= 0))))))) : (NOT(F ((1 <= p14))) AND (((NOT(F (X (F ((1 <= p14))))) OR (p13 <= 0)) OR (p17 <= 0)) OR (p21 <= 0))) : ((((1 <= p13) AND (1 <= p17) AND (1 <= p21)) U F (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) AND X ((G (X (((1 <= p10) AND (1 <= p25)))) OR (1 <= p14)))) : F (X (F (G (((1 <= p13)))))) : G (F (X (((p22 <= 0) AND (NOT(F ((p15 <= 0))) OR NOT(X ((F ((1 <= p15)) AND (1 <= p21)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:410
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((1 <= p8) AND (1 <= p9)) U G (((1 <= p8) AND (1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((1 <= p8) AND (1 <= p9)) U G (((1 <= p8) AND (1 <= p9))))))
lola: processed formula length: 67
lola: 90 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: 354787 markings, 538766 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G ((1 <= p15)) OR (G ((p7 <= 0)) OR ((p0 <= 0) OR (p26 <= 0)))) U (1 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G ((1 <= p15)) OR (G ((p7 <= 0)) OR ((p0 <= 0) OR (p26 <= 0)))) U (1 <= p15)))
lola: processed formula length: 83
lola: 90 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: 407111 markings, 617978 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (((((p8 <= 0) OR (p9 <= 0)) R (1 <= p15)) OR ((p11 <= 0) R (p22 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (((((p8 <= 0) OR (p9 <= 0)) R (1 <= p15)) OR ((p11 <= 0) R (p22 <= 0))))))
lola: processed formula length: 83
lola: 90 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5659547 markings, 8562431 edges, 1131909 markings/sec, 0 secs
lola: 11003213 markings, 16644658 edges, 1068733 markings/sec, 5 secs
lola: 16182270 markings, 24477951 edges, 1035811 markings/sec, 10 secs
lola: 21378246 markings, 32336852 edges, 1039195 markings/sec, 15 secs
lola: 26542597 markings, 40147905 edges, 1032870 markings/sec, 20 secs
lola: 31816153 markings, 48124116 edges, 1054711 markings/sec, 25 secs
lola: 37093005 markings, 56105259 edges, 1055370 markings/sec, 30 secs
lola: 42331517 markings, 64028499 edges, 1047702 markings/sec, 35 secs
lola: 47753196 markings, 72228748 edges, 1084336 markings/sec, 40 secs
lola: 53185707 markings, 80445392 edges, 1086502 markings/sec, 45 secs
lola: 58561682 markings, 88576492 edges, 1075195 markings/sec, 50 secs
lola: 63825653 markings, 96538216 edges, 1052794 markings/sec, 55 secs
lola: 69085719 markings, 104494038 edges, 1052013 markings/sec, 60 secs
lola: 73938758 markings, 111835584 edges, 970608 markings/sec, 65 secs
lola: 77980078 markings, 117948122 edges, 808264 markings/sec, 70 secs
lola: 82056975 markings, 124113023 edges, 815379 markings/sec, 75 secs
lola: 86228356 markings, 130423134 edges, 834276 markings/sec, 80 secs
lola: 89798248 markings, 135823517 edges, 713978 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p22 <= 0)) U (X (G ((F (((1 <= p10) AND (1 <= p25))) AND ((1 <= p24) OR ((1 <= p10) AND (1 <= p25)))))) OR ((1 <= p22) U G (((p10 <= 0) OR (p25 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p22 <= 0)) U (X (G ((F (((1 <= p10) AND (1 <= p25))) AND ((1 <= p24) OR ((1 <= p10) AND (1 <= p25)))))) OR ((1 <= p22) U G (((p10 <= 0) OR (p25 <= 0))))))
lola: processed formula length: 160
lola: 90 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 27 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: 4985274 markings, 7546905 edges, 997055 markings/sec, 0 secs
lola: 9909507 markings, 14994791 edges, 984847 markings/sec, 5 secs
lola: 14786402 markings, 22370996 edges, 975379 markings/sec, 10 secs
lola: 19525887 markings, 29539490 edges, 947897 markings/sec, 15 secs
lola: 24202957 markings, 36613603 edges, 935414 markings/sec, 20 secs
lola: 28851171 markings, 43643813 edges, 929643 markings/sec, 25 secs
lola: 33439349 markings, 50583530 edges, 917636 markings/sec, 30 secs
lola: 37969000 markings, 57434530 edges, 905930 markings/sec, 35 secs
lola: 42502201 markings, 64290922 edges, 906640 markings/sec, 40 secs
lola: 47066529 markings, 71194487 edges, 912866 markings/sec, 45 secs
lola: 51717396 markings, 78228866 edges, 930173 markings/sec, 50 secs
lola: 56233448 markings, 85059395 edges, 903210 markings/sec, 55 secs
lola: 60678816 markings, 91783014 edges, 889074 markings/sec, 60 secs
lola: 65177959 markings, 98587840 edges, 899829 markings/sec, 65 secs
lola: 69691021 markings, 105413785 edges, 902612 markings/sec, 70 secs
lola: 74238408 markings, 112291752 edges, 909477 markings/sec, 75 secs
lola: 78778338 markings, 119158286 edges, 907986 markings/sec, 80 secs
lola: 83433645 markings, 126199398 edges, 931061 markings/sec, 85 secs
lola: 87733573 markings, 132703958 edges, 859986 markings/sec, 90 secs
lola: 91436061 markings, 138304027 edges, 740498 markings/sec, 95 secs
lola: 95273507 markings, 144108356 edges, 767489 markings/sec, 100 secs
lola: 99164093 markings, 149991738 edges, 778117 markings/sec, 105 secs
lola: 102791377 markings, 155477836 edges, 725457 markings/sec, 110 secs
lola: 106668391 markings, 161341853 edges, 775403 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((G ((((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) AND ((1 <= p8) AND (1 <= p25))))) AND ((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0) OR (p13 <= 0) OR (p17 <= 0) OR (p21 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0) OR (p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0) OR (p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))
lola: processed formula length: 85
lola: 90 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) AND ((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 ((G ((((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) AND ((1 <= p8) AND (1 <= p25)))))
lola: processed formula length: 134
lola: 90 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: 85 markings, 85 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p11 <= 0))) AND X (X ((G (F (((1 <= p11) AND (1 <= p12) AND (1 <= p25)))) OR X (((1 <= p2) AND (1 <= p8) AND (1 <= p25)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p11 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p11 <= 0)))
lola: processed formula length: 18
lola: 90 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: 85 markings, 85 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p21)) OR ((G ((1 <= p18)) AND F (((1 <= p21)))) OR (G (((G (((1 <= p5) AND (1 <= p7) AND (1 <= p26))) AND X (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0)))) OR ((p11 <= 0) OR ((p12 <= 0) OR (p25 <= 0))))) AND F ((((1 <= p21)) OR (G ((1 <= p18)) AND F (((1 <= p21)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 335 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: 92 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: 485 markings, 485 edges
lola: ========================================
lola: subprocess 7 will run for 372 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: 90 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 8 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p21)) OR (G ((1 <= p18)) AND F (((1 <= p21))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p21)) OR (G ((1 <= p18)) AND F (((1 <= p21))))))
lola: processed formula length: 59
lola: 90 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: 485 markings, 485 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((X (X ((1 <= p18))) AND (p15 <= 0)))) OR (p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((X (X ((1 <= p18))) AND (p15 <= 0)))) OR (p15 <= 0))))
lola: processed formula length: 67
lola: 90 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 93 markings, 96 edges
lola: ========================================
lola: subprocess 8 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p8 <= 0) OR (p9 <= 0) OR (1 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p8 <= 0) OR (p9 <= 0) OR (1 <= p22)))))
lola: processed formula length: 52
lola: 90 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: 85 markings, 85 edges
lola: ========================================
lola: subprocess 9 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p14 <= 0)) AND (X (G ((p14 <= 0))) OR ((p13 <= 0) OR ((p17 <= 0) OR (p21 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p13 <= 0) OR ((p17 <= 0) OR (p21 <= 0)))
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: ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))
lola: processed formula length: 40
lola: 93 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p14 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p14 <= 0))
lola: processed formula length: 14
lola: 90 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: 1375 markings, 1544 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p13) AND (1 <= p17) AND (1 <= p21))) AND X ((X (G (((1 <= p10) AND (1 <= p25)))) OR (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p13) AND (1 <= p17) AND (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: ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))
lola: processed formula length: 42
lola: 92 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: 485 markings, 485 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 670 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p22 <= 0) AND (G ((1 <= p15)) OR X ((G ((p15 <= 0)) OR (p21 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p22 <= 0) AND (G ((1 <= p15)) OR X ((G ((p15 <= 0)) OR (p21 <= 0)))))))
lola: processed formula length: 79
lola: 90 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 262 markings, 272 edges
lola: ========================================
lola: subprocess 12 will run for 838 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: 92 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: 162 markings, 162 edges
lola: ========================================
lola: subprocess 13 will run for 1117 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p13))))
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 <= p13))))
lola: processed formula length: 20
lola: 90 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 3
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: 486 markings, 487 edges
lola: ========================================
lola: subprocess 14 will run for 1676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p10) AND (1 <= p25)) U ((1 <= p8) AND (1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p10) AND (1 <= p25)) U ((1 <= p8) AND (1 <= p9)))
lola: processed formula length: 57
lola: 90 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: 244 markings, 244 edges
lola: ========================================
lola: subprocess 15 will run for 3352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p13 <= 0)) U (((1 <= p11) AND (1 <= p12) AND (1 <= p25)) U ((1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p13 <= 0)) U (((1 <= p11) AND (1 <= p12) AND (1 <= p25)) U ((1 <= p13))))
lola: processed formula length: 76
lola: 90 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: 83 markings, 83 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (X (((((p8 <= 0) OR (p9 <= 0)) R (1 <= p15)) OR ((p11 <= 0) R (p22 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (((((p8 <= 0) OR (p9 <= 0)) R (1 <= p15)) OR ((p11 <= 0) R (p22 <= 0))))))
lola: processed formula length: 83
lola: 90 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5772568 markings, 8733339 edges, 1154514 markings/sec, 0 secs
lola: 11286169 markings, 17072649 edges, 1102720 markings/sec, 5 secs
lola: 16588774 markings, 25092793 edges, 1060521 markings/sec, 10 secs
lola: 21869926 markings, 33080510 edges, 1056230 markings/sec, 15 secs
lola: 27061400 markings, 40932516 edges, 1038295 markings/sec, 20 secs
lola: 32239603 markings, 48764530 edges, 1035641 markings/sec, 25 secs
lola: 37431526 markings, 56617288 edges, 1038385 markings/sec, 30 secs
lola: 42615051 markings, 64457353 edges, 1036705 markings/sec, 35 secs
lola: 48146908 markings, 72824213 edges, 1106371 markings/sec, 40 secs
lola: 53564063 markings, 81017671 edges, 1083431 markings/sec, 45 secs
lola: 58887470 markings, 89069279 edges, 1064681 markings/sec, 50 secs
lola: 64227344 markings, 97145805 edges, 1067975 markings/sec, 55 secs
lola: 69543830 markings, 105186884 edges, 1063297 markings/sec, 60 secs
lola: 74473484 markings, 112643639 edges, 985931 markings/sec, 65 secs
lola: 78678990 markings, 119004655 edges, 841101 markings/sec, 70 secs
lola: 82545414 markings, 124851706 edges, 773285 markings/sec, 75 secs
lola: 86650132 markings, 131060070 edges, 820944 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X ((p22 <= 0)) U (X (G ((F (((1 <= p10) AND (1 <= p25))) AND ((1 <= p24) OR ((1 <= p10) AND (1 <= p25)))))) OR ((1 <= p22) U G (((p10 <= 0) OR (p25 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p22 <= 0)) U (X (G ((F (((1 <= p10) AND (1 <= p25))) AND ((1 <= p24) OR ((1 <= p10) AND (1 <= p25)))))) OR ((1 <= p22) U G (((p10 <= 0) OR (p25 <= 0))))))
lola: processed formula length: 160
lola: 90 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 27 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: 4983734 markings, 7544537 edges, 996747 markings/sec, 0 secs
lola: 9872638 markings, 14939034 edges, 977781 markings/sec, 5 secs
lola: 14680380 markings, 22210749 edges, 961548 markings/sec, 10 secs
lola: 19474096 markings, 29461107 edges, 958743 markings/sec, 15 secs
lola: 24153567 markings, 36538807 edges, 935894 markings/sec, 20 secs
lola: 28872261 markings, 43675746 edges, 943739 markings/sec, 25 secs
lola: 33448047 markings, 50596623 edges, 915157 markings/sec, 30 secs
lola: 38141271 markings, 57695093 edges, 938645 markings/sec, 35 secs
lola: 42656311 markings, 64524034 edges, 903008 markings/sec, 40 secs
lola: 47191174 markings, 71383105 edges, 906973 markings/sec, 45 secs
lola: 51785120 markings, 78331285 edges, 918789 markings/sec, 50 secs
lola: 56438861 markings, 85370137 edges, 930748 markings/sec, 55 secs
lola: 61088605 markings, 92402823 edges, 929949 markings/sec, 60 secs
lola: 65758242 markings, 99465663 edges, 933927 markings/sec, 65 secs
lola: 70274524 markings, 106296445 edges, 903256 markings/sec, 70 secs
lola: 74809028 markings, 113154794 edges, 906901 markings/sec, 75 secs
lola: 79313454 markings, 119967750 edges, 900885 markings/sec, 80 secs
lola: 83943199 markings, 126970153 edges, 925949 markings/sec, 85 secs
lola: 88154061 markings, 133339875 edges, 842172 markings/sec, 90 secs
lola: 92025677 markings, 139196301 edges, 774323 markings/sec, 95 secs
lola: 95787474 markings, 144884583 edges, 752359 markings/sec, 100 secs
lola: 99732865 markings, 150851923 edges, 789078 markings/sec, 105 secs
lola: 103561383 markings, 156642497 edges, 765704 markings/sec, 110 secs
lola: 107003015 markings, 161847946 edges, 688326 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no unknown unknown no no no no no no no no no no no no
lola:
preliminary result: no no unknown unknown no no no no no no no no no no no no
lola: memory consumption: 3104 KB
lola: time consumption: 430 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-00160by00080"
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-00160by00080, 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-162038334700206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-00160by00080.tgz
mv CloudOpsManagement-PT-00160by00080 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 ;