About the Execution of 2020-gold for SwimmingPool-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16255.983 | 3600000.00 | 1020948.00 | 34087.80 | TFTFTFFFFFF?FFTF | 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-162106800700385.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-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800700385
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K 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.9K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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-08-00
FORMULA_NAME SwimmingPool-PT-08-01
FORMULA_NAME SwimmingPool-PT-08-02
FORMULA_NAME SwimmingPool-PT-08-03
FORMULA_NAME SwimmingPool-PT-08-04
FORMULA_NAME SwimmingPool-PT-08-05
FORMULA_NAME SwimmingPool-PT-08-06
FORMULA_NAME SwimmingPool-PT-08-07
FORMULA_NAME SwimmingPool-PT-08-08
FORMULA_NAME SwimmingPool-PT-08-09
FORMULA_NAME SwimmingPool-PT-08-10
FORMULA_NAME SwimmingPool-PT-08-11
FORMULA_NAME SwimmingPool-PT-08-12
FORMULA_NAME SwimmingPool-PT-08-13
FORMULA_NAME SwimmingPool-PT-08-14
FORMULA_NAME SwimmingPool-PT-08-15
=== Now, execution of the tool begins
BK_START 1621227033073
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 04:50:34] [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:50:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:50:34] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-17 04:50:34] [INFO ] Transformed 9 places.
[2021-05-17 04:50:34] [INFO ] Transformed 7 transitions.
[2021-05-17 04:50:34] [INFO ] Parsed PT model containing 9 places and 7 transitions in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100075 steps, including 0 resets, run finished after 57 ms. (steps per millisecond=1755 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 04:50:34] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 04:50:34] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-17 04:50:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:50:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-17 04:50:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:50:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned unsat
[2021-05-17 04:50:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-17 04:50:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-17 04:50:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2021-05-17 04:50:35] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-17 04:50:35] [INFO ] Flatten gal took : 20 ms
FORMULA SwimmingPool-PT-08-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-08-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-08-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-08-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-08-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:50:35] [INFO ] Flatten gal took : 4 ms
[2021-05-17 04:50:35] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-17 04:50:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SwimmingPool-PT-08 @ 3570 seconds
FORMULA SwimmingPool-PT-08-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-08-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-08-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-08-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-08-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-08-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-08-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-08-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-08-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-08-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-08-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2519
rslt: Output for LTLCardinality @ SwimmingPool-PT-08
{
"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:50:37 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": "(p8 <= 2)",
"processed_size": 9,
"rewrites": 97
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p5 <= p2))",
"processed_size": 14,
"rewrites": 97
},
"result":
{
"edges": 572,
"markings": 572,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((X (F ((p7 <= p8))) U (p6 <= p5)) AND X (F ((p7 <= p8)))))",
"processed_size": 62,
"rewrites": 97
},
"result":
{
"edges": 4431,
"markings": 4175,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "X (F ((p1 + 1 <= p6)))",
"processed_size": 22,
"rewrites": 97
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((X ((p0 <= p2)) OR ((p0 <= p2) OR (p5 <= p6)))))",
"processed_size": 54,
"rewrites": 97
},
"result":
{
"edges": 188,
"markings": 187,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((X (((1 <= p6) R (p0 + 1 <= p1))) AND (F ((p1 <= p0)) OR (p2 <= p6)))))",
"processed_size": 77,
"rewrites": 97
},
"result":
{
"edges": 167,
"markings": 167,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((X ((p1 <= 0)) R F (((p8 + 1 <= p4) OR G ((p8 <= 2)))))))",
"processed_size": 63,
"rewrites": 97
},
"result":
{
"edges": 166,
"markings": 166,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"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": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G (F ((F ((p6 <= p3)) AND (p5 <= 0)))) AND (p5 <= 0)))",
"processed_size": 58,
"rewrites": 97
},
"result":
{
"edges": 13213,
"markings": 10050,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"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": 5,
"visible_transitions": 0
},
"processed": "X ((F ((p1 <= p7)) AND F ((((p2 + 1 <= p6) U (p6 <= p2)) AND X (((1 <= p0) U G ((1 <= p0))))))))",
"processed_size": 96,
"rewrites": 97
},
"result":
{
"edges": 5621,
"markings": 3080,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1520
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p2 + 1 <= p6) R X (X (G ((X ((p6 <= p2)) OR (p6 <= p3)))))) U X (G ((p6 <= p2))))",
"processed_size": 84,
"rewrites": 97
},
"result":
{
"edges": 166,
"markings": 166,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 9,
"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": 3040
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X ((F (G ((p0 <= p2))) AND G ((X ((p6 <= p0)) OR G ((p0 <= p2)))))) AND (p2 + 1 <= p7)))",
"processed_size": 92,
"rewrites": 97
},
"result":
{
"edges": 166,
"markings": 166,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3260,
"runtime": 1051.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(**) AND (X((* R X(*))) OR **)) : X(((X(F(**)) U **) AND X(F(**)))) : (X(F(*)) OR F((X(G(**)) AND **))) : G(F((X(**) OR (* OR *)))) : X(X((X((** R *)) AND (F(**) OR *)))) : G(F((X(*) R F((* OR G(*)))))) : X((G(F((F(**) AND *))) AND *)) : X((F(**) AND F(((** U **) AND X((** U G(**))))))) : X((F((G(**) OR *)) AND F(**))) : ((* R X(X(G((X(**) OR **))))) U X(G(**))) : G((X((F(G(**)) AND G((X(**) OR G(**))))) AND **))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no no yes no no no no no unknown no no ",
"value": "no no yes no no no no no unknown 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 ((p5 <= p2)) AND (NOT(X (((p6 <= p2) U X (((3 <= p8) AND (p5 <= p2)))))) OR (p8 <= 2))) : ((F (X (X ((p7 <= p8)))) U X ((p6 <= p5))) AND X (X (F ((p7 <= p8))))) : (NOT(G (X ((p6 <= p1)))) OR F ((X (G ((p6 <= p1))) AND (p0 <= p3)))) : X (NOT(F (((p7 <= p6) U G (((NOT(X ((p0 <= p2))) AND (p2 + 1 <= p0)) AND (p6 + 1 <= p5))))))) : X (NOT(X (((NOT(X ((1 <= p6))) U X ((p1 <= p0))) OR (NOT(F ((p1 <= p0))) AND (p6 + 1 <= p2)))))) : G (F (NOT(X ((X ((1 <= p1)) U (G ((p4 <= p8)) AND G (F (((1 <= p1) U (3 <= p8)))))))))) : NOT(X ((F (G ((NOT(F ((p6 <= p3))) OR (1 <= p5)))) OR (1 <= p5)))) : X ((F ((p1 <= p7)) AND F ((((p2 + 1 <= p6) U (p6 <= p2)) AND X (((1 <= p0) U G ((1 <= p0)))))))) : (X (NOT(G ((NOT(G ((p8 <= p3))) AND (2 <= p4))))) AND (X ((3 <= p0)) U X (F ((1 <= p5))))) : (NOT(((p6 <= p2) U X (X (NOT(G ((X ((p6 <= p2)) OR (p6 <= p3)))))))) U G (X ((p6 <= p2)))) : G ((G ((X (X ((p6 <= p0))) U X (G (((1 <= 0) U (p0 <= p2)))))) AND (p2 + 1 <= p7)))
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:318
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:329
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:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p5 <= p2)) AND (X (((p2 + 1 <= p6) R X (((p8 <= 2) OR (p2 + 1 <= p5))))) OR (p8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p8 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p8 <= 2)
lola: processed formula length: 9
lola: 97 rewrites
lola: closed formula file LTLCardinality.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 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p5 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= p2))
lola: processed formula length: 14
lola: 97 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: 572 markings, 572 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (F ((p7 <= p8))) U (p6 <= p5)) AND X (F ((p7 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (F ((p7 <= p8))) U (p6 <= p5)) AND X (F ((p7 <= p8)))))
lola: processed formula length: 62
lola: 97 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: 4175 markings, 4431 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p1 + 1 <= p6))) OR F ((X (G ((p6 <= p1))) AND (p0 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p1 + 1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p1 + 1 <= p6)))
lola: processed formula length: 22
lola: 97 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((p0 <= p2)) OR ((p0 <= p2) OR (p5 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((p0 <= p2)) OR ((p0 <= p2) OR (p5 <= p6)))))
lola: processed formula length: 54
lola: 97 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: 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: 187 markings, 188 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (((1 <= p6) R (p0 + 1 <= p1))) AND (F ((p1 <= p0)) OR (p2 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (((1 <= p6) R (p0 + 1 <= p1))) AND (F ((p1 <= p0)) OR (p2 <= p6)))))
lola: processed formula length: 77
lola: 97 rewrites
lola: closed formula file LTLCardinality.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: 167 markings, 167 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((p1 <= 0)) R F (((p8 + 1 <= p4) OR G ((p8 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((p1 <= 0)) R F (((p8 + 1 <= p4) OR G ((p8 <= 2)))))))
lola: processed formula length: 63
lola: 97 rewrites
lola: closed formula file LTLCardinality.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: 166 markings, 166 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F ((F ((p6 <= p3)) AND (p5 <= 0)))) AND (p5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((F ((p6 <= p3)) AND (p5 <= 0)))) AND (p5 <= 0)))
lola: processed formula length: 58
lola: 97 rewrites
lola: closed formula file LTLCardinality.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: 10050 markings, 13213 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p1 <= p7)) AND F ((((p2 + 1 <= p6) U (p6 <= p2)) AND X (((1 <= p0) U G ((1 <= p0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p1 <= p7)) AND F ((((p2 + 1 <= p6) U (p6 <= p2)) AND X (((1 <= p0) U G ((1 <= p0))))))))
lola: processed formula length: 96
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3080 markings, 5621 edges
lola: ========================================
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((G ((p8 <= p3)) OR (p4 <= 1))) AND F ((1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((G ((p8 <= p3)) OR (p4 <= 1))) AND F ((1 <= p5))))
lola: processed formula length: 57
lola: 97 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: 3188740 markings, 7591419 edges, 637748 markings/sec, 0 secs
lola: 5915840 markings, 14199356 edges, 545420 markings/sec, 5 secs
lola: 8697120 markings, 20963646 edges, 556256 markings/sec, 10 secs
lola: 11418565 markings, 27599230 edges, 544289 markings/sec, 15 secs
lola: 14074458 markings, 34143405 edges, 531179 markings/sec, 20 secs
lola: 16177708 markings, 40431025 edges, 420650 markings/sec, 25 secs
lola: 18121349 markings, 46087747 edges, 388728 markings/sec, 30 secs
lola: 19958970 markings, 51459893 edges, 367524 markings/sec, 35 secs
lola: 21741470 markings, 56683843 edges, 356500 markings/sec, 40 secs
lola: 23464836 markings, 61743373 edges, 344673 markings/sec, 45 secs
lola: 25118597 markings, 66601006 edges, 330752 markings/sec, 50 secs
lola: 26767734 markings, 71452076 edges, 329827 markings/sec, 55 secs
lola: 28393513 markings, 76326229 edges, 325156 markings/sec, 60 secs
lola: 30181188 markings, 81946673 edges, 357535 markings/sec, 65 secs
lola: 31928765 markings, 87028297 edges, 349515 markings/sec, 70 secs
lola: 33579739 markings, 91849842 edges, 330195 markings/sec, 75 secs
lola: 35163641 markings, 96488001 edges, 316780 markings/sec, 80 secs
lola: 36693219 markings, 100974533 edges, 305916 markings/sec, 85 secs
lola: 38203835 markings, 105408826 edges, 302123 markings/sec, 90 secs
lola: 39696624 markings, 109797067 edges, 298558 markings/sec, 95 secs
lola: 41189087 markings, 114186664 edges, 298493 markings/sec, 100 secs
lola: 42663999 markings, 118581749 edges, 294982 markings/sec, 105 secs
lola: 44264604 markings, 123694414 edges, 320121 markings/sec, 110 secs
lola: 45942781 markings, 128568273 edges, 335635 markings/sec, 115 secs
lola: 47532749 markings, 133209215 edges, 317994 markings/sec, 120 secs
lola: 49048523 markings, 137645821 edges, 303155 markings/sec, 125 secs
lola: 50506961 markings, 141922174 edges, 291688 markings/sec, 130 secs
lola: 51936526 markings, 146116514 edges, 285913 markings/sec, 135 secs
lola: 53344049 markings, 150252715 edges, 281505 markings/sec, 140 secs
lola: 54738404 markings, 154351785 edges, 278871 markings/sec, 145 secs
lola: 56116071 markings, 158408442 edges, 275533 markings/sec, 150 secs
lola: 57395811 markings, 162714310 edges, 255948 markings/sec, 155 secs
lola: 59132239 markings, 167710434 edges, 347286 markings/sec, 160 secs
lola: 60717833 markings, 172324943 edges, 317119 markings/sec, 165 secs
lola: 62202903 markings, 176666700 edges, 297014 markings/sec, 170 secs
lola: 63641779 markings, 180879284 edges, 287775 markings/sec, 175 secs
lola: 65046101 markings, 184997307 edges, 280864 markings/sec, 180 secs
lola: 66387890 markings, 188937805 edges, 268358 markings/sec, 185 secs
lola: 67748885 markings, 192937135 edges, 272199 markings/sec, 190 secs
lola: 69110629 markings, 196940663 edges, 272349 markings/sec, 195 secs
lola: 70429491 markings, 200823588 edges, 263772 markings/sec, 200 secs
lola: 71683155 markings, 205043123 edges, 250733 markings/sec, 205 secs
lola: 73380371 markings, 209930542 edges, 339443 markings/sec, 210 secs
lola: 74926041 markings, 214431201 edges, 309134 markings/sec, 215 secs
lola: 76378681 markings, 218675263 edges, 290528 markings/sec, 220 secs
lola: 77765866 markings, 222735524 edges, 277437 markings/sec, 225 secs
lola: 79093917 markings, 226628961 edges, 265610 markings/sec, 230 secs
lola: 80415975 markings, 230510962 edges, 264412 markings/sec, 235 secs
lola: 81740258 markings, 234401729 edges, 264857 markings/sec, 240 secs
lola: 83024962 markings, 238182237 edges, 256941 markings/sec, 245 secs
lola: 84349477 markings, 242077235 edges, 264903 markings/sec, 250 secs
lola: 85524682 markings, 245925595 edges, 235041 markings/sec, 255 secs
lola: 87174999 markings, 250833408 edges, 330063 markings/sec, 260 secs
lola: 88740026 markings, 255381810 edges, 313005 markings/sec, 265 secs
lola: 90212052 markings, 259680758 edges, 294405 markings/sec, 270 secs
lola: 91625388 markings, 263816796 edges, 282667 markings/sec, 275 secs
lola: 93011543 markings, 267880365 edges, 277231 markings/sec, 280 secs
lola: 94338987 markings, 271778080 edges, 265489 markings/sec, 285 secs
lola: 95645084 markings, 275615309 edges, 261219 markings/sec, 290 secs
lola: 96951926 markings, 279456381 edges, 261368 markings/sec, 295 secs
lola: 98265917 markings, 283324513 edges, 262798 markings/sec, 300 secs
lola: 99539466 markings, 287162645 edges, 254710 markings/sec, 305 secs
lola: 100989130 markings, 291792791 edges, 289933 markings/sec, 310 secs
lola: 102560598 markings, 296353662 edges, 314294 markings/sec, 315 secs
lola: 104022049 markings, 300616679 edges, 292290 markings/sec, 320 secs
lola: 105436105 markings, 304753583 edges, 282811 markings/sec, 325 secs
lola: 106796504 markings, 308740713 edges, 272080 markings/sec, 330 secs
lola: 108113603 markings, 312607262 edges, 263420 markings/sec, 335 secs
lola: 109398004 markings, 316380129 edges, 256880 markings/sec, 340 secs
lola: 110684544 markings, 320160996 edges, 257308 markings/sec, 345 secs
lola: 112007768 markings, 324051027 edges, 264645 markings/sec, 350 secs
lola: 113288923 markings, 327823894 edges, 256231 markings/sec, 355 secs
lola: 114652600 markings, 332320161 edges, 272735 markings/sec, 360 secs
lola: 116234331 markings, 336897349 edges, 316346 markings/sec, 365 secs
lola: 117705860 markings, 341184759 edges, 294306 markings/sec, 370 secs
lola: 119105666 markings, 345278224 edges, 279961 markings/sec, 375 secs
lola: 120090564 markings, 348163353 edges, 196980 markings/sec, 380 secs
lola: 121162119 markings, 351305531 edges, 214311 markings/sec, 385 secs
lola: 122336856 markings, 354749614 edges, 234947 markings/sec, 390 secs
lola: 123439100 markings, 357989607 edges, 220449 markings/sec, 395 secs
lola: 124501947 markings, 361114922 edges, 212569 markings/sec, 400 secs
lola: 125319795 markings, 363518778 edges, 163570 markings/sec, 405 secs
lola: 126175240 markings, 366033775 edges, 171089 markings/sec, 410 secs
lola: 127490874 markings, 369908330 edges, 263127 markings/sec, 415 secs
lola: 127977341 markings, 371852862 edges, 97293 markings/sec, 420 secs
lola: 129334864 markings, 375778737 edges, 271505 markings/sec, 425 secs
lola: 130333513 markings, 378676125 edges, 199730 markings/sec, 430 secs
lola: 131488386 markings, 382040988 edges, 230975 markings/sec, 435 secs
lola: 132545670 markings, 385128036 edges, 211457 markings/sec, 440 secs
lola: 133537600 markings, 388032153 edges, 198386 markings/sec, 445 secs
lola: 134514679 markings, 390894980 edges, 195416 markings/sec, 450 secs
lola: 135604417 markings, 394091507 edges, 217948 markings/sec, 455 secs
lola: 136765551 markings, 397500199 edges, 232227 markings/sec, 460 secs
lola: 137529700 markings, 399744320 edges, 152830 markings/sec, 465 secs
lola: 138427179 markings, 402382185 edges, 179496 markings/sec, 470 secs
lola: 139419370 markings, 405300251 edges, 198438 markings/sec, 475 secs
lola: 140474704 markings, 408405482 edges, 211067 markings/sec, 480 secs
lola: 141634312 markings, 411819368 edges, 231922 markings/sec, 485 secs
lola: 142444840 markings, 414710087 edges, 162106 markings/sec, 490 secs
lola: 143924411 markings, 418975380 edges, 295914 markings/sec, 495 secs
lola: 145241165 markings, 422806300 edges, 263351 markings/sec, 500 secs
lola: 146659240 markings, 426948068 edges, 283615 markings/sec, 505 secs
lola: 147948773 markings, 430720843 edges, 257907 markings/sec, 510 secs
lola: 148898176 markings, 433506613 edges, 189881 markings/sec, 515 secs
lola: 149269055 markings, 434595236 edges, 74176 markings/sec, 520 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p2 + 1 <= p6) R X (X (G ((X ((p6 <= p2)) OR (p6 <= p3)))))) U X (G ((p6 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p2 + 1 <= p6) R X (X (G ((X ((p6 <= p2)) OR (p6 <= p3)))))) U X (G ((p6 <= p2))))
lola: processed formula length: 84
lola: 97 rewrites
lola: closed formula file LTLCardinality.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: 166 markings, 166 edges
lola: ========================================
lola: subprocess 10 will run for 3040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((F (G ((p0 <= p2))) AND G ((X ((p6 <= p0)) OR G ((p0 <= p2)))))) AND (p2 + 1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((F (G ((p0 <= p2))) AND G ((X ((p6 <= p0)) OR G ((p0 <= p2)))))) AND (p2 + 1 <= p7)))
lola: processed formula length: 92
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 166 markings, 166 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((F ((G ((p8 <= p3)) OR (p4 <= 1))) AND F ((1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((G ((p8 <= p3)) OR (p4 <= 1))) AND F ((1 <= p5))))
lola: processed formula length: 57
lola: 97 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: 3195750 markings, 7608385 edges, 639150 markings/sec, 0 secs
lola: 6099001 markings, 14642960 edges, 580650 markings/sec, 5 secs
lola: 8900594 markings, 21461144 edges, 560319 markings/sec, 10 secs
lola: 11637224 markings, 28135144 edges, 547326 markings/sec, 15 secs
lola: 14219745 markings, 34711375 edges, 516504 markings/sec, 20 secs
lola: 16366598 markings, 40979766 edges, 429371 markings/sec, 25 secs
lola: 18311503 markings, 46642875 edges, 388981 markings/sec, 30 secs
lola: 20169692 markings, 52078887 edges, 371638 markings/sec, 35 secs
lola: 21953017 markings, 57306655 edges, 356665 markings/sec, 40 secs
lola: 23680914 markings, 62379939 edges, 345579 markings/sec, 45 secs
lola: 25389789 markings, 67400814 edges, 341775 markings/sec, 50 secs
lola: 27086958 markings, 72394198 edges, 339434 markings/sec, 55 secs
lola: 28628563 markings, 77479499 edges, 308321 markings/sec, 60 secs
lola: 30559713 markings, 83043423 edges, 386230 markings/sec, 65 secs
lola: 32260197 markings, 87993981 edges, 340097 markings/sec, 70 secs
lola: 33873332 markings, 92708806 edges, 322627 markings/sec, 75 secs
lola: 35429643 markings, 97266846 edges, 311262 markings/sec, 80 secs
lola: 36933756 markings, 101679107 edges, 300823 markings/sec, 85 secs
lola: 38406575 markings, 106006329 edges, 294564 markings/sec, 90 secs
lola: 39933541 markings, 110491115 edges, 305393 markings/sec, 95 secs
lola: 41463409 markings, 114996171 edges, 305974 markings/sec, 100 secs
lola: 42868661 markings, 119586307 edges, 281050 markings/sec, 105 secs
lola: 44683241 markings, 124907262 edges, 362916 markings/sec, 110 secs
lola: 46348856 markings, 129752006 edges, 333123 markings/sec, 115 secs
lola: 47936678 markings, 134391773 edges, 317564 markings/sec, 120 secs
lola: 49472353 markings, 138888687 edges, 307135 markings/sec, 125 secs
lola: 50956771 markings, 143242617 edges, 296884 markings/sec, 130 secs
lola: 52400173 markings, 147478713 edges, 288680 markings/sec, 135 secs
lola: 53798189 markings, 151587573 edges, 279603 markings/sec, 140 secs
lola: 55214897 markings, 155753486 edges, 283342 markings/sec, 145 secs
lola: 56651125 markings, 159983190 edges, 287246 markings/sec, 150 secs
lola: 58122533 markings, 164790180 edges, 294282 markings/sec, 155 secs
lola: 59766499 markings, 169553421 edges, 328793 markings/sec, 160 secs
lola: 61335291 markings, 174129402 edges, 313758 markings/sec, 165 secs
lola: 62879815 markings, 178645807 edges, 308905 markings/sec, 170 secs
lola: 64344988 markings, 182940823 edges, 293035 markings/sec, 175 secs
lola: 65759979 markings, 187091725 edges, 282998 markings/sec, 180 secs
lola: 67159189 markings, 191202949 edges, 279842 markings/sec, 185 secs
lola: 68511134 markings, 195176337 edges, 270389 markings/sec, 190 secs
lola: 69863252 markings, 199157061 edges, 270424 markings/sec, 195 secs
lola: 71216131 markings, 203311910 edges, 270576 markings/sec, 200 secs
lola: 72772494 markings, 208169794 edges, 311273 markings/sec, 205 secs
lola: 74400377 markings, 212897284 edges, 325577 markings/sec, 210 secs
lola: 75936851 markings, 217381174 edges, 307295 markings/sec, 215 secs
lola: 77407937 markings, 221686483 edges, 294217 markings/sec, 220 secs
lola: 78841474 markings, 225889461 edges, 286707 markings/sec, 225 secs
lola: 80216618 markings, 229927569 edges, 275029 markings/sec, 230 secs
lola: 81612710 markings, 234030025 edges, 279218 markings/sec, 235 secs
lola: 82947122 markings, 237952618 edges, 266882 markings/sec, 240 secs
lola: 84305658 markings, 241947675 edges, 271707 markings/sec, 245 secs
lola: 85510408 markings, 245855532 edges, 240950 markings/sec, 250 secs
lola: 87148570 markings, 250756403 edges, 327632 markings/sec, 255 secs
lola: 88722909 markings, 255331768 edges, 314868 markings/sec, 260 secs
lola: 90231706 markings, 259738373 edges, 301759 markings/sec, 265 secs
lola: 91661692 markings, 263923491 edges, 285997 markings/sec, 270 secs
lola: 93030490 markings, 267936256 edges, 273760 markings/sec, 275 secs
lola: 94351905 markings, 271816194 edges, 264283 markings/sec, 280 secs
lola: 95625905 markings, 275558666 edges, 254800 markings/sec, 285 secs
lola: 96902384 markings, 279310040 edges, 255296 markings/sec, 290 secs
lola: 98203529 markings, 283140415 edges, 260229 markings/sec, 295 secs
lola: 99484420 markings, 286912237 edges, 256178 markings/sec, 300 secs
lola: 100906193 markings, 291553741 edges, 284355 markings/sec, 305 secs
lola: 102472818 markings, 296099077 edges, 313325 markings/sec, 310 secs
lola: 103972434 markings, 300473892 edges, 299923 markings/sec, 315 secs
lola: 105413362 markings, 304686680 edges, 288186 markings/sec, 320 secs
lola: 106742181 markings, 308580859 edges, 265764 markings/sec, 325 secs
lola: 108055623 markings, 312436564 edges, 262688 markings/sec, 330 secs
lola: 109350012 markings, 316238698 edges, 258878 markings/sec, 335 secs
lola: 110621512 markings, 319975002 edges, 254300 markings/sec, 340 secs
lola: 111896740 markings, 323728171 edges, 255046 markings/sec, 345 secs
lola: 113172900 markings, 327481051 edges, 255232 markings/sec, 350 secs
lola: 114419520 markings, 331651682 edges, 249324 markings/sec, 355 secs
lola: 116036533 markings, 336321997 edges, 323403 markings/sec, 360 secs
lola: 117534620 markings, 340685511 edges, 299617 markings/sec, 365 secs
lola: 118902701 markings, 344684973 edges, 273616 markings/sec, 370 secs
lola: 120079623 markings, 348131711 edges, 235384 markings/sec, 375 secs
lola: 121281918 markings, 351655297 edges, 240459 markings/sec, 380 secs
lola: 122391624 markings, 354910872 edges, 221941 markings/sec, 385 secs
lola: 123395061 markings, 357859993 edges, 200687 markings/sec, 390 secs
lola: 124552456 markings, 361259670 edges, 231479 markings/sec, 395 secs
lola: 125793188 markings, 364911150 edges, 248146 markings/sec, 400 secs
lola: 126866951 markings, 368071092 edges, 214753 markings/sec, 405 secs
lola: 127911236 markings, 371528694 edges, 208857 markings/sec, 410 secs
lola: 129466002 markings, 376158302 edges, 310953 markings/sec, 415 secs
lola: 130583168 markings, 379401278 edges, 223433 markings/sec, 420 secs
lola: 131724532 markings, 382729391 edges, 228273 markings/sec, 425 secs
lola: 132793875 markings, 385853635 edges, 213869 markings/sec, 430 secs
lola: 133984165 markings, 389338423 edges, 238058 markings/sec, 435 secs
lola: 135065578 markings, 392509277 edges, 216283 markings/sec, 440 secs
lola: 136119790 markings, 395601886 edges, 210842 markings/sec, 445 secs
lola: 137204726 markings, 398790328 edges, 216987 markings/sec, 450 secs
lola: 138193806 markings, 401693698 edges, 197816 markings/sec, 455 secs
lola: 139139392 markings, 404473727 edges, 189117 markings/sec, 460 secs
lola: 140210318 markings, 407624985 edges, 214185 markings/sec, 465 secs
lola: 141005218 markings, 409966742 edges, 158980 markings/sec, 470 secs
lola: 141921698 markings, 412966022 edges, 183296 markings/sec, 475 secs
lola: 143154063 markings, 416744531 edges, 246473 markings/sec, 480 secs
lola: 144490661 markings, 420620257 edges, 267320 markings/sec, 485 secs
lola: 145652579 markings, 424006546 edges, 232384 markings/sec, 490 secs
lola: 146781845 markings, 427304981 edges, 225853 markings/sec, 495 secs
lola: 148005619 markings, 430888186 edges, 244755 markings/sec, 500 secs
lola: 149096181 markings, 434086062 edges, 218112 markings/sec, 505 secs
lola: 149304201 markings, 434694422 edges, 41604 markings/sec, 510 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no yes no no no no no unknown no no
lola:
preliminary result: no no yes no no no no no unknown no no
lola: memory consumption: 3260 KB
lola: time consumption: 1051 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-08"
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-08, 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-162106800700385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-08.tgz
mv SwimmingPool-PT-08 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 ;