About the Execution of 2020-gold for HypercubeGrid-PT-C4K3P3B12
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4437.123 | 3600000.00 | 1251370.00 | 6626.70 | TFFFTFFFFFFTTFFF | 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.r132-tall-162075428200129.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 HypercubeGrid-PT-C4K3P3B12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428200129
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 11:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Mar 22 21:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 21:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 3.0M May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-00
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-01
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-02
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-03
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-04
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-05
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-06
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-07
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-08
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-09
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-10
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-11
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-12
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-13
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-14
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-15
=== Now, execution of the tool begins
BK_START 1620909493949
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 12:38:16] [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-13 12:38:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 12:38:16] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2021-05-13 12:38:16] [INFO ] Transformed 2457 places.
[2021-05-13 12:38:16] [INFO ] Transformed 5400 transitions.
[2021-05-13 12:38:16] [INFO ] Parsed PT model containing 2457 places and 5400 transitions in 400 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1 resets, run finished after 12442 ms. (steps per millisecond=8 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1]
// Phase 1: matrix 5400 rows 2457 cols
[2021-05-13 12:38:29] [INFO ] Computed 946 place invariants in 508 ms
[2021-05-13 12:38:30] [INFO ] [Real]Absence check using 945 positive place invariants in 976 ms returned sat
[2021-05-13 12:38:30] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 59 ms returned sat
[2021-05-13 12:38:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:38:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:38:49] [INFO ] [Real]Absence check using state equation in 18613 ms returned (error "Failed to check-sat")
[2021-05-13 12:38:50] [INFO ] [Real]Absence check using 945 positive place invariants in 618 ms returned unsat
[2021-05-13 12:38:51] [INFO ] [Real]Absence check using 945 positive place invariants in 548 ms returned unsat
[2021-05-13 12:38:51] [INFO ] [Real]Absence check using 945 positive place invariants in 641 ms returned unsat
[2021-05-13 12:38:52] [INFO ] [Real]Absence check using 945 positive place invariants in 656 ms returned unsat
[2021-05-13 12:38:53] [INFO ] [Real]Absence check using 945 positive place invariants in 13 ms returned unsat
[2021-05-13 12:38:53] [INFO ] [Real]Absence check using 945 positive place invariants in 13 ms returned unsat
[2021-05-13 12:38:54] [INFO ] [Real]Absence check using 945 positive place invariants in 720 ms returned unsat
[2021-05-13 12:38:54] [INFO ] [Real]Absence check using 945 positive place invariants in 14 ms returned unsat
[2021-05-13 12:38:55] [INFO ] [Real]Absence check using 945 positive place invariants in 932 ms returned sat
[2021-05-13 12:38:55] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 56 ms returned sat
[2021-05-13 12:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:39:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:39:14] [INFO ] [Real]Absence check using state equation in 18827 ms returned (error "Failed to check-sat")
[2021-05-13 12:39:14] [INFO ] [Real]Absence check using 945 positive place invariants in 269 ms returned unsat
[2021-05-13 12:39:15] [INFO ] [Real]Absence check using 945 positive place invariants in 328 ms returned unsat
[2021-05-13 12:39:15] [INFO ] [Real]Absence check using 945 positive place invariants in 14 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
[2021-05-13 12:39:16] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 12:39:16] [INFO ] Flatten gal took : 522 ms
FORMULA HypercubeGrid-PT-C4K3P3B12-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C4K3P3B12-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C4K3P3B12-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C4K3P3B12-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 12:39:16] [INFO ] Flatten gal took : 265 ms
[2021-05-13 12:39:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-13 12:39:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 50 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ HypercubeGrid-PT-C4K3P3B12 @ 3570 seconds
FORMULA HypercubeGrid-PT-C4K3P3B12-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2397
rslt: Output for LTLCardinality @ HypercubeGrid-PT-C4K3P3B12
{
"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": "Thu May 13 12:39:17 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((1 <= p47) OR ((p2015 <= p94) OR (G ((p776 <= p50)) AND F ((p2015 <= p94))))))",
"processed_size": 82,
"rewrites": 50
},
"result":
{
"edges": 1296,
"markings": 1297,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((p971 <= 0) R (X (X (G ((p277 + 1 <= p2380)))) AND (p971 <= 0)))))",
"processed_size": 73,
"rewrites": 50
},
"result":
{
"edges": 8835,
"markings": 8835,
"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": 353
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 353
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p1064 + 1 <= p2367)",
"processed_size": 20,
"rewrites": 52
},
"result":
{
"edges": 9060,
"markings": 9060,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p2105 <= p2067)))",
"processed_size": 24,
"rewrites": 50
},
"result":
{
"edges": 35471,
"markings": 35467,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((X (X ((X (G (((p2267 <= p246) AND (p2013 <= p728)))) OR (p2267 <= p246)))) AND (p554 <= p1164)))",
"processed_size": 100,
"rewrites": 50
},
"result":
{
"edges": 8835,
"markings": 8835,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 416
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"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": "X (X (X (F ((p205 <= p1249)))))",
"processed_size": 31,
"rewrites": 50
},
"result":
{
"edges": 14067,
"markings": 14067,
"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": 475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((F ((3 <= p486)) AND (3 <= p486))))",
"processed_size": 41,
"rewrites": 50
},
"result":
{
"edges": 59202,
"markings": 53729,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"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": 538
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F (G ((p1063 + 1 <= p1084))) AND (p1063 + 1 <= p1084)))",
"processed_size": 59,
"rewrites": 50
},
"result":
{
"edges": 7659,
"markings": 7659,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 618
},
"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 ((p1878 <= p1690))",
"processed_size": 20,
"rewrites": 50
},
"result":
{
"edges": 66224,
"markings": 59905,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 737
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F ((1 <= p757)) AND (1 <= p1184)))",
"processed_size": 38,
"rewrites": 50
},
"result":
{
"edges": 9016,
"markings": 9016,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 933
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((1 <= p1690)) AND ((p1733 <= p2284) OR (1 <= p1690))))",
"processed_size": 61,
"rewrites": 50
},
"result":
{
"edges": 7871,
"markings": 7871,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p1340 <= p2384) AND (p916 + 1 <= p1785)) U ((p1340 <= p2384) U G ((p1785 <= p916))))",
"processed_size": 87,
"rewrites": 50
},
"result":
{
"edges": 19979,
"markings": 18717,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 2533
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((p1033 + 1 <= p1213)) AND ((p1966 <= p440) OR (p1033 + 1 <= p1213)))))",
"processed_size": 80,
"rewrites": 50
},
"result":
{
"edges": 40144,
"markings": 36637,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 176700,
"runtime": 1173.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((F(**) AND **)) : G((F(**) AND (** OR **))) : X((* OR (** OR (G(**) AND F(**))))) : F(G((F(**) AND (** OR **)))) : X(G((* R (X(X(G(*))) AND *)))) : F(G((F(**) AND **))) : G(**) : (F(**) OR X(F(**))) : F((F(G(*)) AND *)) : X((X(X((X(G(**)) OR **))) AND **)) : (** U (** U G(**))) : X(X(X(F(**))))"
},
"net":
{
"arcs": 21600,
"conflict_clusters": 945,
"places": 2457,
"places_significant": 1511,
"singleton_clusters": 0,
"transitions": 5400
},
"result":
{
"preliminary_value": "no no yes no no no no no no no no no ",
"value": "no no yes no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 7857/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 78624
lola: finding significant places
lola: 2457 places, 5400 transitions, 1511 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: F ((F ((1 <= p757)) AND (1 <= p1184))) : G (((p1733 <= p2284) U (1 <= p1690))) : (NOT(X ((p47 <= 0))) OR X ((G ((p776 <= p50)) U (p2015 <= p94)))) : F (G (((p1966 <= p440) U (p1033 + 1 <= p1213)))) : G (X (G (NOT(((1 <= p971) U (X (((0 <= 0) U X ((p2380 <= p277)))) OR (1 <= p971))))))) : F (G (X ((((p1638 <= p1792) U F (((p529 <= p2133) U (3 <= p486)))) AND (3 <= p486))))) : G ((p1878 <= p1690)) : (F (F ((p2367 <= p1064))) OR X (F ((p2105 <= p2067)))) : NOT(G ((((1 <= 0) U G (X (G (F ((p1084 <= p1063)))))) OR (p1084 <= p1063)))) : X ((X (X ((G (X (((p2267 <= p246) AND (p2013 <= p728)))) OR (p2267 <= p246)))) AND (p554 <= p1164))) : (((p1340 <= p2384) AND (p916 + 1 <= p1785)) U ((p1340 <= p2384) U G ((p1785 <= p916)))) : X (NOT(((1 <= 0) U X (X (((1 <= 0) U NOT(((0 <= 0) U (p205 <= p1249)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:332
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p47) OR ((p2015 <= p94) OR (G ((p776 <= p50)) AND F ((p2015 <= p94))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p47) OR ((p2015 <= p94) OR (G ((p776 <= p50)) AND F ((p2015 <= p94))))))
lola: processed formula length: 82
lola: 50 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1297 markings, 1296 edges
lola: ========================================
lola: subprocess 1 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p971 <= 0) R (X (X (G ((p277 + 1 <= p2380)))) AND (p971 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p971 <= 0) R (X (X (G ((p277 + 1 <= p2380)))) AND (p971 <= 0)))))
lola: processed formula length: 73
lola: 50 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: 8835 markings, 8835 edges
lola: ========================================
lola: subprocess 2 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p2367 <= p1064)) OR X (F ((p2105 <= p2067))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p2367 <= p1064))
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: (p1064 + 1 <= p2367)
lola: processed formula length: 20
lola: 52 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: 2707 markings, 2706 edges, 541 markings/sec, 0 secs
lola: 2740 markings, 2739 edges, 7 markings/sec, 5 secs
lola: 2770 markings, 2769 edges, 6 markings/sec, 10 secs
lola: 4219 markings, 4218 edges, 290 markings/sec, 15 secs
lola: 4249 markings, 4248 edges, 6 markings/sec, 20 secs
lola: 4282 markings, 4281 edges, 7 markings/sec, 25 secs
lola: 4335 markings, 4334 edges, 11 markings/sec, 30 secs
lola: 4383 markings, 4382 edges, 10 markings/sec, 35 secs
lola: 4431 markings, 4430 edges, 10 markings/sec, 40 secs
lola: 4524 markings, 4523 edges, 19 markings/sec, 45 secs
lola: 4650 markings, 4649 edges, 25 markings/sec, 50 secs
lola: 4804 markings, 4803 edges, 31 markings/sec, 55 secs
lola: 4916 markings, 4915 edges, 22 markings/sec, 60 secs
lola: 5022 markings, 5021 edges, 21 markings/sec, 65 secs
lola: 5147 markings, 5146 edges, 25 markings/sec, 70 secs
lola: 5244 markings, 5243 edges, 19 markings/sec, 75 secs
lola: 5324 markings, 5323 edges, 16 markings/sec, 80 secs
lola: 5381 markings, 5380 edges, 11 markings/sec, 85 secs
lola: 5446 markings, 5445 edges, 13 markings/sec, 90 secs
lola: 5525 markings, 5524 edges, 16 markings/sec, 95 secs
lola: 5614 markings, 5613 edges, 18 markings/sec, 100 secs
lola: 5680 markings, 5679 edges, 13 markings/sec, 105 secs
lola: 5748 markings, 5747 edges, 14 markings/sec, 110 secs
lola: 5819 markings, 5818 edges, 14 markings/sec, 115 secs
lola: 5896 markings, 5895 edges, 15 markings/sec, 120 secs
lola: 6017 markings, 6016 edges, 24 markings/sec, 125 secs
lola: 6209 markings, 6208 edges, 38 markings/sec, 130 secs
lola: 6484 markings, 6483 edges, 55 markings/sec, 135 secs
lola: 6720 markings, 6719 edges, 47 markings/sec, 140 secs
lola: 6920 markings, 6919 edges, 40 markings/sec, 145 secs
lola: 7050 markings, 7049 edges, 26 markings/sec, 150 secs
lola: 7190 markings, 7189 edges, 28 markings/sec, 155 secs
lola: 7321 markings, 7320 edges, 26 markings/sec, 160 secs
lola: 7436 markings, 7435 edges, 23 markings/sec, 165 secs
lola: 7563 markings, 7562 edges, 25 markings/sec, 170 secs
lola: 7712 markings, 7711 edges, 30 markings/sec, 175 secs
lola: 7873 markings, 7872 edges, 32 markings/sec, 180 secs
lola: 8184 markings, 8183 edges, 62 markings/sec, 185 secs
lola: 8403 markings, 8402 edges, 44 markings/sec, 190 secs
lola: 8624 markings, 8623 edges, 44 markings/sec, 195 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9060 markings, 9060 edges
lola: ========================================
lola: subprocess 3 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p2105 <= p2067)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p2105 <= p2067)))
lola: processed formula length: 24
lola: 50 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: 35467 markings, 35471 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X ((X (G (((p2267 <= p246) AND (p2013 <= p728)))) OR (p2267 <= p246)))) AND (p554 <= p1164)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X ((X (G (((p2267 <= p246) AND (p2013 <= p728)))) OR (p2267 <= p246)))) AND (p554 <= p1164)))
lola: processed formula length: 100
lola: 50 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: 8835 markings, 8835 edges
lola: ========================================
lola: subprocess 4 will run for 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((p205 <= p1249)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((p205 <= p1249)))))
lola: processed formula length: 31
lola: 50 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: 14067 markings, 14067 edges
lola: ========================================
lola: subprocess 5 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((3 <= p486)) AND (3 <= p486))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((3 <= p486)) AND (3 <= p486))))
lola: processed formula length: 41
lola: 50 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: 2983 markings, 2982 edges, 597 markings/sec, 0 secs
lola: 3011 markings, 3010 edges, 6 markings/sec, 5 secs
lola: 3041 markings, 3040 edges, 6 markings/sec, 10 secs
lola: 3207 markings, 3206 edges, 33 markings/sec, 15 secs
lola: 3248 markings, 3247 edges, 8 markings/sec, 20 secs
lola: 3289 markings, 3288 edges, 8 markings/sec, 25 secs
lola: 3334 markings, 3333 edges, 9 markings/sec, 30 secs
lola: 3548 markings, 3547 edges, 43 markings/sec, 35 secs
lola: 4499 markings, 4498 edges, 190 markings/sec, 40 secs
lola: 5686 markings, 5685 edges, 237 markings/sec, 45 secs
lola: 5917 markings, 5916 edges, 46 markings/sec, 50 secs
lola: 6703 markings, 6702 edges, 157 markings/sec, 55 secs
lola: 7246 markings, 7245 edges, 109 markings/sec, 60 secs
lola: 7802 markings, 7801 edges, 111 markings/sec, 65 secs
lola: 8185 markings, 8184 edges, 77 markings/sec, 70 secs
lola: 9598 markings, 9713 edges, 283 markings/sec, 75 secs
lola: 12881 markings, 13240 edges, 657 markings/sec, 80 secs
lola: 30056 markings, 32636 edges, 3435 markings/sec, 85 secs
lola: 50424 markings, 55484 edges, 4074 markings/sec, 90 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: 53729 markings, 59202 edges
lola: ========================================
lola: subprocess 6 will run for 538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((p1063 + 1 <= p1084))) AND (p1063 + 1 <= p1084)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((p1063 + 1 <= p1084))) AND (p1063 + 1 <= p1084)))
lola: processed formula length: 59
lola: 50 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: 2407 markings, 2406 edges, 481 markings/sec, 0 secs
lola: 2451 markings, 2450 edges, 9 markings/sec, 5 secs
lola: 2492 markings, 2491 edges, 8 markings/sec, 10 secs
lola: 2531 markings, 2530 edges, 8 markings/sec, 15 secs
lola: 2570 markings, 2569 edges, 8 markings/sec, 20 secs
lola: 2676 markings, 2675 edges, 21 markings/sec, 25 secs
lola: 3100 markings, 3099 edges, 85 markings/sec, 30 secs
lola: 3260 markings, 3259 edges, 32 markings/sec, 35 secs
lola: 3346 markings, 3345 edges, 17 markings/sec, 40 secs
lola: 3445 markings, 3444 edges, 20 markings/sec, 45 secs
lola: 3523 markings, 3522 edges, 16 markings/sec, 50 secs
lola: 3616 markings, 3615 edges, 19 markings/sec, 55 secs
lola: 3722 markings, 3721 edges, 21 markings/sec, 60 secs
lola: 3831 markings, 3830 edges, 22 markings/sec, 65 secs
lola: 3939 markings, 3938 edges, 22 markings/sec, 70 secs
lola: 4075 markings, 4074 edges, 27 markings/sec, 75 secs
lola: 4278 markings, 4277 edges, 41 markings/sec, 80 secs
lola: 4563 markings, 4562 edges, 57 markings/sec, 85 secs
lola: 4898 markings, 4897 edges, 67 markings/sec, 90 secs
lola: 5192 markings, 5191 edges, 59 markings/sec, 95 secs
lola: 5464 markings, 5463 edges, 54 markings/sec, 100 secs
lola: 5696 markings, 5695 edges, 46 markings/sec, 105 secs
lola: 5983 markings, 5982 edges, 57 markings/sec, 110 secs
lola: 6262 markings, 6261 edges, 56 markings/sec, 115 secs
lola: 6529 markings, 6528 edges, 53 markings/sec, 120 secs
lola: 6890 markings, 6889 edges, 72 markings/sec, 125 secs
lola: 7267 markings, 7266 edges, 75 markings/sec, 130 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: 7659 markings, 7659 edges
lola: ========================================
lola: subprocess 7 will run for 618 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p1878 <= p1690))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1878 <= p1690))
lola: processed formula length: 20
lola: 50 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: 2579 markings, 2578 edges, 516 markings/sec, 0 secs
lola: 2709 markings, 2708 edges, 26 markings/sec, 5 secs
lola: 3003 markings, 3002 edges, 59 markings/sec, 10 secs
lola: 3281 markings, 3280 edges, 56 markings/sec, 15 secs
lola: 3417 markings, 3416 edges, 27 markings/sec, 20 secs
lola: 3561 markings, 3560 edges, 29 markings/sec, 25 secs
lola: 3698 markings, 3697 edges, 27 markings/sec, 30 secs
lola: 3831 markings, 3830 edges, 27 markings/sec, 35 secs
lola: 3973 markings, 3972 edges, 28 markings/sec, 40 secs
lola: 4144 markings, 4143 edges, 34 markings/sec, 45 secs
lola: 4423 markings, 4422 edges, 56 markings/sec, 50 secs
lola: 4723 markings, 4722 edges, 60 markings/sec, 55 secs
lola: 5038 markings, 5037 edges, 63 markings/sec, 60 secs
lola: 5218 markings, 5217 edges, 36 markings/sec, 65 secs
lola: 5427 markings, 5426 edges, 42 markings/sec, 70 secs
lola: 5696 markings, 5695 edges, 54 markings/sec, 75 secs
lola: 5995 markings, 5994 edges, 60 markings/sec, 80 secs
lola: 6295 markings, 6294 edges, 60 markings/sec, 85 secs
lola: 6885 markings, 6884 edges, 118 markings/sec, 90 secs
lola: 7832 markings, 7838 edges, 189 markings/sec, 95 secs
lola: 9244 markings, 9367 edges, 282 markings/sec, 100 secs
lola: 10398 markings, 10555 edges, 231 markings/sec, 105 secs
lola: 12475 markings, 12838 edges, 415 markings/sec, 110 secs
lola: 15143 markings, 15866 edges, 534 markings/sec, 115 secs
lola: 18728 markings, 19947 edges, 717 markings/sec, 120 secs
lola: 26452 markings, 28666 edges, 1545 markings/sec, 125 secs
lola: 34692 markings, 37890 edges, 1648 markings/sec, 130 secs
lola: 49029 markings, 54033 edges, 2867 markings/sec, 135 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: 59905 markings, 66224 edges
lola: ========================================
lola: subprocess 8 will run for 737 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((1 <= p757)) AND (1 <= p1184)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((1 <= p757)) AND (1 <= p1184)))
lola: processed formula length: 38
lola: 50 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: 2484 markings, 2483 edges, 497 markings/sec, 0 secs
lola: 2520 markings, 2519 edges, 7 markings/sec, 5 secs
lola: 2558 markings, 2557 edges, 8 markings/sec, 10 secs
lola: 4126 markings, 4125 edges, 314 markings/sec, 15 secs
lola: 4518 markings, 4517 edges, 78 markings/sec, 20 secs
lola: 4813 markings, 4812 edges, 59 markings/sec, 25 secs
lola: 4876 markings, 4875 edges, 13 markings/sec, 30 secs
lola: 4940 markings, 4939 edges, 13 markings/sec, 35 secs
lola: 5011 markings, 5010 edges, 14 markings/sec, 40 secs
lola: 5082 markings, 5081 edges, 14 markings/sec, 45 secs
lola: 5273 markings, 5272 edges, 38 markings/sec, 50 secs
lola: 5414 markings, 5413 edges, 28 markings/sec, 55 secs
lola: 5570 markings, 5569 edges, 31 markings/sec, 60 secs
lola: 5697 markings, 5696 edges, 25 markings/sec, 65 secs
lola: 5826 markings, 5825 edges, 26 markings/sec, 70 secs
lola: 5957 markings, 5956 edges, 26 markings/sec, 75 secs
lola: 6097 markings, 6096 edges, 28 markings/sec, 80 secs
lola: 6249 markings, 6248 edges, 30 markings/sec, 85 secs
lola: 6395 markings, 6394 edges, 29 markings/sec, 90 secs
lola: 6558 markings, 6557 edges, 33 markings/sec, 95 secs
lola: 6739 markings, 6738 edges, 36 markings/sec, 100 secs
lola: 6931 markings, 6930 edges, 38 markings/sec, 105 secs
lola: 7097 markings, 7096 edges, 33 markings/sec, 110 secs
lola: 7341 markings, 7340 edges, 49 markings/sec, 115 secs
lola: 7710 markings, 7709 edges, 74 markings/sec, 120 secs
lola: 7936 markings, 7935 edges, 45 markings/sec, 125 secs
lola: 8186 markings, 8185 edges, 50 markings/sec, 130 secs
lola: 8382 markings, 8381 edges, 39 markings/sec, 135 secs
lola: 8757 markings, 8756 edges, 75 markings/sec, 140 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: 9016 markings, 9016 edges
lola: ========================================
lola: subprocess 9 will run for 933 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p1690)) AND ((p1733 <= p2284) OR (1 <= p1690))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p1690)) AND ((p1733 <= p2284) OR (1 <= p1690))))
lola: processed formula length: 61
lola: 50 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: 2625 markings, 2624 edges, 525 markings/sec, 0 secs
lola: 2770 markings, 2769 edges, 29 markings/sec, 5 secs
lola: 3135 markings, 3134 edges, 73 markings/sec, 10 secs
lola: 3304 markings, 3303 edges, 34 markings/sec, 15 secs
lola: 3357 markings, 3356 edges, 11 markings/sec, 20 secs
lola: 3405 markings, 3404 edges, 10 markings/sec, 25 secs
lola: 3462 markings, 3461 edges, 11 markings/sec, 30 secs
lola: 3518 markings, 3517 edges, 11 markings/sec, 35 secs
lola: 3557 markings, 3556 edges, 8 markings/sec, 40 secs
lola: 3587 markings, 3586 edges, 6 markings/sec, 45 secs
lola: 3626 markings, 3625 edges, 8 markings/sec, 50 secs
lola: 3666 markings, 3665 edges, 8 markings/sec, 55 secs
lola: 3712 markings, 3711 edges, 9 markings/sec, 60 secs
lola: 3756 markings, 3755 edges, 9 markings/sec, 65 secs
lola: 3804 markings, 3803 edges, 10 markings/sec, 70 secs
lola: 3854 markings, 3853 edges, 10 markings/sec, 75 secs
lola: 3907 markings, 3906 edges, 11 markings/sec, 80 secs
lola: 3958 markings, 3957 edges, 10 markings/sec, 85 secs
lola: 4009 markings, 4008 edges, 10 markings/sec, 90 secs
lola: 4062 markings, 4061 edges, 11 markings/sec, 95 secs
lola: 4119 markings, 4118 edges, 11 markings/sec, 100 secs
lola: 4200 markings, 4199 edges, 16 markings/sec, 105 secs
lola: 4269 markings, 4268 edges, 14 markings/sec, 110 secs
lola: 4365 markings, 4364 edges, 19 markings/sec, 115 secs
lola: 4437 markings, 4436 edges, 14 markings/sec, 120 secs
lola: 4504 markings, 4503 edges, 13 markings/sec, 125 secs
lola: 4602 markings, 4601 edges, 20 markings/sec, 130 secs
lola: 4705 markings, 4704 edges, 21 markings/sec, 135 secs
lola: 4794 markings, 4793 edges, 18 markings/sec, 140 secs
lola: 4909 markings, 4908 edges, 23 markings/sec, 145 secs
lola: 5028 markings, 5027 edges, 24 markings/sec, 150 secs
lola: 5156 markings, 5155 edges, 26 markings/sec, 155 secs
lola: 5286 markings, 5285 edges, 26 markings/sec, 160 secs
lola: 5404 markings, 5403 edges, 24 markings/sec, 165 secs
lola: 5559 markings, 5558 edges, 31 markings/sec, 170 secs
lola: 5760 markings, 5759 edges, 40 markings/sec, 175 secs
lola: 5980 markings, 5979 edges, 44 markings/sec, 180 secs
lola: 6212 markings, 6211 edges, 46 markings/sec, 185 secs
lola: 6468 markings, 6467 edges, 51 markings/sec, 190 secs
lola: 6920 markings, 6919 edges, 90 markings/sec, 195 secs
lola: 7689 markings, 7688 edges, 154 markings/sec, 200 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: 7871 markings, 7871 edges
lola: ========================================
lola: subprocess 10 will run for 1297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1340 <= p2384) AND (p916 + 1 <= p1785)) U ((p1340 <= p2384) U G ((p1785 <= p916))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p1340 <= p2384) AND (p916 + 1 <= p1785)) U ((p1340 <= p2384) U G ((p1785 <= p916))))
lola: processed formula length: 87
lola: 50 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: 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: 2317 markings, 2316 edges, 463 markings/sec, 0 secs
lola: 2484 markings, 2483 edges, 33 markings/sec, 5 secs
lola: 3414 markings, 3413 edges, 186 markings/sec, 10 secs
lola: 4055 markings, 4054 edges, 128 markings/sec, 15 secs
lola: 4409 markings, 4408 edges, 71 markings/sec, 20 secs
lola: 4842 markings, 4841 edges, 87 markings/sec, 25 secs
lola: 5629 markings, 5628 edges, 157 markings/sec, 30 secs
lola: 6311 markings, 6310 edges, 136 markings/sec, 35 secs
lola: 7343 markings, 7357 edges, 206 markings/sec, 40 secs
lola: 8753 markings, 8896 edges, 282 markings/sec, 45 secs
lola: 10745 markings, 10956 edges, 398 markings/sec, 50 secs
lola: 15680 markings, 16563 edges, 987 markings/sec, 55 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: 18717 markings, 19979 edges
lola: ========================================
lola: subprocess 11 will run for 2533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p1033 + 1 <= p1213)) AND ((p1966 <= p440) OR (p1033 + 1 <= p1213)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p1033 + 1 <= p1213)) AND ((p1966 <= p440) OR (p1033 + 1 <= p1213)))))
lola: processed formula length: 80
lola: 50 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: 2204 markings, 2203 edges, 441 markings/sec, 0 secs
lola: 2334 markings, 2333 edges, 26 markings/sec, 5 secs
lola: 2747 markings, 2746 edges, 83 markings/sec, 10 secs
lola: 2923 markings, 2922 edges, 35 markings/sec, 15 secs
lola: 3066 markings, 3065 edges, 29 markings/sec, 20 secs
lola: 3161 markings, 3160 edges, 19 markings/sec, 25 secs
lola: 3274 markings, 3273 edges, 23 markings/sec, 30 secs
lola: 3411 markings, 3410 edges, 27 markings/sec, 35 secs
lola: 3547 markings, 3546 edges, 27 markings/sec, 40 secs
lola: 3747 markings, 3746 edges, 40 markings/sec, 45 secs
lola: 3998 markings, 3997 edges, 50 markings/sec, 50 secs
lola: 4248 markings, 4247 edges, 50 markings/sec, 55 secs
lola: 4504 markings, 4503 edges, 51 markings/sec, 60 secs
lola: 4759 markings, 4758 edges, 51 markings/sec, 65 secs
lola: 5048 markings, 5047 edges, 58 markings/sec, 70 secs
lola: 5346 markings, 5345 edges, 60 markings/sec, 75 secs
lola: 5918 markings, 5917 edges, 114 markings/sec, 80 secs
lola: 6799 markings, 6798 edges, 176 markings/sec, 85 secs
lola: 7688 markings, 7718 edges, 178 markings/sec, 90 secs
lola: 8906 markings, 9048 edges, 244 markings/sec, 95 secs
lola: 9964 markings, 10122 edges, 212 markings/sec, 100 secs
lola: 12076 markings, 12442 edges, 422 markings/sec, 105 secs
lola: 15426 markings, 16246 edges, 670 markings/sec, 110 secs
lola: 18683 markings, 19944 edges, 651 markings/sec, 115 secs
lola: 23290 markings, 25143 edges, 921 markings/sec, 120 secs
lola: 28871 markings, 31431 edges, 1116 markings/sec, 125 secs
lola: 34446 markings, 37712 edges, 1115 markings/sec, 130 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: 36637 markings, 40144 edges
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no no no no
lola:
preliminary result: no no yes no no no no no no no no no
lola: ========================================
lola: memory consumption: 176700 KB
lola: time consumption: 1173 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="HypercubeGrid-PT-C4K3P3B12"
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 HypercubeGrid-PT-C4K3P3B12, 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 r132-tall-162075428200129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HypercubeGrid-PT-C4K3P3B12.tgz
mv HypercubeGrid-PT-C4K3P3B12 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 ;