Processing 326 files... ...................................................................................................................................................................................................................................................................................................................................... 132 of valid (0 tried bit-precise analysis, 0 succeeded) 87 safe 45 unsafe 178 exceptions 97 : Unable to prove that all allocated memory was freed 15 : SyntaxErrorResult 12 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: ldv_malloc: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 11 : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) 10 : UnsupportedSyntaxResult 7 : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) 5 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: create_item: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 4 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: hid_register_report: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 2 : TypeErrorResult 2 : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) 2 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: create_tree: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 2 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: create_sl_with_head_and_tail: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 2 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: calloc_model: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 2 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: alloc_21: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 2 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: alloc_16: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 1 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: dll_create_master: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 1 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: create_sll: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 1 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: alloc_unsafe_16: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 6 timeouts 2 : Cannot interrupt operation gracefully because timeout expired. Forcing shutdown 1 : Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). 1 : Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was analyzing trace of length 298 with TraceHistMax 59, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. 1 : Unable to prove that array index is always in bounds (line 17). Cancelled while BasicCegarLoop was constructing difference of abstraction (648states) and interpolant automaton (currently 47 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (711 states constructedinput type IntersectNwa). 1 : Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 301 with TraceHistMax 71, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates. Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was analyzing trace of length 298 with TraceHistMax 59, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was analyzing trace of length 298 with TraceHistMax 59, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. Unable to prove that array index is always in bounds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (648states) and interpolant automaton (currently 47 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (711 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 24). Cancelled while BasicCegarLoop was constructing difference of abstraction (648states) and interpolant automaton (currently 47 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (711 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 19). Cancelled while BasicCegarLoop was constructing difference of abstraction (648states) and interpolant automaton (currently 47 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (711 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 301 with TraceHistMax 71, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates. Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 298 with TraceHistMax 59, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 298 with TraceHistMax 59, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). 10 unknowns 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol.test-0504_1_true-valid-memsafety.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol.test-0237_true-valid-memsafety.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol.test-0236_true-valid-memsafety.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol.test-0235_true-valid-memsafety.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol.test-0235_false-valid-memtrack.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol.test-0235_false-valid-deref.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol.test-0234_true-valid-memsafety.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol.test-0234_false-valid-memtrack.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol.mult_array_unsafe_false-valid-deref.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol.mult_array-alloca_true-valid-memsafety_true-termination.i.log