About the Execution of 2020-gold for SwimmingPool-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16256.479 | 3600000.00 | 759762.00 | 28170.70 | FFTFTTTFFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800700369.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SwimmingPool-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800700369
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SwimmingPool-PT-04-00
FORMULA_NAME SwimmingPool-PT-04-01
FORMULA_NAME SwimmingPool-PT-04-02
FORMULA_NAME SwimmingPool-PT-04-03
FORMULA_NAME SwimmingPool-PT-04-04
FORMULA_NAME SwimmingPool-PT-04-05
FORMULA_NAME SwimmingPool-PT-04-06
FORMULA_NAME SwimmingPool-PT-04-07
FORMULA_NAME SwimmingPool-PT-04-08
FORMULA_NAME SwimmingPool-PT-04-09
FORMULA_NAME SwimmingPool-PT-04-10
FORMULA_NAME SwimmingPool-PT-04-11
FORMULA_NAME SwimmingPool-PT-04-12
FORMULA_NAME SwimmingPool-PT-04-13
FORMULA_NAME SwimmingPool-PT-04-14
FORMULA_NAME SwimmingPool-PT-04-15
=== Now, execution of the tool begins
BK_START 1621225235107
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 04:20:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-17 04:20:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:20:36] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-17 04:20:36] [INFO ] Transformed 9 places.
[2021-05-17 04:20:36] [INFO ] Transformed 7 transitions.
[2021-05-17 04:20:36] [INFO ] Parsed PT model containing 9 places and 7 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100017 steps, including 0 resets, run finished after 91 ms. (steps per millisecond=1099 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 04:20:36] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 04:20:36] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned unsat
[2021-05-17 04:20:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-17 04:20:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-17 04:20:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 7 simplifications.
[2021-05-17 04:20:37] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-17 04:20:37] [INFO ] Flatten gal took : 18 ms
FORMULA SwimmingPool-PT-04-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-04-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-04-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:20:37] [INFO ] Flatten gal took : 3 ms
[2021-05-17 04:20:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-17 04:20:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SwimmingPool-PT-04 @ 3570 seconds
FORMULA SwimmingPool-PT-04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-04-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2785
rslt: Output for LTLCardinality @ SwimmingPool-PT-04
{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon May 17 04:20:38 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (G (((p8 <= 2) R (X ((p2 + 1 <= p6)) R ((p8 <= 2) AND (p2 + 1 <= p5)))))))",
"processed_size": 79,
"rewrites": 82
},
"result":
{
"edges": 87,
"markings": 87,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F ((G ((F ((p0 <= p3)) AND (p8 <= 0))) OR (X ((p8 <= 0)) AND (F ((p0 <= p3)) AND (p8 <= 0))))) OR (p3 + 1 <= p0)))",
"processed_size": 118,
"rewrites": 82
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((F ((p6 + 1 <= p2)) OR (p0 + 1 <= p4)))))",
"processed_size": 50,
"rewrites": 82
},
"result":
{
"edges": 169,
"markings": 167,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((p6 <= p3)) OR (X (X (F ((p1 <= 1)))) AND (p6 <= p3))))",
"processed_size": 62,
"rewrites": 82
},
"result":
{
"edges": 3412,
"markings": 2629,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 401
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X ((p1 <= p7)) OR F (G ((p6 <= 0)))))",
"processed_size": 41,
"rewrites": 82
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (G ((p8 <= p2))) OR (G ((p6 <= p2)) AND F (G ((p8 <= p2))))))",
"processed_size": 67,
"rewrites": 82
},
"result":
{
"edges": 88,
"markings": 87,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 535
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 535
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p5 <= p2)",
"processed_size": 10,
"rewrites": 82
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 642
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p6) AND (p5 <= p2))) AND F ((p1 <= p5))))",
"processed_size": 55,
"rewrites": 82
},
"result":
{
"edges": 88,
"markings": 88,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 642
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(p4 <= 1)",
"processed_size": 9,
"rewrites": 84
},
"result":
{
"edges": 90,
"markings": 90,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 802
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(p5 <= 0)",
"processed_size": 9,
"rewrites": 84
},
"result":
{
"edges": 7760,
"markings": 5611,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1070
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "G (F ((G (F ((1 <= p3))) OR (p7 <= p6))))",
"processed_size": 41,
"rewrites": 82
},
"result":
{
"edges": 16687815,
"markings": 5597005,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1600
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (((p7 <= p2) OR (p6 <= p0))) AND (1 <= p0))))",
"processed_size": 55,
"rewrites": 82
},
"result":
{
"edges": 557,
"markings": 323,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3200
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3200
},
"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": "(p0 <= 2)",
"processed_size": 9,
"rewrites": 82
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (((p3 + 1 <= p8) OR G ((p0 <= 2))))",
"processed_size": 37,
"rewrites": 82
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((X (G ((p7 <= 1))) OR (F (G ((p1 + 1 <= p8))) OR (p1 <= 0)))))",
"processed_size": 68,
"rewrites": 82
},
"result":
{
"edges": 367063436,
"markings": 101055948,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"child":
[
{
"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": "(p0 <= 2)",
"processed_size": 9,
"rewrites": 82
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"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": "F (G ((p0 <= 2)))",
"processed_size": 17,
"rewrites": 82
},
"result":
{
"edges": 88,
"markings": 87,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3228,
"runtime": 785.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G((* R (X(*) R *))))) : F(**) : F(**) : F((F((G((F(**) AND *)) OR (X(*) AND (F(**) AND *)))) OR **)) : G(F((G(F(**)) OR **))) : X(X(F((F(*) OR *)))) : G(F((X(G(*)) OR (F(G(*)) OR **)))) : G((F(**) OR (X(X(F(**))) AND **))) : X((X(*) OR F(G(*)))) : (F(G(*)) AND (F((* OR G(*))) AND **)) : X((X(G(*)) OR (G(**) AND F(G(*))))) : G(F((G(**) AND **))) : (X((G((** AND **)) AND F(**))) AND **)"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no yes no yes yes no no no yes no no no no ",
"value": "no yes no yes yes no no no yes 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: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 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 LTLCardinality.xml
lola: G (NOT(X (X (((3 <= p8) U (X ((p6 <= p2)) U ((3 <= p8) OR (p5 <= p2)))))))) : F ((1 <= p5)) : F ((2 <= p4)) : F ((NOT(G ((X ((1 <= p8)) U (NOT(F ((p0 <= p3))) OR (1 <= p8))))) OR (p3 + 1 <= p0))) : X (G (F ((G (F ((1 <= p3))) OR (p7 <= p6))))) : NOT(X (X (G ((G ((p2 <= p6)) AND (p4 <= p0)))))) : G (F (X (((NOT(X (F ((2 <= p7)))) OR NOT(G (F ((p8 <= p1))))) OR (p1 <= 0))))) : G ((F ((p6 <= p3)) OR (X (X (F ((p1 <= 1)))) AND (p6 <= p3)))) : X ((NOT(X ((p7 + 1 <= p1))) OR NOT(G ((F ((p6 <= p2)) U F ((1 <= p6))))))) : (NOT((G ((p8 <= p3)) U G (F ((3 <= p0))))) AND (p0 <= 2)) : (X (G ((p6 <= p2))) U G (NOT(X (X ((p2 + 1 <= p8)))))) : F (G (X (F ((G (((p7 <= p2) OR (p6 <= p0))) AND (1 <= p0)))))) : ((X ((G ((1 <= p6)) AND G ((p5 <= p2)))) AND F (X (((p1 <= p5) U F ((p1 <= p5)))))) AND (p5 <= p2))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p8 <= 2) R (X ((p2 + 1 <= p6)) R ((p8 <= 2) AND (p2 + 1 <= p5)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p8 <= 2) R (X ((p2 + 1 <= p6)) R ((p8 <= 2) AND (p2 + 1 <= p5)))))))
lola: processed formula length: 79
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 87 markings, 87 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((G ((F ((p0 <= p3)) AND (p8 <= 0))) OR (X ((p8 <= 0)) AND (F ((p0 <= p3)) AND (p8 <= 0))))) OR (p3 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((G ((F ((p0 <= p3)) AND (p8 <= 0))) OR (X ((p8 <= 0)) AND (F ((p0 <= p3)) AND (p8 <= 0))))) OR (p3 + 1 <= p0)))
lola: processed formula length: 118
lola: 82 rewrites
lola: closed formula file LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((F ((p6 + 1 <= p2)) OR (p0 + 1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((F ((p6 + 1 <= p2)) OR (p0 + 1 <= p4)))))
lola: processed formula length: 50
lola: 82 rewrites
lola: closed formula file LTLCardinality.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: 167 markings, 169 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (G ((p7 <= 1))) OR (F (G ((p1 + 1 <= p8))) OR (p1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G ((p7 <= 1))) OR (F (G ((p1 + 1 <= p8))) OR (p1 <= 0)))))
lola: processed formula length: 68
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2231563 markings, 7282468 edges, 446313 markings/sec, 0 secs
lola: 4077469 markings, 13601149 edges, 369181 markings/sec, 5 secs
lola: 5828678 markings, 19670700 edges, 350242 markings/sec, 10 secs
lola: 7515636 markings, 25561998 edges, 337392 markings/sec, 15 secs
lola: 9152159 markings, 31305854 edges, 327305 markings/sec, 20 secs
lola: 10757711 markings, 36966531 edges, 321110 markings/sec, 25 secs
lola: 12338199 markings, 42554498 edges, 316098 markings/sec, 30 secs
lola: 13896721 markings, 48086671 edges, 311704 markings/sec, 35 secs
lola: 15433967 markings, 53558606 edges, 307449 markings/sec, 40 secs
lola: 16961149 markings, 59005381 edges, 305436 markings/sec, 45 secs
lola: 18471715 markings, 64403015 edges, 302113 markings/sec, 50 secs
lola: 19976036 markings, 69790149 edges, 300864 markings/sec, 55 secs
lola: 21468113 markings, 75140633 edges, 298415 markings/sec, 60 secs
lola: 22945870 markings, 80454316 edges, 295551 markings/sec, 65 secs
lola: 24401232 markings, 85704336 edges, 291072 markings/sec, 70 secs
lola: 25860757 markings, 90964165 edges, 291905 markings/sec, 75 secs
lola: 27303209 markings, 96174292 edges, 288490 markings/sec, 80 secs
lola: 28743396 markings, 101381068 edges, 288037 markings/sec, 85 secs
lola: 30177857 markings, 106574494 edges, 286892 markings/sec, 90 secs
lola: 31609544 markings, 111761158 edges, 286337 markings/sec, 95 secs
lola: 33045495 markings, 116971054 edges, 287190 markings/sec, 100 secs
lola: 34479007 markings, 122176381 edges, 286702 markings/sec, 105 secs
lola: 35904516 markings, 127354252 edges, 285102 markings/sec, 110 secs
lola: 37329669 markings, 132536636 edges, 285031 markings/sec, 115 secs
lola: 38748147 markings, 137701125 edges, 283696 markings/sec, 120 secs
lola: 40162685 markings, 142855999 edges, 282908 markings/sec, 125 secs
lola: 41576153 markings, 148001295 edges, 282694 markings/sec, 130 secs
lola: 42973098 markings, 153094595 edges, 279389 markings/sec, 135 secs
lola: 44360712 markings, 158169108 edges, 277523 markings/sec, 140 secs
lola: 45749834 markings, 163234028 edges, 277824 markings/sec, 145 secs
lola: 47128780 markings, 168278238 edges, 275789 markings/sec, 150 secs
lola: 48507063 markings, 173315377 edges, 275657 markings/sec, 155 secs
lola: 49883528 markings, 178349504 edges, 275293 markings/sec, 160 secs
lola: 51254326 markings, 183367778 edges, 274160 markings/sec, 165 secs
lola: 52620803 markings, 188375637 edges, 273295 markings/sec, 170 secs
lola: 53983488 markings, 193370209 edges, 272537 markings/sec, 175 secs
lola: 55342373 markings, 198353819 edges, 271777 markings/sec, 180 secs
lola: 56701755 markings, 203338954 edges, 271876 markings/sec, 185 secs
lola: 58057891 markings, 208306587 edges, 271227 markings/sec, 190 secs
lola: 59413969 markings, 213290310 edges, 271216 markings/sec, 195 secs
lola: 60768923 markings, 218266215 edges, 270991 markings/sec, 200 secs
lola: 62116458 markings, 223221032 edges, 269507 markings/sec, 205 secs
lola: 63474630 markings, 228221681 edges, 271634 markings/sec, 210 secs
lola: 64830209 markings, 233206101 edges, 271116 markings/sec, 215 secs
lola: 66186505 markings, 238200965 edges, 271259 markings/sec, 220 secs
lola: 67534805 markings, 243164029 edges, 269660 markings/sec, 225 secs
lola: 68883256 markings, 248134198 edges, 269690 markings/sec, 230 secs
lola: 70227085 markings, 253089364 edges, 268766 markings/sec, 235 secs
lola: 71575174 markings, 258060837 edges, 269618 markings/sec, 240 secs
lola: 72920844 markings, 263016717 edges, 269134 markings/sec, 245 secs
lola: 74261459 markings, 267964673 edges, 268123 markings/sec, 250 secs
lola: 75601854 markings, 272909929 edges, 268079 markings/sec, 255 secs
lola: 76938205 markings, 277842178 edges, 267270 markings/sec, 260 secs
lola: 78269501 markings, 282746923 edges, 266259 markings/sec, 265 secs
lola: 79578111 markings, 287598011 edges, 261722 markings/sec, 270 secs
lola: 80891831 markings, 292442795 edges, 262744 markings/sec, 275 secs
lola: 82204577 markings, 297299440 edges, 262549 markings/sec, 280 secs
lola: 83514930 markings, 302138505 edges, 262071 markings/sec, 285 secs
lola: 84823750 markings, 306972777 edges, 261764 markings/sec, 290 secs
lola: 86127045 markings, 311795581 edges, 260659 markings/sec, 295 secs
lola: 87430997 markings, 316623666 edges, 260790 markings/sec, 300 secs
lola: 88724808 markings, 321416903 edges, 258762 markings/sec, 305 secs
lola: 90003162 markings, 326159675 edges, 255671 markings/sec, 310 secs
lola: 91261015 markings, 330796379 edges, 251571 markings/sec, 315 secs
lola: 92388847 markings, 334969266 edges, 225566 markings/sec, 320 secs
lola: 93503762 markings, 339103135 edges, 222983 markings/sec, 325 secs
lola: 94665124 markings, 343392770 edges, 232272 markings/sec, 330 secs
lola: 95621053 markings, 346939159 edges, 191186 markings/sec, 335 secs
lola: 96753749 markings, 351131921 edges, 226539 markings/sec, 340 secs
lola: 97976521 markings, 355664914 edges, 244554 markings/sec, 345 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown yes unknown no unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p6 <= p3)) OR (X (X (F ((p1 <= 1)))) AND (p6 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p6 <= p3)) OR (X (X (F ((p1 <= 1)))) AND (p6 <= p3))))
lola: processed formula length: 62
lola: 82 rewrites
lola: closed formula file LTLCardinality.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: 2629 markings, 3412 edges
lola: ========================================
lola: subprocess 5 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((p1 <= p7)) OR F (G ((p6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((p1 <= p7)) OR F (G ((p6 <= 0)))))
lola: processed formula length: 41
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((p8 <= p2))) OR (G ((p6 <= p2)) AND F (G ((p8 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((p8 <= p2))) OR (G ((p6 <= p2)) AND F (G ((p8 <= p2))))))
lola: processed formula length: 67
lola: 82 rewrites
lola: closed formula file LTLCardinality.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: 87 markings, 88 edges
lola: ========================================
lola: subprocess 7 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G (((1 <= p6) AND (p5 <= p2))) AND F ((p1 <= p5)))) AND (p5 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p5 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 <= p2)
lola: processed formula length: 10
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 8 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p6) AND (p5 <= p2))) AND F ((p1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p6) AND (p5 <= p2))) AND F ((p1 <= p5))))
lola: processed formula length: 55
lola: 82 rewrites
lola: closed formula file LTLCardinality.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: 88 markings, 88 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p4))
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: (p4 <= 1)
lola: processed formula length: 9
lola: 84 rewrites
lola: closed formula file LTLCardinality.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: 90 markings, 90 edges
lola: ========================================
lola: subprocess 9 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p5))
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: (p5 <= 0)
lola: processed formula length: 9
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 5611 markings, 7760 edges
lola: ========================================
lola: subprocess 10 will run for 1070 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (F ((1 <= p3))) OR (p7 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F ((1 <= p3))) OR (p7 <= p6))))
lola: processed formula length: 41
lola: 82 rewrites
lola: closed formula file LTLCardinality.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: 3012785 markings, 7742401 edges, 602557 markings/sec, 0 secs
lola: 5136905 markings, 14755482 edges, 424824 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5597005 markings, 16687815 edges
lola: ========================================
lola: subprocess 11 will run for 1600 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p7 <= p2) OR (p6 <= p0))) AND (1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p7 <= p2) OR (p6 <= p0))) AND (1 <= p0))))
lola: processed formula length: 55
lola: 82 rewrites
lola: closed formula file LTLCardinality.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: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
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: 323 markings, 557 edges
lola: ========================================
lola: subprocess 12 will run for 3200 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p0 <= 2))) AND (F (((p3 + 1 <= p8) OR G ((p0 <= 2)))) AND (p0 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3200 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 <= 2)
lola: processed formula length: 9
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p3 + 1 <= p8) OR G ((p0 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((p3 + 1 <= p8) OR G ((p0 <= 2))))
lola: processed formula length: 37
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((X (G ((p7 <= 1))) OR (F (G ((p1 + 1 <= p8))) OR (p1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G ((p7 <= 1))) OR (F (G ((p1 + 1 <= p8))) OR (p1 <= 0)))))
lola: processed formula length: 68
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2226229 markings, 7264967 edges, 445246 markings/sec, 0 secs
lola: 4069690 markings, 13573688 edges, 368692 markings/sec, 5 secs
lola: 5798130 markings, 19564070 edges, 345688 markings/sec, 10 secs
lola: 7481276 markings, 25440936 edges, 336629 markings/sec, 15 secs
lola: 9117924 markings, 31183881 edges, 327330 markings/sec, 20 secs
lola: 10706702 markings, 36786940 edges, 317756 markings/sec, 25 secs
lola: 12273743 markings, 42326422 edges, 313408 markings/sec, 30 secs
lola: 13817410 markings, 47803926 edges, 308733 markings/sec, 35 secs
lola: 15358754 markings, 53289733 edges, 308269 markings/sec, 40 secs
lola: 16891147 markings, 58752231 edges, 306479 markings/sec, 45 secs
lola: 18393501 markings, 64122561 edges, 300471 markings/sec, 50 secs
lola: 19909895 markings, 69553953 edges, 303279 markings/sec, 55 secs
lola: 21416265 markings, 74954741 edges, 301274 markings/sec, 60 secs
lola: 22900853 markings, 80292247 edges, 296918 markings/sec, 65 secs
lola: 24356800 markings, 85544071 edges, 291189 markings/sec, 70 secs
lola: 25818435 markings, 90809893 edges, 292327 markings/sec, 75 secs
lola: 27262670 markings, 96026383 edges, 288847 markings/sec, 80 secs
lola: 28702207 markings, 101234181 edges, 287907 markings/sec, 85 secs
lola: 30137474 markings, 106428361 edges, 287053 markings/sec, 90 secs
lola: 31562457 markings, 111593447 edges, 284997 markings/sec, 95 secs
lola: 32987695 markings, 116759482 edges, 285048 markings/sec, 100 secs
lola: 34412902 markings, 121932838 edges, 285041 markings/sec, 105 secs
lola: 35841803 markings, 127127539 edges, 285780 markings/sec, 110 secs
lola: 37270591 markings, 132325112 edges, 285758 markings/sec, 115 secs
lola: 38677056 markings, 137441193 edges, 281293 markings/sec, 120 secs
lola: 40078658 markings, 142552132 edges, 280320 markings/sec, 125 secs
lola: 41503169 markings, 147734315 edges, 284902 markings/sec, 130 secs
lola: 42897118 markings, 152819073 edges, 278790 markings/sec, 135 secs
lola: 44307308 markings, 157971192 edges, 282038 markings/sec, 140 secs
lola: 45697200 markings, 163041859 edges, 277978 markings/sec, 145 secs
lola: 47066269 markings, 168053063 edges, 273814 markings/sec, 150 secs
lola: 48453823 markings, 173122921 edges, 277511 markings/sec, 155 secs
lola: 49827687 markings, 178143585 edges, 274773 markings/sec, 160 secs
lola: 51185505 markings, 183116780 edges, 271564 markings/sec, 165 secs
lola: 52544083 markings, 188093380 edges, 271716 markings/sec, 170 secs
lola: 53896546 markings, 193049189 edges, 270493 markings/sec, 175 secs
lola: 55243663 markings, 197992195 edges, 269423 markings/sec, 180 secs
lola: 56591996 markings, 202934120 edges, 269667 markings/sec, 185 secs
lola: 57938776 markings, 207872053 edges, 269356 markings/sec, 190 secs
lola: 59284174 markings, 212812704 edges, 269080 markings/sec, 195 secs
lola: 60627294 markings, 217744425 edges, 268624 markings/sec, 200 secs
lola: 61962830 markings, 222655622 edges, 267107 markings/sec, 205 secs
lola: 63298105 markings, 227567449 edges, 267055 markings/sec, 210 secs
lola: 64630094 markings, 232465230 edges, 266398 markings/sec, 215 secs
lola: 65959677 markings, 237365941 edges, 265917 markings/sec, 220 secs
lola: 67285361 markings, 242248075 edges, 265137 markings/sec, 225 secs
lola: 68623111 markings, 247172962 edges, 267550 markings/sec, 230 secs
lola: 69953638 markings, 252083837 edges, 266105 markings/sec, 235 secs
lola: 71274296 markings, 256949283 edges, 264132 markings/sec, 240 secs
lola: 72591712 markings, 261801844 edges, 263483 markings/sec, 245 secs
lola: 73906500 markings, 266657643 edges, 262958 markings/sec, 250 secs
lola: 75227704 markings, 271536337 edges, 264241 markings/sec, 255 secs
lola: 76541195 markings, 276377202 edges, 262698 markings/sec, 260 secs
lola: 77852802 markings, 281213255 edges, 262321 markings/sec, 265 secs
lola: 79158902 markings, 286044269 edges, 261220 markings/sec, 270 secs
lola: 80461314 markings, 290853630 edges, 260482 markings/sec, 275 secs
lola: 81765814 markings, 295673288 edges, 260900 markings/sec, 280 secs
lola: 83065217 markings, 300479461 edges, 259881 markings/sec, 285 secs
lola: 84366082 markings, 305284645 edges, 260173 markings/sec, 290 secs
lola: 85661372 markings, 310072365 edges, 259058 markings/sec, 295 secs
lola: 86955679 markings, 314868073 edges, 258861 markings/sec, 300 secs
lola: 88250423 markings, 319661328 edges, 258949 markings/sec, 305 secs
lola: 89516125 markings, 324351443 edges, 253140 markings/sec, 310 secs
lola: 90625395 markings, 328447907 edges, 221854 markings/sec, 315 secs
lola: 91786747 markings, 332746418 edges, 232270 markings/sec, 320 secs
lola: 92927513 markings, 336968670 edges, 228153 markings/sec, 325 secs
lola: 94059978 markings, 341154155 edges, 226493 markings/sec, 330 secs
lola: 95162351 markings, 345233537 edges, 220475 markings/sec, 335 secs
lola: 96257155 markings, 349289961 edges, 218961 markings/sec, 340 secs
lola: 97503010 markings, 353914288 edges, 249171 markings/sec, 345 secs
lola: 98609864 markings, 358001616 edges, 221371 markings/sec, 350 secs
lola: 99748924 markings, 362221443 edges, 227812 markings/sec, 355 secs
lola: 100621606 markings, 365460103 edges, 174536 markings/sec, 360 secs
lola: 101055948 markings, 367063436 edges, 86868 markings/sec, 365 secs
lola: 101055948 markings, 367063436 edges, 0 markings/sec, 370 secs
lola: 101055948 markings, 367063436 edges, 0 markings/sec, 375 secs
lola: 101055948 markings, 367063436 edges, 0 markings/sec, 380 secs
lola: 101055948 markings, 367063436 edges, 0 markings/sec, 385 secs
lola: 101055948 markings, 367063436 edges, 0 markings/sec, 390 secs
lola: 101055948 markings, 367063436 edges, 0 markings/sec, 395 secs
lola: 101055948 markings, 367063436 edges, 0 markings/sec, 400 secs
lola: add low 5
lola: add low 6
lola: add low 3
lola: 101055948 markings, 367063436 edges, 0 markings/sec, 405 secs
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: 101055948 markings, 367063436 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G ((p0 <= 2))) AND (F (((p3 + 1 <= p8) OR G ((p0 <= 2)))) AND (p0 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p0 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 <= 2)
lola: processed formula length: 9
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: F (G ((p0 <= 2)))
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 ((p0 <= 2)))
lola: processed formula length: 17
lola: 82 rewrites
lola: closed formula file LTLCardinality.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: 87 markings, 88 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes no no no yes no no no no
lola:
preliminary result: no yes no yes yes no no no yes no no no no
lola: memory consumption: 3228 KB
lola: time consumption: 785 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="SwimmingPool-PT-04"
export BK_EXAMINATION="LTLCardinality"
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 SwimmingPool-PT-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-162106800700369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-04.tgz
mv SwimmingPool-PT-04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;