java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:39:23,958 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:39:23,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:39:23,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:39:23,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:39:23,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:39:23,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:39:23,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:39:23,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:39:23,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:39:23,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:39:23,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:39:23,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:39:23,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:39:23,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:39:23,984 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:39:23,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:39:23,986 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:39:23,986 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:39:23,987 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:39:23,989 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:39:23,989 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:39:23,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:39:23,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:39:23,990 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:39:23,991 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:39:23,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:39:23,992 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:39:23,992 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:39:23,992 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:39:23,993 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:39:23,993 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:39:24,001 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:39:24,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:39:24,002 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:39:24,002 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:39:24,002 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:39:24,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:39:24,002 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:39:24,002 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:39:24,002 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:39:24,003 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:39:24,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:39:24,003 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:39:24,003 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:39:24,003 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:39:24,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:39:24,003 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:39:24,003 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:39:24,003 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:39:24,004 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:39:24,004 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:39:24,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:39:24,004 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:39:24,004 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:39:24,004 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:39:24,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:39:24,037 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:39:24,040 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:39:24,041 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:39:24,041 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:39:24,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i [2018-02-02 10:39:24,175 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:39:24,176 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:39:24,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:39:24,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:39:24,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:39:24,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:39:24" (1/1) ... [2018-02-02 10:39:24,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fc3123a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:24, skipping insertion in model container [2018-02-02 10:39:24,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:39:24" (1/1) ... [2018-02-02 10:39:24,203 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:39:24,240 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:39:24,327 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:39:24,342 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:39:24,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:24 WrapperNode [2018-02-02 10:39:24,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:39:24,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:39:24,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:39:24,354 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:39:24,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:24" (1/1) ... [2018-02-02 10:39:24,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:24" (1/1) ... [2018-02-02 10:39:24,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:24" (1/1) ... [2018-02-02 10:39:24,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:24" (1/1) ... [2018-02-02 10:39:24,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:24" (1/1) ... [2018-02-02 10:39:24,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:24" (1/1) ... [2018-02-02 10:39:24,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:24" (1/1) ... [2018-02-02 10:39:24,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:39:24,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:39:24,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:39:24,380 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:39:24,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:24" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:39:24,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:39:24,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:39:24,422 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-02 10:39:24,422 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-02-02 10:39:24,422 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-02-02 10:39:24,423 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-02-02 10:39:24,423 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-02-02 10:39:24,423 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-02-02 10:39:24,423 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-02-02 10:39:24,423 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-02-02 10:39:24,423 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:39:24,423 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:39:24,423 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:39:24,423 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:39:24,424 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:39:24,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:39:24,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:39:24,424 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:39:24,424 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:39:24,424 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 10:39:24,424 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:39:24,424 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-02 10:39:24,424 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-02-02 10:39:24,425 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-02-02 10:39:24,425 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-02-02 10:39:24,425 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-02-02 10:39:24,425 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-02-02 10:39:24,425 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-02-02 10:39:24,425 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-02-02 10:39:24,425 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:39:24,425 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:39:24,425 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:39:24,741 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:39:24,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:39:24 BoogieIcfgContainer [2018-02-02 10:39:24,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:39:24,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:39:24,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:39:24,745 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:39:24,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:39:24" (1/3) ... [2018-02-02 10:39:24,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e37e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:39:24, skipping insertion in model container [2018-02-02 10:39:24,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:24" (2/3) ... [2018-02-02 10:39:24,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e37e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:39:24, skipping insertion in model container [2018-02-02 10:39:24,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:39:24" (3/3) ... [2018-02-02 10:39:24,748 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0102_true-valid-memsafety.i [2018-02-02 10:39:24,756 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:39:24,765 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-02-02 10:39:24,793 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:39:24,793 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:39:24,793 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:39:24,793 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:39:24,793 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:39:24,794 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:39:24,794 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:39:24,794 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:39:24,795 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:39:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-02-02 10:39:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:39:24,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:24,819 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:24,819 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:24,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2078311652, now seen corresponding path program 1 times [2018-02-02 10:39:24,875 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:24,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:24,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:24,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:39:24,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:24,954 INFO L182 omatonBuilderFactory]: Interpolants [123#true, 124#false, 125#(= 1 (select |#valid| |main_~#top~1.base|))] [2018-02-02 10:39:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:24,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:39:24,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:39:24,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:39:24,970 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 3 states. [2018-02-02 10:39:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:25,143 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-02-02 10:39:25,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:39:25,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:39:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:25,156 INFO L225 Difference]: With dead ends: 118 [2018-02-02 10:39:25,156 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:39:25,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:39:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:39:25,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 10:39:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:39:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-02 10:39:25,200 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 7 [2018-02-02 10:39:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:25,200 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-02 10:39:25,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:39:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-02 10:39:25,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:39:25,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:25,201 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:25,201 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:25,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2078311651, now seen corresponding path program 1 times [2018-02-02 10:39:25,202 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:25,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:25,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:39:25,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,264 INFO L182 omatonBuilderFactory]: Interpolants [359#true, 360#false, 361#(and (= |main_~#top~1.offset| 0) (= (select |#length| |main_~#top~1.base|) 8))] [2018-02-02 10:39:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:39:25,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:39:25,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:39:25,266 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 3 states. [2018-02-02 10:39:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:25,333 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-02-02 10:39:25,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:39:25,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:39:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:25,334 INFO L225 Difference]: With dead ends: 113 [2018-02-02 10:39:25,334 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 10:39:25,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:39:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 10:39:25,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 10:39:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 10:39:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-02 10:39:25,343 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 7 [2018-02-02 10:39:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:25,343 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-02 10:39:25,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:39:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-02 10:39:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:39:25,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:25,344 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:25,344 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:25,344 INFO L82 PathProgramCache]: Analyzing trace with hash -491558478, now seen corresponding path program 1 times [2018-02-02 10:39:25,345 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:25,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:25,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:39:25,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,419 INFO L182 omatonBuilderFactory]: Interpolants [592#(= 1 (select |#valid| |create_sub_list_#in~sub.base|)), 593#(= 1 (select |#valid| create_sub_list_~sub.base)), 588#true, 589#false, 590#(= 1 (select |#valid| |insert_top_#t~malloc14.base|)), 591#(= 1 (select |#valid| insert_top_~top~0.base))] [2018-02-02 10:39:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:39:25,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:39:25,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:39:25,420 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-02-02 10:39:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:25,583 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 10:39:25,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:39:25,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:39:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:25,586 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:39:25,586 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:39:25,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:39:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:39:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2018-02-02 10:39:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:39:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-02-02 10:39:25,595 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 19 [2018-02-02 10:39:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:25,596 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-02-02 10:39:25,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:39:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-02-02 10:39:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:39:25,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:25,597 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:25,597 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:25,597 INFO L82 PathProgramCache]: Analyzing trace with hash -491558477, now seen corresponding path program 1 times [2018-02-02 10:39:25,598 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:25,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:25,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:39:25,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,688 INFO L182 omatonBuilderFactory]: Interpolants [833#true, 834#false, 835#(and (= 24 (select |#length| |insert_top_#t~malloc14.base|)) (= 0 |insert_top_#t~malloc14.offset|)), 836#(and (= 24 (select |#length| insert_top_~top~0.base)) (= insert_top_~top~0.offset 0)), 837#(and (= 24 (select |#length| |create_sub_list_#in~sub.base|)) (<= |create_sub_list_#in~sub.offset| 8) (<= 8 |create_sub_list_#in~sub.offset|)), 838#(and (<= create_sub_list_~sub.offset 8) (<= 8 create_sub_list_~sub.offset) (= (select |#length| create_sub_list_~sub.base) 24))] [2018-02-02 10:39:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:39:25,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:39:25,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:39:25,689 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 6 states. [2018-02-02 10:39:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:25,828 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-02-02 10:39:25,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:39:25,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:39:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:25,831 INFO L225 Difference]: With dead ends: 117 [2018-02-02 10:39:25,832 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 10:39:25,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:39:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 10:39:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-02-02 10:39:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:39:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-02 10:39:25,837 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 19 [2018-02-02 10:39:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:25,838 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-02 10:39:25,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:39:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-02 10:39:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:39:25,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:25,839 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:25,839 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:25,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1908309148, now seen corresponding path program 1 times [2018-02-02 10:39:25,840 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:25,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:25,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:39:25,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,894 INFO L182 omatonBuilderFactory]: Interpolants [1075#true, 1076#false, 1077#(= 1 (select |#valid| |insert_sub_#t~malloc9.base|)), 1078#(= 1 (select |#valid| insert_sub_~sub~0.base))] [2018-02-02 10:39:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:25,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:39:25,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:39:25,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:39:25,895 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 4 states. [2018-02-02 10:39:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:25,950 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-02-02 10:39:25,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:39:25,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-02 10:39:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:25,951 INFO L225 Difference]: With dead ends: 114 [2018-02-02 10:39:25,951 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:39:25,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:39:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:39:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 10:39:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:39:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-02-02 10:39:25,955 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 27 [2018-02-02 10:39:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:25,956 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-02-02 10:39:25,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:39:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-02-02 10:39:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:39:25,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:25,956 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:25,956 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:25,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1908309147, now seen corresponding path program 1 times [2018-02-02 10:39:25,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:25,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:26,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:26,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:39:26,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:26,028 INFO L182 omatonBuilderFactory]: Interpolants [1312#(and (= insert_sub_~sub~0.offset 0) (= (select |#length| insert_sub_~sub~0.base) 12)), 1309#true, 1310#false, 1311#(and (= 12 (select |#length| |insert_sub_#t~malloc9.base|)) (= 0 |insert_sub_#t~malloc9.offset|))] [2018-02-02 10:39:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:26,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:39:26,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:39:26,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:39:26,028 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 4 states. [2018-02-02 10:39:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:26,083 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-02-02 10:39:26,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:39:26,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-02 10:39:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:26,085 INFO L225 Difference]: With dead ends: 113 [2018-02-02 10:39:26,085 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 10:39:26,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:39:26,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 10:39:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 10:39:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 10:39:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-02 10:39:26,089 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 27 [2018-02-02 10:39:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:26,089 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-02 10:39:26,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:39:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-02 10:39:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:39:26,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:26,090 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:26,090 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:26,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2044398882, now seen corresponding path program 1 times [2018-02-02 10:39:26,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:26,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:26,113 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:39:26,117 INFO L168 Benchmark]: Toolchain (without parser) took 1941.45 ms. Allocated memory was 399.0 MB in the beginning and 598.2 MB in the end (delta: 199.2 MB). Free memory was 355.7 MB in the beginning and 413.1 MB in the end (delta: -57.4 MB). Peak memory consumption was 141.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:39:26,118 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 399.0 MB. Free memory is still 361.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:39:26,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.04 ms. Allocated memory is still 399.0 MB. Free memory was 355.7 MB in the beginning and 342.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:39:26,118 INFO L168 Benchmark]: Boogie Preprocessor took 25.74 ms. Allocated memory is still 399.0 MB. Free memory is still 342.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:39:26,118 INFO L168 Benchmark]: RCFGBuilder took 361.86 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 309.4 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:39:26,119 INFO L168 Benchmark]: TraceAbstraction took 1374.24 ms. Allocated memory was 399.0 MB in the beginning and 598.2 MB in the end (delta: 199.2 MB). Free memory was 306.8 MB in the beginning and 413.1 MB in the end (delta: -106.3 MB). Peak memory consumption was 92.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:39:26,120 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 399.0 MB. Free memory is still 361.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.04 ms. Allocated memory is still 399.0 MB. Free memory was 355.7 MB in the beginning and 342.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.74 ms. Allocated memory is still 399.0 MB. Free memory is still 342.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 361.86 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 309.4 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1374.24 ms. Allocated memory was 399.0 MB in the beginning and 598.2 MB in the end (delta: 199.2 MB). Free memory was 306.8 MB in the beginning and 413.1 MB in the end (delta: -106.3 MB). Peak memory consumption was 92.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-39-26-126.csv Received shutdown request...