About the Execution of 2020-gold for Diffusion2D-PT-D05N200
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16257.123 | 3600000.00 | 788097.00 | 53473.50 | TFFTFTFF?FTFTFFF | 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-162048902200017.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-D05N200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902200017
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 104K 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.9K Mar 28 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 55K 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-D05N200-00
FORMULA_NAME Diffusion2D-PT-D05N200-01
FORMULA_NAME Diffusion2D-PT-D05N200-02
FORMULA_NAME Diffusion2D-PT-D05N200-03
FORMULA_NAME Diffusion2D-PT-D05N200-04
FORMULA_NAME Diffusion2D-PT-D05N200-05
FORMULA_NAME Diffusion2D-PT-D05N200-06
FORMULA_NAME Diffusion2D-PT-D05N200-07
FORMULA_NAME Diffusion2D-PT-D05N200-08
FORMULA_NAME Diffusion2D-PT-D05N200-09
FORMULA_NAME Diffusion2D-PT-D05N200-10
FORMULA_NAME Diffusion2D-PT-D05N200-11
FORMULA_NAME Diffusion2D-PT-D05N200-12
FORMULA_NAME Diffusion2D-PT-D05N200-13
FORMULA_NAME Diffusion2D-PT-D05N200-14
FORMULA_NAME Diffusion2D-PT-D05N200-15
=== Now, execution of the tool begins
BK_START 1620728642110
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 10:24:03] [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:24:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 10:24:03] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-11 10:24:03] [INFO ] Transformed 25 places.
[2021-05-11 10:24:03] [INFO ] Transformed 144 transitions.
[2021-05-11 10:24:03] [INFO ] Parsed PT model containing 25 places and 144 transitions in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100112 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=2566 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 144 rows 25 cols
[2021-05-11 10:24:03] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-11 10:24:03] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2021-05-11 10:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:24:03] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-11 10:24:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:24:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2021-05-11 10:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:24:03] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-11 10:24:04] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 12 ms.
[2021-05-11 10:24:04] [INFO ] Added : 128 causal constraints over 26 iterations in 337 ms. Result :sat
[2021-05-11 10:24:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned unsat
[2021-05-11 10:24:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
[2021-05-11 10:24:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-11 10:24:04] [INFO ] Flatten gal took : 40 ms
FORMULA Diffusion2D-PT-D05N200-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N200-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N200-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 10:24:04] [INFO ] Flatten gal took : 11 ms
[2021-05-11 10:24:04] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-11 10:24:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D05N200 @ 3570 seconds
FORMULA Diffusion2D-PT-D05N200-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2702
rslt: Output for LTLCardinality @ Diffusion2D-PT-D05N200
{
"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 10:24:05 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p12 <= p11)",
"processed_size": 12,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((G ((p12 <= p11)) OR (p8 <= 0))))",
"processed_size": 39,
"rewrites": 69
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((F ((p10 <= p16)) AND G ((p0 + 1 <= p16))))",
"processed_size": 46,
"rewrites": 69
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p22)",
"processed_size": 10,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": "(p10 + 1 <= p15)",
"processed_size": 16,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((p15 <= p10) OR (p24 <= p8)))",
"processed_size": 34,
"rewrites": 69
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (((p16 <= p17) OR X (F ((p3 <= p0))))))",
"processed_size": 44,
"rewrites": 69
},
"result":
{
"edges": 180,
"markings": 132,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((p14 <= p0) U (p4 <= p15)) OR X ((p4 <= p15))))",
"processed_size": 52,
"rewrites": 69
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((X ((F ((p0 <= p4)) OR X ((p22 <= p5)))) OR G ((p16 <= p20))))",
"processed_size": 65,
"rewrites": 69
},
"result":
{
"edges": 163,
"markings": 97,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 5,
"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": "X (X (G ((X (X (X (F ((p0 <= p10))))) OR (p22 <= p21)))))",
"processed_size": 57,
"rewrites": 69
},
"result":
{
"edges": 258,
"markings": 131,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((p22 <= 0))) OR (p19 <= 1))))",
"processed_size": 42,
"rewrites": 69
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((F ((p8 <= p24)) AND ((3 <= p10) OR ((3 <= p4) U (p8 <= p24)))))) AND (X ((3 <= p4)) AND (3 <= p4)))))",
"processed_size": 115,
"rewrites": 69
},
"result":
{
"edges": 15803,
"markings": 5602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((G ((p2 + 1 <= p4)) OR (G ((p14 <= 0)) AND (p2 + 1 <= p4)))))",
"processed_size": 67,
"rewrites": 69
},
"result":
{
"edges": 29,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1556
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((G ((p22 + 1 <= p5)) AND (p24 <= 1)) OR (F ((2 <= p24)) OR (p12 <= 2)))))",
"processed_size": 80,
"rewrites": 69
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3112
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3112
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p20 <= p5)",
"processed_size": 11,
"rewrites": 71
},
"result":
{
"edges": 201,
"markings": 201,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p20 <= p5)",
"processed_size": 11,
"rewrites": 71
},
"result":
{
"edges": 201,
"markings": 201,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"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": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((1 <= p4)) AND ((1 <= p13) OR (1 <= p4))))",
"processed_size": 49,
"rewrites": 69
},
"result":
{
"edges": 207,
"markings": 207,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3796,
"runtime": 868.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F((G(*) OR *))) OR **) : X((F(**) AND G(**))) : (((** U **) AND **) OR (X(*) AND F(**))) : X(X((* OR X(F(**))))) : X(((** U **) OR X(**))) : F(G(((G(*) AND *) OR (F(*) OR *)))) : (* R (* AND (F(*) OR G(*)))) : X((X((F(**) OR X(**))) OR G(**))) : X(X(G((X(X(X(F(**)))) OR **)))) : X(F((F(G(*)) OR *))) : X(F((F(G((F(**) AND (** OR (** U **))))) AND (X(**) AND **)))) : X(F((G(*) OR (G(*) AND *)))) : (F(*) OR G((F(**) AND (** OR **))))"
},
"net":
{
"arcs": 288,
"conflict_clusters": 25,
"places": 25,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 144
},
"result":
{
"preliminary_value": "no no yes no yes no unknown yes no yes no no no ",
"value": "no no yes no yes no unknown yes no yes 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: 169/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 144 transitions, 24 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: (NOT(G (X ((F ((X ((p12 <= p11)) U (p11 + 1 <= p12))) AND (1 <= p8))))) OR (p12 <= p11)) : (X (((p10 <= p16) U F ((p10 <= p16)))) AND G (X ((p0 + 1 <= p16)))) : ((((3 <= p22) U (p24 <= p8)) AND (3 <= p22)) OR (NOT(X (((p10 + 1 <= p15) AND (p8 + 1 <= p24)))) AND F ((p15 <= p10)))) : (NOT(X (X ((p17 + 1 <= p16)))) OR X (X (X (F ((p3 <= p0)))))) : X ((((p14 <= p0) U (p4 <= p15)) OR X ((p4 <= p15)))) : F (NOT(F ((((F ((p5 <= p22)) OR (2 <= p24)) AND G ((p24 <= 1))) AND (3 <= p12))))) : NOT(((2 <= p4) U (G ((p4 <= p18)) U (p18 + 1 <= p4)))) : X ((X ((F ((p0 <= p4)) OR X ((p22 <= p5)))) OR G ((p16 <= p20)))) : X (G (X ((X (X (F (X ((p0 <= p10))))) OR (p22 <= p21))))) : F (NOT(X ((X ((X ((p13 <= p20)) U G (F ((1 <= p22))))) AND (2 <= p19))))) : X (F (((F (G (((3 <= p10) U ((3 <= p4) U (p8 <= p24))))) AND X ((3 <= p4))) AND (3 <= p4)))) : NOT(X (G ((F ((1 <= p14)) U (p4 <= p2))))) : (NOT(G ((p20 <= p5))) OR G (((1 <= p13) U (1 <= p4))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((G ((p12 <= p11)) OR (p8 <= 0)))) OR (p12 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p12 <= p11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p12 <= p11)
lola: processed formula length: 12
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p12 <= p11)) OR (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p12 <= p11)) OR (p8 <= 0))))
lola: processed formula length: 39
lola: 69 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: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p10 <= p16)) AND G ((p0 + 1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p10 <= p16)) AND G ((p0 + 1 <= p16))))
lola: processed formula length: 46
lola: 69 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((3 <= p22) U (p24 <= p8)) AND (3 <= p22)) OR (X (((p15 <= p10) OR (p24 <= p8))) AND F ((p15 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p22)
lola: processed formula length: 10
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p15 <= p10))
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: (p10 + 1 <= p15)
lola: processed formula length: 16
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p15 <= p10) OR (p24 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p15 <= p10) OR (p24 <= p8)))
lola: processed formula length: 34
lola: 69 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((p16 <= p17) OR X (F ((p3 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((p16 <= p17) OR X (F ((p3 <= p0))))))
lola: processed formula length: 44
lola: 69 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: 132 markings, 180 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p14 <= p0) U (p4 <= p15)) OR X ((p4 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p14 <= p0) U (p4 <= p15)) OR X ((p4 <= p15))))
lola: processed formula length: 52
lola: 69 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((F ((p0 <= p4)) OR X ((p22 <= p5)))) OR G ((p16 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((F ((p0 <= p4)) OR X ((p22 <= p5)))) OR G ((p16 <= p20))))
lola: processed formula length: 65
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 97 markings, 163 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((X (X (X (F ((p0 <= p10))))) OR (p22 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X (X (X (F ((p0 <= p10))))) OR (p22 <= p21)))))
lola: processed formula length: 57
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 131 markings, 258 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((p22 <= 0))) OR (p19 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((p22 <= 0))) OR (p19 <= 1))))
lola: processed formula length: 42
lola: 69 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((F ((p8 <= p24)) AND ((3 <= p10) OR ((3 <= p4) U (p8 <= p24)))))) AND (X ((3 <= p4)) AND (3 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((F ((p8 <= p24)) AND ((3 <= p10) OR ((3 <= p4) U (p8 <= p24)))))) AND (X ((3 <= p4)) AND (3 <= p4)))))
lola: processed formula length: 115
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5602 markings, 15803 edges
lola: ========================================
lola: subprocess 9 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p2 + 1 <= p4)) OR (G ((p14 <= 0)) AND (p2 + 1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p2 + 1 <= p4)) OR (G ((p14 <= 0)) AND (p2 + 1 <= p4)))))
lola: processed formula length: 67
lola: 69 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: 13 markings, 29 edges
lola: ========================================
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p4 <= 1) R ((p4 <= p18) AND (F ((p18 + 1 <= p4)) OR G ((p4 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p4 <= 1) R ((p4 <= p18) AND (F ((p18 + 1 <= p4)) OR G ((p4 <= p18)))))
lola: processed formula length: 72
lola: 69 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: 1389122 markings, 5038597 edges, 277824 markings/sec, 0 secs
lola: 2679074 markings, 9929051 edges, 257990 markings/sec, 5 secs
lola: 3940051 markings, 14759935 edges, 252195 markings/sec, 10 secs
lola: 5203943 markings, 19552825 edges, 252778 markings/sec, 15 secs
lola: 6435207 markings, 24315422 edges, 246253 markings/sec, 20 secs
lola: 7659363 markings, 29111671 edges, 244831 markings/sec, 25 secs
lola: 8869424 markings, 33877948 edges, 242012 markings/sec, 30 secs
lola: 10076061 markings, 38590258 edges, 241327 markings/sec, 35 secs
lola: 11312917 markings, 43308497 edges, 247371 markings/sec, 40 secs
lola: 12563122 markings, 47988878 edges, 250041 markings/sec, 45 secs
lola: 13776332 markings, 52736445 edges, 242642 markings/sec, 50 secs
lola: 14940370 markings, 57508154 edges, 232808 markings/sec, 55 secs
lola: 16187786 markings, 62170652 edges, 249483 markings/sec, 60 secs
lola: 17390302 markings, 66826060 edges, 240503 markings/sec, 65 secs
lola: 18601970 markings, 71484821 edges, 242334 markings/sec, 70 secs
lola: 19777937 markings, 76195153 edges, 235193 markings/sec, 75 secs
lola: 20932669 markings, 80896519 edges, 230946 markings/sec, 80 secs
lola: 22103766 markings, 85608516 edges, 234219 markings/sec, 85 secs
lola: 23278537 markings, 90255508 edges, 234954 markings/sec, 90 secs
lola: 24420209 markings, 94922056 edges, 228334 markings/sec, 95 secs
lola: 25627154 markings, 99497682 edges, 241389 markings/sec, 100 secs
lola: 26805070 markings, 104085943 edges, 235583 markings/sec, 105 secs
lola: 27952172 markings, 108766048 edges, 229420 markings/sec, 110 secs
lola: 29128100 markings, 113434355 edges, 235186 markings/sec, 115 secs
lola: 30324638 markings, 118065282 edges, 239308 markings/sec, 120 secs
lola: 31525746 markings, 122700570 edges, 240222 markings/sec, 125 secs
lola: 32665454 markings, 127310259 edges, 227942 markings/sec, 130 secs
lola: 33818441 markings, 131936926 edges, 230597 markings/sec, 135 secs
lola: 34979037 markings, 136605404 edges, 232119 markings/sec, 140 secs
lola: 36154401 markings, 141254702 edges, 235073 markings/sec, 145 secs
lola: 37332419 markings, 145817986 edges, 235604 markings/sec, 150 secs
lola: 38515090 markings, 150394586 edges, 236534 markings/sec, 155 secs
lola: 39673187 markings, 155009852 edges, 231619 markings/sec, 160 secs
lola: 40831394 markings, 159618594 edges, 231641 markings/sec, 165 secs
lola: 41979287 markings, 164281947 edges, 229579 markings/sec, 170 secs
lola: 43137968 markings, 168944203 edges, 231736 markings/sec, 175 secs
lola: 44254479 markings, 173536617 edges, 223302 markings/sec, 180 secs
lola: 45411149 markings, 178179870 edges, 231334 markings/sec, 185 secs
lola: 46575995 markings, 182792243 edges, 232969 markings/sec, 190 secs
lola: 47734818 markings, 187449539 edges, 231765 markings/sec, 195 secs
lola: 48888107 markings, 192076788 edges, 230658 markings/sec, 200 secs
lola: 50050040 markings, 196689471 edges, 232387 markings/sec, 205 secs
lola: 51168145 markings, 201316358 edges, 223621 markings/sec, 210 secs
lola: 52324090 markings, 205858218 edges, 231189 markings/sec, 215 secs
lola: 53505624 markings, 210367839 edges, 236307 markings/sec, 220 secs
lola: 54639769 markings, 214962449 edges, 226829 markings/sec, 225 secs
lola: 55814623 markings, 219571068 edges, 234971 markings/sec, 230 secs
lola: 56939942 markings, 224203955 edges, 225064 markings/sec, 235 secs
lola: 58088635 markings, 228833451 edges, 229739 markings/sec, 240 secs
lola: 59230326 markings, 233435612 edges, 228338 markings/sec, 245 secs
lola: 60389088 markings, 238009478 edges, 231752 markings/sec, 250 secs
lola: 61581537 markings, 242564753 edges, 238490 markings/sec, 255 secs
lola: 62704542 markings, 247191968 edges, 224601 markings/sec, 260 secs
lola: 63861669 markings, 251773592 edges, 231425 markings/sec, 265 secs
lola: 64980607 markings, 256401824 edges, 223788 markings/sec, 270 secs
lola: 66142967 markings, 260950683 edges, 232472 markings/sec, 275 secs
lola: 67253604 markings, 265510850 edges, 222127 markings/sec, 280 secs
lola: 68434422 markings, 270039121 edges, 236164 markings/sec, 285 secs
lola: 69587645 markings, 274666853 edges, 230645 markings/sec, 290 secs
lola: 70751667 markings, 279303941 edges, 232804 markings/sec, 295 secs
lola: 71270317 markings, 281252826 edges, 103730 markings/sec, 300 secs
lola: 72161353 markings, 284833860 edges, 178207 markings/sec, 305 secs
lola: 72902631 markings, 287935672 edges, 148256 markings/sec, 310 secs
lola: 73798200 markings, 291538373 edges, 179114 markings/sec, 315 secs
lola: 74875956 markings, 295753184 edges, 215551 markings/sec, 320 secs
lola: 75429752 markings, 297982607 edges, 110759 markings/sec, 325 secs
lola: 76542575 markings, 302391966 edges, 222565 markings/sec, 330 secs
lola: 76677085 markings, 302959709 edges, 26902 markings/sec, 335 secs
lola: 77443214 markings, 306085872 edges, 153226 markings/sec, 340 secs
lola: 77993594 markings, 308337436 edges, 110076 markings/sec, 345 secs
lola: 78736344 markings, 311323011 edges, 148550 markings/sec, 350 secs
lola: 79103221 markings, 312804566 edges, 73375 markings/sec, 355 secs
lola: 79407576 markings, 314115078 edges, 60871 markings/sec, 360 secs
lola: 79986010 markings, 316283307 edges, 115687 markings/sec, 365 secs
lola: 80708565 markings, 319247325 edges, 144511 markings/sec, 370 secs
lola: 80708565 markings, 319247325 edges, 0 markings/sec, 375 secs
lola: 81315867 markings, 321797550 edges, 121460 markings/sec, 380 secs
lola: 82010432 markings, 324690329 edges, 138913 markings/sec, 385 secs
lola: 82585103 markings, 327068646 edges, 114934 markings/sec, 390 secs
lola: 83076086 markings, 328995822 edges, 98197 markings/sec, 395 secs
lola: 83605521 markings, 331250626 edges, 105887 markings/sec, 400 secs
lola: 83805954 markings, 332084125 edges, 40087 markings/sec, 405 secs
lola: 84257123 markings, 333972780 edges, 90234 markings/sec, 410 secs
lola: 84993983 markings, 336969137 edges, 147372 markings/sec, 415 secs
lola: 85715263 markings, 339859326 edges, 144256 markings/sec, 420 secs
lola: 86277740 markings, 341958603 edges, 112495 markings/sec, 425 secs
lola: 86993108 markings, 344818339 edges, 143074 markings/sec, 430 secs
lola: 87996275 markings, 348631201 edges, 200633 markings/sec, 435 secs
lola: 88913165 markings, 352344711 edges, 183378 markings/sec, 440 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((G ((p22 + 1 <= p5)) AND (p24 <= 1)) OR (F ((2 <= p24)) OR (p12 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((G ((p22 + 1 <= p5)) AND (p24 <= 1)) OR (F ((2 <= p24)) OR (p12 <= 2)))))
lola: processed formula length: 80
lola: 69 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: 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 12 will run for 3112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p5 + 1 <= p20)) OR G ((F ((1 <= p4)) AND ((1 <= p13) OR (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p5 + 1 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p20 <= p5)
lola: processed formula length: 11
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 201 markings, 201 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: ((p4 <= 1) R ((p4 <= p18) AND (F ((p18 + 1 <= p4)) OR G ((p4 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p4 <= 1) R ((p4 <= p18) AND (F ((p18 + 1 <= p4)) OR G ((p4 <= p18)))))
lola: processed formula length: 72
lola: 69 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: 1380517 markings, 5007340 edges, 276103 markings/sec, 0 secs
lola: 2661759 markings, 9868615 edges, 256248 markings/sec, 5 secs
lola: 3918911 markings, 14685884 edges, 251430 markings/sec, 10 secs
lola: 5174751 markings, 19454241 edges, 251168 markings/sec, 15 secs
lola: 6404519 markings, 24198798 edges, 245954 markings/sec, 20 secs
lola: 7623888 markings, 28972393 edges, 243874 markings/sec, 25 secs
lola: 8831811 markings, 33722495 edges, 241585 markings/sec, 30 secs
lola: 10033998 markings, 38412016 edges, 240437 markings/sec, 35 secs
lola: 11263420 markings, 43107652 edges, 245884 markings/sec, 40 secs
lola: 12501310 markings, 47769785 edges, 247578 markings/sec, 45 secs
lola: 13713189 markings, 52493098 edges, 242376 markings/sec, 50 secs
lola: 14877270 markings, 57245592 edges, 232816 markings/sec, 55 secs
lola: 16104409 markings, 61904226 edges, 245428 markings/sec, 60 secs
lola: 17314887 markings, 66533126 edges, 242096 markings/sec, 65 secs
lola: 18522437 markings, 71170389 edges, 241510 markings/sec, 70 secs
lola: 19700843 markings, 75889095 edges, 235681 markings/sec, 75 secs
lola: 20862520 markings, 80610162 edges, 232335 markings/sec, 80 secs
lola: 22036980 markings, 85329873 edges, 234892 markings/sec, 85 secs
lola: 23216081 markings, 89992019 edges, 235820 markings/sec, 90 secs
lola: 24357109 markings, 94679145 edges, 228206 markings/sec, 95 secs
lola: 25561607 markings, 99266203 edges, 240900 markings/sec, 100 secs
lola: 26749111 markings, 103853825 edges, 237501 markings/sec, 105 secs
lola: 27898977 markings, 108548889 edges, 229973 markings/sec, 110 secs
lola: 29079407 markings, 113233184 edges, 236086 markings/sec, 115 secs
lola: 30271863 markings, 117886801 edges, 238491 markings/sec, 120 secs
lola: 31475892 markings, 122534402 edges, 240806 markings/sec, 125 secs
lola: 32622286 markings, 127162017 edges, 229279 markings/sec, 130 secs
lola: 33784527 markings, 131800415 edges, 232448 markings/sec, 135 secs
lola: 34945693 markings, 136473844 edges, 232233 markings/sec, 140 secs
lola: 36126376 markings, 141133995 edges, 236137 markings/sec, 145 secs
lola: 37307406 markings, 145710063 edges, 236206 markings/sec, 150 secs
lola: 38491180 markings, 150300712 edges, 236755 markings/sec, 155 secs
lola: 39652014 markings, 154926481 edges, 232167 markings/sec, 160 secs
lola: 40812216 markings, 159538036 edges, 232040 markings/sec, 165 secs
lola: 41958183 markings, 164215217 edges, 229193 markings/sec, 170 secs
lola: 43123281 markings, 168880167 edges, 233020 markings/sec, 175 secs
lola: 44241714 markings, 173485957 edges, 223687 markings/sec, 180 secs
lola: 45395185 markings, 178128449 edges, 230694 markings/sec, 185 secs
lola: 46566720 markings, 182752154 edges, 234307 markings/sec, 190 secs
lola: 47724095 markings, 187411821 edges, 231475 markings/sec, 195 secs
lola: 48881972 markings, 192050681 edges, 231575 markings/sec, 200 secs
lola: 50047719 markings, 196679175 edges, 233149 markings/sec, 205 secs
lola: 51171069 markings, 201327323 edges, 224670 markings/sec, 210 secs
lola: 52330906 markings, 205885872 edges, 231967 markings/sec, 215 secs
lola: 53515207 markings, 210407655 edges, 236860 markings/sec, 220 secs
lola: 54650191 markings, 215004733 edges, 226997 markings/sec, 225 secs
lola: 55826774 markings, 219621256 edges, 235317 markings/sec, 230 secs
lola: 56952799 markings, 224257889 edges, 225205 markings/sec, 235 secs
lola: 58099840 markings, 228879184 edges, 229408 markings/sec, 240 secs
lola: 59241845 markings, 233483267 edges, 228401 markings/sec, 245 secs
lola: 60398849 markings, 238050042 edges, 231401 markings/sec, 250 secs
lola: 61592005 markings, 242606218 edges, 238631 markings/sec, 255 secs
lola: 62715679 markings, 247235605 edges, 224735 markings/sec, 260 secs
lola: 63873181 markings, 251821993 edges, 231500 markings/sec, 265 secs
lola: 64996430 markings, 256460505 edges, 224650 markings/sec, 270 secs
lola: 66159967 markings, 261017922 edges, 232707 markings/sec, 275 secs
lola: 67269264 markings, 265573344 edges, 221859 markings/sec, 280 secs
lola: 68452563 markings, 270104571 edges, 236660 markings/sec, 285 secs
lola: 69604153 markings, 274737725 edges, 230318 markings/sec, 290 secs
lola: 70768785 markings, 279371711 edges, 232926 markings/sec, 295 secs
lola: 71864395 markings, 283614581 edges, 219122 markings/sec, 300 secs
lola: 72687607 markings, 287047976 edges, 164642 markings/sec, 305 secs
lola: 73612312 markings, 290769812 edges, 184941 markings/sec, 310 secs
lola: 74726555 markings, 295144869 edges, 222849 markings/sec, 315 secs
lola: 75781089 markings, 299430024 edges, 210907 markings/sec, 320 secs
lola: 76875869 markings, 303775494 edges, 218956 markings/sec, 325 secs
lola: 77846871 markings, 307759902 edges, 194200 markings/sec, 330 secs
lola: 78864220 markings, 311855479 edges, 203470 markings/sec, 335 secs
lola: 79556617 markings, 314736468 edges, 138479 markings/sec, 340 secs
lola: 80424883 markings, 318091281 edges, 173653 markings/sec, 345 secs
lola: 81009883 markings, 320537250 edges, 117000 markings/sec, 350 secs
lola: 81812265 markings, 323897906 edges, 160476 markings/sec, 355 secs
lola: 82620352 markings, 327222649 edges, 161617 markings/sec, 360 secs
lola: 83506869 markings, 330830878 edges, 177303 markings/sec, 365 secs
lola: 84340591 markings, 334328069 edges, 166744 markings/sec, 370 secs
lola: 85352088 markings, 338348193 edges, 202299 markings/sec, 375 secs
lola: 86187095 markings, 341634801 edges, 167001 markings/sec, 380 secs
lola: 87071465 markings, 345132585 edges, 176874 markings/sec, 385 secs
lola: 87603314 markings, 347092732 edges, 106370 markings/sec, 390 secs
lola: 88188560 markings, 349434008 edges, 117049 markings/sec, 395 secs
lola: 89066039 markings, 352941290 edges, 175496 markings/sec, 400 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((p5 + 1 <= p20)) OR G ((F ((1 <= p4)) AND ((1 <= p13) OR (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p5 + 1 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p20 <= p5)
lola: processed formula length: 11
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 201 markings, 201 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p4)) AND ((1 <= p13) OR (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p4)) AND ((1 <= p13) OR (1 <= p4))))
lola: processed formula length: 49
lola: 69 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: 207 markings, 207 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no unknown yes no yes no no no
lola:
preliminary result: no no yes no yes no unknown yes no yes no no no
lola: memory consumption: 3796 KB
lola: time consumption: 868 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-D05N200"
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-D05N200, 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-162048902200017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D05N200.tgz
mv Diffusion2D-PT-D05N200 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 ;