Julian Erhard
Julian Erhard
@adelavais is working on this.
Before merging this, one should verify whether the handling of non-unique mallocs is sound here, e.g. for a program segment: ```C int n = 1 + (rand() % 5); for(int...
For the program optimization class (@izycheva) another style of control flow graphs is used. There: 1. regular nodes are drawn as circles. 2. start nodes are marked with an incoming...
@iozbeyli I guess we will discuss next week how we will proceed with program optimization, and then possibly create a separate issue.
@iozbeyli For now one kind of control flow graph (the one presented in the original post of this issue) will be sufficient.
Goblint also crashes with an `IncompatibleIkinds` exception on the sqlite-amalgamation in [some configuration](https://github.com/goblint/analyzer/pull/888#issuecomment-1327694371).
>Do you have a line number here? No, not yet, this was run on a version of Goblint that did not print the lint number. I now started a run...
Now with #931 merged, there is a whole stack of line numbers: Stack trace ``` Fatal error: exception Goblint_lib.IntDomain.IncompatibleIKinds("ikinds int and unsigned long are incompatible. Values: (0) and (0)") Marked...
>In particular, the access analysis has some type-based unknowns which cannot be manually restarted otherwise. Can you elaborate on this? Which typed-based unknowns cannot be manually restarted in the access...
@just-max Ok, so I guess the general steps to implement this would be as follows: 1. Extend the type `VarQuery.t` with a variant for C-types. 2. Allow for types as...