About the Execution of 2020-gold for Diffusion2D-PT-D40N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4397.084 | 3600000.00 | 674033.00 | 1390.40 | FFFFTFFFFTTTFFFF | 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.r094-tall-162048902300093.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 Diffusion2D-PT-D40N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902300093
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.7M 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 Diffusion2D-PT-D40N100-00
FORMULA_NAME Diffusion2D-PT-D40N100-01
FORMULA_NAME Diffusion2D-PT-D40N100-02
FORMULA_NAME Diffusion2D-PT-D40N100-03
FORMULA_NAME Diffusion2D-PT-D40N100-04
FORMULA_NAME Diffusion2D-PT-D40N100-05
FORMULA_NAME Diffusion2D-PT-D40N100-06
FORMULA_NAME Diffusion2D-PT-D40N100-07
FORMULA_NAME Diffusion2D-PT-D40N100-08
FORMULA_NAME Diffusion2D-PT-D40N100-09
FORMULA_NAME Diffusion2D-PT-D40N100-10
FORMULA_NAME Diffusion2D-PT-D40N100-11
FORMULA_NAME Diffusion2D-PT-D40N100-12
FORMULA_NAME Diffusion2D-PT-D40N100-13
FORMULA_NAME Diffusion2D-PT-D40N100-14
FORMULA_NAME Diffusion2D-PT-D40N100-15
=== Now, execution of the tool begins
BK_START 1620730747098
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 10:59:09] [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-11 10:59:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 10:59:09] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2021-05-11 10:59:09] [INFO ] Transformed 1600 places.
[2021-05-11 10:59:09] [INFO ] Transformed 12324 transitions.
[2021-05-11 10:59:09] [INFO ] Parsed PT model containing 1600 places and 12324 transitions in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 131 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100047 steps, including 0 resets, run finished after 202 ms. (steps per millisecond=495 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0]
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-11 10:59:10] [INFO ] Computed 1 place invariants in 172 ms
[2021-05-11 10:59:10] [INFO ] [Real]Absence check using 1 positive place invariants in 37 ms returned sat
[2021-05-11 10:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:59:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:59:30] [INFO ] [Real]Absence check using state equation in 19744 ms returned (error "Failed to check-sat")
[2021-05-11 10:59:30] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 10:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:59:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:59:50] [INFO ] [Real]Absence check using state equation in 19861 ms returned (error "Failed to check-sat")
[2021-05-11 10:59:50] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 10:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:00:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:00:10] [INFO ] [Real]Absence check using state equation in 19846 ms returned unknown
[2021-05-11 11:00:10] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:00:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:00:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:00:30] [INFO ] [Real]Absence check using state equation in 19849 ms returned (error "Failed to check-sat")
[2021-05-11 11:00:30] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:00:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:00:50] [INFO ] [Real]Absence check using state equation in 19869 ms returned (error "Failed to check-sat")
[2021-05-11 11:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:01:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:01:10] [INFO ] [Real]Absence check using state equation in 19863 ms returned (error "Failed to check-sat")
[2021-05-11 11:01:10] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned unsat
[2021-05-11 11:01:10] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:01:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:01:30] [INFO ] [Real]Absence check using state equation in 19826 ms returned (error "Failed to check-sat")
[2021-05-11 11:01:30] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:01:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:01:50] [INFO ] [Real]Absence check using state equation in 19861 ms returned unknown
[2021-05-11 11:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned unsat
[2021-05-11 11:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:02:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:02:10] [INFO ] [Real]Absence check using state equation in 19860 ms returned unknown
[2021-05-11 11:02:10] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:02:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:02:30] [INFO ] [Real]Absence check using state equation in 19861 ms returned unknown
[2021-05-11 11:02:30] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:02:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:02:50] [INFO ] [Real]Absence check using state equation in 19863 ms returned (error "Failed to check-sat")
[2021-05-11 11:02:50] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:02:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:03:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:03:10] [INFO ] [Real]Absence check using state equation in 19828 ms returned (error "Failed to check-sat")
[2021-05-11 11:03:10] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:03:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:03:30] [INFO ] [Real]Absence check using state equation in 19860 ms returned unknown
[2021-05-11 11:03:30] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:03:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:03:50] [INFO ] [Real]Absence check using state equation in 19881 ms returned (error "Failed to check-sat")
[2021-05-11 11:03:50] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned unsat
[2021-05-11 11:03:51] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:04:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:04:10] [INFO ] [Real]Absence check using state equation in 19859 ms returned (error "Failed to check-sat")
[2021-05-11 11:04:11] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:04:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:04:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:04:30] [INFO ] [Real]Absence check using state equation in 19858 ms returned unknown
[2021-05-11 11:04:31] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:04:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:04:50] [INFO ] [Real]Absence check using state equation in 19864 ms returned (error "Failed to check-sat")
[2021-05-11 11:04:51] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:05:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:05:10] [INFO ] [Real]Absence check using state equation in 19853 ms returned (error "Failed to check-sat")
[2021-05-11 11:05:11] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:05:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:05:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:05:30] [INFO ] [Real]Absence check using state equation in 19855 ms returned unknown
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
[2021-05-11 11:05:31] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-11 11:05:31] [INFO ] Flatten gal took : 499 ms
FORMULA Diffusion2D-PT-D40N100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N100-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N100-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 11:05:31] [INFO ] Flatten gal took : 247 ms
[2021-05-11 11:05:32] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 63 ms.
[2021-05-11 11:05:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 44 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D40N100 @ 3570 seconds
FORMULA Diffusion2D-PT-D40N100-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D40N100-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D40N100-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D40N100-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D40N100-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D40N100-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D40N100-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D40N100-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D40N100-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D40N100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D40N100-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D40N100-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3295
rslt: Output for LTLCardinality @ Diffusion2D-PT-D40N100
{
"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": "Tue May 11 11:05:33 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (G ((p1176 <= p612))) U (1 <= p1299))",
"processed_size": 40,
"rewrites": 63
},
"result":
{
"edges": 2048,
"markings": 1664,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "X ((F ((3 <= p537)) AND (X (G ((p188 <= 0))) OR (p504 + 1 <= p477))))",
"processed_size": 69,
"rewrites": 63
},
"result":
{
"edges": 1287297,
"markings": 337009,
"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": 348
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((p593 <= 0)))",
"processed_size": 19,
"rewrites": 63
},
"result":
{
"edges": 1285979,
"markings": 336704,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 385
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((X ((p1229 <= p1518)) AND ((p40 <= p1123) AND ((p1518 + 1 <= p1229) OR (p679 <= 1))))))",
"processed_size": 94,
"rewrites": 63
},
"result":
{
"edges": 3508,
"markings": 3176,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 433
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p449 <= p413)))",
"processed_size": 22,
"rewrites": 63
},
"result":
{
"edges": 1286608,
"markings": 336848,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 492
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p338 + 1 <= p563)))",
"processed_size": 26,
"rewrites": 63
},
"result":
{
"edges": 3103,
"markings": 3102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 574
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((p399 + 1 <= p542) OR (p975 <= 1)))))",
"processed_size": 46,
"rewrites": 63
},
"result":
{
"edges": 1247093,
"markings": 418051,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 684
},
"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": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F ((p265 <= p627)) AND (1 <= p384)))",
"processed_size": 40,
"rewrites": 63
},
"result":
{
"edges": 3101,
"markings": 3101,
"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": 856
},
"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": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F ((p716 <= p737)) AND (1 <= p894))))",
"processed_size": 44,
"rewrites": 63
},
"result":
{
"edges": 3101,
"markings": 3101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1141
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((G (F ((p1267 + 1 <= p712))) AND (p1169 <= 0))))",
"processed_size": 54,
"rewrites": 63
},
"result":
{
"edges": 3106,
"markings": 3105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((G (F ((p727 <= p529))) OR (p130 <= p72))))",
"processed_size": 49,
"rewrites": 63
},
"result":
{
"edges": 5592610,
"markings": 1514314,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3319
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3319
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p1015))",
"processed_size": 16,
"rewrites": 63
},
"result":
{
"edges": 3101,
"markings": 3101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p1015))",
"processed_size": 16,
"rewrites": 63
},
"result":
{
"edges": 3101,
"markings": 3101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "F (G ((G ((p844 <= p1295)) AND (p1425 <= p1210))))",
"processed_size": 50,
"rewrites": 63
},
"result":
{
"edges": 1206135,
"markings": 385576,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 139612,
"runtime": 275.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(G(**)) U **) : F(G((G(F(*)) AND **))) : X((F(*) AND (X(G(*)) OR *))) : G(F((F(**) AND **))) : F(G((G(F(**)) OR **))) : X(G(*)) : F(G(*)) : X(G((X(**) AND (** AND **)))) : F((F(**) AND **)) : X(G(**)) : (F(G((G(**) AND **))) OR (G(**) AND F(G((G(**) AND **))))) : G(F(**))"
},
"net":
{
"arcs": 24648,
"conflict_clusters": 1600,
"places": 1600,
"places_significant": 1599,
"singleton_clusters": 0,
"transitions": 12324
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no ",
"value": "no no no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 13924/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 51200
lola: finding significant places
lola: 1600 places, 12324 transitions, 1599 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 (X ((p1176 <= p612))) U (1 <= p1299)) : G (NOT(G (NOT(G ((NOT(G (F (X (G ((p712 <= p1267)))))) AND (p1169 <= 0))))))) : (X (NOT(G ((p537 <= 2)))) AND (X (NOT(X (F ((1 <= p188))))) OR NOT(X ((p477 <= p504))))) : ((1 <= 0) U F (G (F (X ((((0 <= 0) U (p716 <= p737)) AND (1 <= p894))))))) : G (X (F (G ((X (G (X (F ((p727 <= p529))))) OR (p130 <= p72)))))) : X (NOT(((0 <= 0) U (1 <= p593)))) : F (((NOT(G ((p563 <= p338))) OR (p1334 + 1 <= p366)) U F (NOT(G (F ((p563 <= p338))))))) : G (X (G (((X ((p1229 <= p1518)) AND (p40 <= p1123)) AND ((p1518 + 1 <= p1229) OR (p679 <= 1)))))) : F ((F ((p265 <= p627)) AND (1 <= p384))) : X (G ((p449 <= p413))) : (G ((1 <= p1015)) U F (G ((G ((p844 <= p1295)) AND (p1425 <= p1210))))) : G (X (X (G (F ((((p399 + 1 <= p542) OR (p975 <= 1))))))))
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:332
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:528
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p1176 <= p612))) U (1 <= p1299))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((p1176 <= p612))) U (1 <= p1299))
lola: processed formula length: 40
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1664 markings, 2048 edges
lola: ========================================
lola: subprocess 1 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((3 <= p537)) AND (X (G ((p188 <= 0))) OR (p504 + 1 <= p477))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((3 <= p537)) AND (X (G ((p188 <= 0))) OR (p504 + 1 <= p477))))
lola: processed formula length: 69
lola: 63 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: 90052 markings, 327961 edges, 18010 markings/sec, 0 secs
lola: 178084 markings, 656732 edges, 17606 markings/sec, 5 secs
lola: 259577 markings, 976570 edges, 16299 markings/sec, 10 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: 337009 markings, 1287297 edges
lola: ========================================
lola: subprocess 2 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p593 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p593 <= 0)))
lola: processed formula length: 19
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 90090 markings, 328126 edges, 18018 markings/sec, 0 secs
lola: 178152 markings, 656952 edges, 17612 markings/sec, 5 secs
lola: 259906 markings, 977840 edges, 16351 markings/sec, 10 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: 336704 markings, 1285979 edges
lola: ========================================
lola: subprocess 3 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p1229 <= p1518)) AND ((p40 <= p1123) AND ((p1518 + 1 <= p1229) OR (p679 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p1229 <= p1518)) AND ((p40 <= p1123) AND ((p1518 + 1 <= p1229) OR (p679 <= 1))))))
lola: processed formula length: 94
lola: 63 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: 3176 markings, 3508 edges
lola: ========================================
lola: subprocess 4 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p449 <= p413)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p449 <= p413)))
lola: processed formula length: 22
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 90029 markings, 327903 edges, 18006 markings/sec, 0 secs
lola: 178055 markings, 656647 edges, 17605 markings/sec, 5 secs
lola: 259822 markings, 977467 edges, 16353 markings/sec, 10 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: 336848 markings, 1286608 edges
lola: ========================================
lola: subprocess 5 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p338 + 1 <= p563)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p338 + 1 <= p563)))
lola: processed formula length: 26
lola: 63 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: 3102 markings, 3103 edges
lola: ========================================
lola: subprocess 6 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p399 + 1 <= p542) OR (p975 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p399 + 1 <= p542) OR (p975 <= 1)))))
lola: processed formula length: 46
lola: 63 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: 108417 markings, 274237 edges, 21683 markings/sec, 0 secs
lola: 196553 markings, 543468 edges, 17627 markings/sec, 5 secs
lola: 279999 markings, 807084 edges, 16689 markings/sec, 10 secs
lola: 361668 markings, 1067335 edges, 16334 markings/sec, 15 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: 418051 markings, 1247093 edges
lola: ========================================
lola: subprocess 7 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p265 <= p627)) AND (1 <= p384)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p265 <= p627)) AND (1 <= p384)))
lola: processed formula length: 40
lola: 63 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: 3101 markings, 3101 edges
lola: ========================================
lola: subprocess 8 will run for 856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((p716 <= p737)) AND (1 <= p894))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((p716 <= p737)) AND (1 <= p894))))
lola: processed formula length: 44
lola: 63 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: 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: 3101 markings, 3101 edges
lola: ========================================
lola: subprocess 9 will run for 1141 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((p1267 + 1 <= p712))) AND (p1169 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((p1267 + 1 <= p712))) AND (p1169 <= 0))))
lola: processed formula length: 54
lola: 63 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: 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: 3105 markings, 3106 edges
lola: ========================================
lola: subprocess 10 will run for 1712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((p727 <= p529))) OR (p130 <= p72))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((p727 <= p529))) OR (p130 <= p72))))
lola: processed formula length: 49
lola: 63 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: 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: 87009 markings, 264164 edges, 17402 markings/sec, 0 secs
lola: 158869 markings, 532811 edges, 14372 markings/sec, 5 secs
lola: 230693 markings, 801396 edges, 14365 markings/sec, 10 secs
lola: 302706 markings, 1069310 edges, 14403 markings/sec, 15 secs
lola: 374654 markings, 1337131 edges, 14390 markings/sec, 20 secs
lola: 446186 markings, 1604745 edges, 14306 markings/sec, 25 secs
lola: 517652 markings, 1872109 edges, 14293 markings/sec, 30 secs
lola: 589054 markings, 2139289 edges, 14280 markings/sec, 35 secs
lola: 660394 markings, 2406381 edges, 14268 markings/sec, 40 secs
lola: 731583 markings, 2672930 edges, 14238 markings/sec, 45 secs
lola: 802825 markings, 2939608 edges, 14248 markings/sec, 50 secs
lola: 874397 markings, 3206192 edges, 14314 markings/sec, 55 secs
lola: 946218 markings, 3473405 edges, 14364 markings/sec, 60 secs
lola: 1017504 markings, 3740208 edges, 14257 markings/sec, 65 secs
lola: 1088765 markings, 4006948 edges, 14252 markings/sec, 70 secs
lola: 1159861 markings, 4273150 edges, 14219 markings/sec, 75 secs
lola: 1231076 markings, 4539987 edges, 14243 markings/sec, 80 secs
lola: 1303127 markings, 4806672 edges, 14410 markings/sec, 85 secs
lola: 1374513 markings, 5073668 edges, 14277 markings/sec, 90 secs
lola: 1445994 markings, 5340580 edges, 14296 markings/sec, 95 secs
lola: add low 7325
lola: add low 6653
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: 1514314 markings, 5592610 edges
lola: ========================================
lola: subprocess 11 will run for 3319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((G ((p844 <= p1295)) AND (p1425 <= p1210)))) OR (G ((1 <= p1015)) AND F (G ((G ((p844 <= p1295)) AND (p1425 <= p1210))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p1015))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p1015))
lola: processed formula length: 16
lola: 63 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: 3101 markings, 3101 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G ((G ((p844 <= p1295)) AND (p1425 <= p1210)))) OR (G ((1 <= p1015)) AND F (G ((G ((p844 <= p1295)) AND (p1425 <= p1210))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((1 <= p1015))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p1015))
lola: processed formula length: 16
lola: 63 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: 3101 markings, 3101 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((G ((p844 <= p1295)) AND (p1425 <= p1210))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((p844 <= p1295)) AND (p1425 <= p1210))))
lola: processed formula length: 50
lola: 63 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: 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: 100939 markings, 261946 edges, 20188 markings/sec, 0 secs
lola: 179141 markings, 522237 edges, 15640 markings/sec, 5 secs
lola: 252353 markings, 766950 edges, 14642 markings/sec, 10 secs
lola: 328387 markings, 1018047 edges, 15207 markings/sec, 15 secs
lola: add low 2602
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: 385576 markings, 1206135 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no
lola: memory consumption: 139612 KB
lola: time consumption: 275 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="Diffusion2D-PT-D40N100"
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 Diffusion2D-PT-D40N100, 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 r094-tall-162048902300093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D40N100.tgz
mv Diffusion2D-PT-D40N100 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 ;