/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:21:45,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:21:45,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:21:45,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:21:45,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:21:45,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:21:45,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:21:45,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:21:45,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:21:45,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:21:45,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:21:45,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:21:45,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:21:45,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:21:45,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:21:45,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:21:45,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:21:45,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:21:45,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:21:45,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:21:45,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:21:45,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:21:45,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:21:45,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:21:45,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:21:45,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:21:45,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:21:45,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:21:45,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:21:45,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:21:45,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:21:45,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:21:45,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:21:45,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:21:45,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:21:45,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:21:45,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:21:45,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:21:45,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:21:45,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:21:45,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:21:45,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:21:45,900 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:21:45,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:21:45,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:21:45,902 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:21:45,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:21:45,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:21:45,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:21:45,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:21:45,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:21:45,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:21:45,903 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:21:45,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:21:45,903 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:21:45,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:21:45,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:21:45,904 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:21:45,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:21:45,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:21:45,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:21:45,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:21:45,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:21:45,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:21:45,905 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 22:21:46,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:21:46,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:21:46,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:21:46,180 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:21:46,180 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:21:46,181 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list.i [2020-07-08 22:21:46,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26eccaf9/c942e031118e46eba6a07049e0fbbd0b/FLAG4ec241798 [2020-07-08 22:21:46,756 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:21:46,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list.i [2020-07-08 22:21:46,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26eccaf9/c942e031118e46eba6a07049e0fbbd0b/FLAG4ec241798 [2020-07-08 22:21:47,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26eccaf9/c942e031118e46eba6a07049e0fbbd0b [2020-07-08 22:21:47,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:21:47,086 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:21:47,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:21:47,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:21:47,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:21:47,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:21:47" (1/1) ... [2020-07-08 22:21:47,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f60729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:47, skipping insertion in model container [2020-07-08 22:21:47,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:21:47" (1/1) ... [2020-07-08 22:21:47,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:21:47,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:21:47,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:21:47,631 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:21:47,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:21:47,765 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:21:47,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:47 WrapperNode [2020-07-08 22:21:47,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:21:47,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:21:47,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:21:47,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:21:47,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:47" (1/1) ... [2020-07-08 22:21:47,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:47" (1/1) ... [2020-07-08 22:21:47,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:47" (1/1) ... [2020-07-08 22:21:47,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:47" (1/1) ... [2020-07-08 22:21:47,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:47" (1/1) ... [2020-07-08 22:21:47,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:47" (1/1) ... [2020-07-08 22:21:47,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:47" (1/1) ... [2020-07-08 22:21:47,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:21:47,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:21:47,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:21:47,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:21:47,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:47" (1/1) ... No working directory specified, using /storage/repos/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 [2020-07-08 22:21:47,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:21:47,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:21:47,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-07-08 22:21:47,921 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2020-07-08 22:21:47,921 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2020-07-08 22:21:47,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:21:47,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:21:47,921 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-07-08 22:21:47,921 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2020-07-08 22:21:47,922 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2020-07-08 22:21:47,922 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2020-07-08 22:21:47,923 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2020-07-08 22:21:47,923 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2020-07-08 22:21:47,923 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2020-07-08 22:21:47,923 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2020-07-08 22:21:47,924 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2020-07-08 22:21:47,924 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2020-07-08 22:21:47,924 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2020-07-08 22:21:47,924 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2020-07-08 22:21:47,925 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2020-07-08 22:21:47,925 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2020-07-08 22:21:47,926 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2020-07-08 22:21:47,927 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2020-07-08 22:21:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2020-07-08 22:21:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2020-07-08 22:21:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2020-07-08 22:21:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2020-07-08 22:21:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2020-07-08 22:21:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2020-07-08 22:21:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2020-07-08 22:21:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2020-07-08 22:21:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2020-07-08 22:21:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2020-07-08 22:21:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2020-07-08 22:21:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2020-07-08 22:21:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2020-07-08 22:21:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2020-07-08 22:21:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2020-07-08 22:21:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2020-07-08 22:21:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2020-07-08 22:21:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2020-07-08 22:21:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2020-07-08 22:21:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2020-07-08 22:21:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2020-07-08 22:21:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2020-07-08 22:21:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2020-07-08 22:21:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2020-07-08 22:21:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2020-07-08 22:21:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2020-07-08 22:21:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2020-07-08 22:21:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2020-07-08 22:21:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2020-07-08 22:21:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2020-07-08 22:21:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2020-07-08 22:21:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2020-07-08 22:21:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2020-07-08 22:21:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2020-07-08 22:21:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2020-07-08 22:21:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2020-07-08 22:21:47,934 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2020-07-08 22:21:47,934 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2020-07-08 22:21:47,934 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2020-07-08 22:21:47,934 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-07-08 22:21:47,934 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2020-07-08 22:21:47,934 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2020-07-08 22:21:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2020-07-08 22:21:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2020-07-08 22:21:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2020-07-08 22:21:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2020-07-08 22:21:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2020-07-08 22:21:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2020-07-08 22:21:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2020-07-08 22:21:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2020-07-08 22:21:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2020-07-08 22:21:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2020-07-08 22:21:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2020-07-08 22:21:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2020-07-08 22:21:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2020-07-08 22:21:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2020-07-08 22:21:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2020-07-08 22:21:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2020-07-08 22:21:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2020-07-08 22:21:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2020-07-08 22:21:47,939 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2020-07-08 22:21:47,939 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2020-07-08 22:21:47,939 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2020-07-08 22:21:47,939 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2020-07-08 22:21:47,940 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2020-07-08 22:21:47,940 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2020-07-08 22:21:47,940 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2020-07-08 22:21:47,941 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2020-07-08 22:21:47,941 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2020-07-08 22:21:47,941 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2020-07-08 22:21:47,941 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2020-07-08 22:21:47,941 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2020-07-08 22:21:47,942 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2020-07-08 22:21:47,942 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2020-07-08 22:21:47,942 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2020-07-08 22:21:47,942 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2020-07-08 22:21:47,942 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2020-07-08 22:21:47,943 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2020-07-08 22:21:47,943 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2020-07-08 22:21:47,943 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2020-07-08 22:21:47,943 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2020-07-08 22:21:47,943 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2020-07-08 22:21:47,943 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2020-07-08 22:21:47,943 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2020-07-08 22:21:47,944 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2020-07-08 22:21:47,944 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2020-07-08 22:21:47,944 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 22:21:47,944 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 22:21:47,944 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-08 22:21:47,944 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 22:21:47,944 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-08 22:21:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2020-07-08 22:21:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-08 22:21:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2020-07-08 22:21:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2020-07-08 22:21:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2020-07-08 22:21:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2020-07-08 22:21:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2020-07-08 22:21:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2020-07-08 22:21:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2020-07-08 22:21:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2020-07-08 22:21:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2020-07-08 22:21:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2020-07-08 22:21:47,947 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2020-07-08 22:21:47,947 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2020-07-08 22:21:47,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 22:21:47,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 22:21:47,948 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2020-07-08 22:21:47,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:21:47,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 22:21:47,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:21:47,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 22:21:47,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-08 22:21:47,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-08 22:21:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:21:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 22:21:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 22:21:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 22:21:48,527 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:21:48,527 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 22:21:48,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:21:48 BoogieIcfgContainer [2020-07-08 22:21:48,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:21:48,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:21:48,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:21:48,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:21:48,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:21:47" (1/3) ... [2020-07-08 22:21:48,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325c8a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:21:48, skipping insertion in model container [2020-07-08 22:21:48,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:47" (2/3) ... [2020-07-08 22:21:48,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325c8a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:21:48, skipping insertion in model container [2020-07-08 22:21:48,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:21:48" (3/3) ... [2020-07-08 22:21:48,541 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list.i [2020-07-08 22:21:48,554 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:21:48,562 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:21:48,578 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:21:48,602 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:21:48,602 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:21:48,602 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:21:48,602 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:21:48,603 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:21:48,603 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:21:48,603 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:21:48,603 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:21:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-08 22:21:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 22:21:48,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:21:48,648 INFO L422 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] [2020-07-08 22:21:48,648 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:21:48,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:21:48,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1815251874, now seen corresponding path program 1 times [2020-07-08 22:21:48,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:21:48,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [647728837] [2020-07-08 22:21:48,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:21:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:49,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-08 22:21:49,295 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-08 22:21:49,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-08 22:21:49,297 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,298 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,299 INFO L280 TraceCheckUtils]: 5: Hoare triple {59#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,300 INFO L280 TraceCheckUtils]: 6: Hoare triple {59#(= |~#head~0.offset| 0)} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,301 INFO L280 TraceCheckUtils]: 7: Hoare triple {59#(= |~#head~0.offset| 0)} assume true; {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,304 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {59#(= |~#head~0.offset| 0)} {48#true} #65#return; {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,309 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {66#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} is VALID [2020-07-08 22:21:49,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-08 22:21:49,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-08 22:21:49,310 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-08 22:21:49,311 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,312 INFO L280 TraceCheckUtils]: 5: Hoare triple {59#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,312 INFO L280 TraceCheckUtils]: 6: Hoare triple {59#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,314 INFO L280 TraceCheckUtils]: 7: Hoare triple {59#(= |~#head~0.offset| 0)} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,315 INFO L280 TraceCheckUtils]: 8: Hoare triple {59#(= |~#head~0.offset| 0)} assume true; {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,317 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {59#(= |~#head~0.offset| 0)} {48#true} #65#return; {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,319 INFO L263 TraceCheckUtils]: 10: Hoare triple {59#(= |~#head~0.offset| 0)} call #t~ret31 := main(); {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,321 INFO L280 TraceCheckUtils]: 11: Hoare triple {59#(= |~#head~0.offset| 0)} havoc ~dev~0.base, ~dev~0.offset; {59#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:49,322 INFO L280 TraceCheckUtils]: 12: Hoare triple {59#(= |~#head~0.offset| 0)} SUMMARY for call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(12); srcloc: L880 {60#(and (= |~#head~0.offset| 0) (= 0 |main_#t~malloc30.offset|))} is VALID [2020-07-08 22:21:49,323 INFO L280 TraceCheckUtils]: 13: Hoare triple {60#(and (= |~#head~0.offset| 0) (= 0 |main_#t~malloc30.offset|))} ~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {61#(and (= |~#head~0.offset| 0) (= |~#head~0.offset| main_~dev~0.offset))} is VALID [2020-07-08 22:21:49,325 INFO L280 TraceCheckUtils]: 14: Hoare triple {61#(and (= |~#head~0.offset| 0) (= |~#head~0.offset| main_~dev~0.offset))} assume ~dev~0.base != 0 || ~dev~0.offset != 0; {61#(and (= |~#head~0.offset| 0) (= |~#head~0.offset| main_~dev~0.offset))} is VALID [2020-07-08 22:21:49,327 INFO L280 TraceCheckUtils]: 15: Hoare triple {61#(and (= |~#head~0.offset| 0) (= |~#head~0.offset| main_~dev~0.offset))} SUMMARY for call write~int(0, ~dev~0.base, 8 + ~dev~0.offset, 4); srcloc: L882 {62#(and (= 0 (select (select |#memory_int| main_~dev~0.base) (+ main_~dev~0.offset 8))) (= |~#head~0.offset| 0) (= |~#head~0.offset| main_~dev~0.offset))} is VALID [2020-07-08 22:21:49,329 INFO L263 TraceCheckUtils]: 16: Hoare triple {62#(and (= 0 (select (select |#memory_int| main_~dev~0.base) (+ main_~dev~0.offset 8))) (= |~#head~0.offset| 0) (= |~#head~0.offset| main_~dev~0.offset))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {63#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} is VALID [2020-07-08 22:21:49,330 INFO L280 TraceCheckUtils]: 17: Hoare triple {63#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {64#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} is VALID [2020-07-08 22:21:49,331 INFO L280 TraceCheckUtils]: 18: Hoare triple {64#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {64#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} is VALID [2020-07-08 22:21:49,332 INFO L280 TraceCheckUtils]: 19: Hoare triple {64#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {65#(= 0 |list_add_#t~mem28|)} is VALID [2020-07-08 22:21:49,333 INFO L280 TraceCheckUtils]: 20: Hoare triple {65#(= 0 |list_add_#t~mem28|)} assume !(0 == #t~mem28); {49#false} is VALID [2020-07-08 22:21:49,333 INFO L263 TraceCheckUtils]: 21: Hoare triple {49#false} call __blast_assert(); {49#false} is VALID [2020-07-08 22:21:49,333 INFO L280 TraceCheckUtils]: 22: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-08 22:21:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:21:49,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [647728837] [2020-07-08 22:21:49,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:21:49,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 22:21:49,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648709924] [2020-07-08 22:21:49,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-07-08 22:21:49,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:21:49,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 22:21:49,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:49,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 22:21:49,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:21:49,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 22:21:49,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-08 22:21:49,423 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 10 states. [2020-07-08 22:21:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:50,801 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2020-07-08 22:21:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 22:21:50,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-07-08 22:21:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:21:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 22:21:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2020-07-08 22:21:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 22:21:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2020-07-08 22:21:50,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 88 transitions. [2020-07-08 22:21:51,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:51,062 INFO L225 Difference]: With dead ends: 77 [2020-07-08 22:21:51,062 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 22:21:51,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2020-07-08 22:21:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 22:21:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-08 22:21:51,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:21:51,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-08 22:21:51,268 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-08 22:21:51,268 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-08 22:21:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:51,284 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 22:21:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-08 22:21:51,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:51,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:51,285 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-08 22:21:51,285 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-08 22:21:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:51,292 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 22:21:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-08 22:21:51,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:51,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:51,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:21:51,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:21:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 22:21:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2020-07-08 22:21:51,301 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 23 [2020-07-08 22:21:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:21:51,302 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2020-07-08 22:21:51,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 22:21:51,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2020-07-08 22:21:51,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-08 22:21:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 22:21:51,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:21:51,378 INFO L422 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, 1] [2020-07-08 22:21:51,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:21:51,379 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:21:51,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:21:51,380 INFO L82 PathProgramCache]: Analyzing trace with hash -953108253, now seen corresponding path program 1 times [2020-07-08 22:21:51,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:21:51,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [216288427] [2020-07-08 22:21:51,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:21:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:51,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {431#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {405#true} is VALID [2020-07-08 22:21:51,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {405#true} #valid := #valid[0 := 0]; {405#true} is VALID [2020-07-08 22:21:51,627 INFO L280 TraceCheckUtils]: 2: Hoare triple {405#true} assume 0 < #StackHeapBarrier; {405#true} is VALID [2020-07-08 22:21:51,628 INFO L280 TraceCheckUtils]: 3: Hoare triple {405#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,628 INFO L280 TraceCheckUtils]: 4: Hoare triple {416#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,629 INFO L280 TraceCheckUtils]: 5: Hoare triple {416#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,630 INFO L280 TraceCheckUtils]: 6: Hoare triple {416#(= |~#head~0.offset| 0)} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,630 INFO L280 TraceCheckUtils]: 7: Hoare triple {416#(= |~#head~0.offset| 0)} assume true; {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,631 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {416#(= |~#head~0.offset| 0)} {405#true} #65#return; {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:51,757 INFO L280 TraceCheckUtils]: 0: Hoare triple {432#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-08 22:21:51,758 INFO L280 TraceCheckUtils]: 1: Hoare triple {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-08 22:21:51,759 INFO L280 TraceCheckUtils]: 2: Hoare triple {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-08 22:21:51,760 INFO L280 TraceCheckUtils]: 3: Hoare triple {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} assume 0 == #t~mem28; {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-08 22:21:51,760 INFO L280 TraceCheckUtils]: 4: Hoare triple {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} havoc #t~mem28; {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-08 22:21:51,762 INFO L280 TraceCheckUtils]: 5: Hoare triple {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} SUMMARY for call write~int(1, ~new.base, 8 + ~new.offset, 4); srcloc: L868 {434#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-08 22:21:51,763 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} assume true; {434#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-08 22:21:51,765 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {434#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} {418#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} #55#return; {427#(and (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:51,767 INFO L263 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {431#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} is VALID [2020-07-08 22:21:51,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {431#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {405#true} is VALID [2020-07-08 22:21:51,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {405#true} #valid := #valid[0 := 0]; {405#true} is VALID [2020-07-08 22:21:51,767 INFO L280 TraceCheckUtils]: 3: Hoare triple {405#true} assume 0 < #StackHeapBarrier; {405#true} is VALID [2020-07-08 22:21:51,768 INFO L280 TraceCheckUtils]: 4: Hoare triple {405#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,769 INFO L280 TraceCheckUtils]: 5: Hoare triple {416#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,770 INFO L280 TraceCheckUtils]: 6: Hoare triple {416#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,770 INFO L280 TraceCheckUtils]: 7: Hoare triple {416#(= |~#head~0.offset| 0)} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,771 INFO L280 TraceCheckUtils]: 8: Hoare triple {416#(= |~#head~0.offset| 0)} assume true; {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,772 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {416#(= |~#head~0.offset| 0)} {405#true} #65#return; {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,773 INFO L263 TraceCheckUtils]: 10: Hoare triple {416#(= |~#head~0.offset| 0)} call #t~ret31 := main(); {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,773 INFO L280 TraceCheckUtils]: 11: Hoare triple {416#(= |~#head~0.offset| 0)} havoc ~dev~0.base, ~dev~0.offset; {416#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:51,774 INFO L280 TraceCheckUtils]: 12: Hoare triple {416#(= |~#head~0.offset| 0)} SUMMARY for call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(12); srcloc: L880 {417#(and (= |~#head~0.offset| 0) (= 0 |main_#t~malloc30.offset|))} is VALID [2020-07-08 22:21:51,775 INFO L280 TraceCheckUtils]: 13: Hoare triple {417#(and (= |~#head~0.offset| 0) (= 0 |main_#t~malloc30.offset|))} ~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {418#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:51,776 INFO L280 TraceCheckUtils]: 14: Hoare triple {418#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} assume ~dev~0.base != 0 || ~dev~0.offset != 0; {418#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:51,777 INFO L280 TraceCheckUtils]: 15: Hoare triple {418#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} SUMMARY for call write~int(0, ~dev~0.base, 8 + ~dev~0.offset, 4); srcloc: L882 {418#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:51,779 INFO L263 TraceCheckUtils]: 16: Hoare triple {418#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {432#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 22:21:51,780 INFO L280 TraceCheckUtils]: 17: Hoare triple {432#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-08 22:21:51,781 INFO L280 TraceCheckUtils]: 18: Hoare triple {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-08 22:21:51,782 INFO L280 TraceCheckUtils]: 19: Hoare triple {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-08 22:21:51,782 INFO L280 TraceCheckUtils]: 20: Hoare triple {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} assume 0 == #t~mem28; {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-08 22:21:51,783 INFO L280 TraceCheckUtils]: 21: Hoare triple {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} havoc #t~mem28; {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-08 22:21:51,785 INFO L280 TraceCheckUtils]: 22: Hoare triple {433#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} SUMMARY for call write~int(1, ~new.base, 8 + ~new.offset, 4); srcloc: L868 {434#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-08 22:21:51,786 INFO L280 TraceCheckUtils]: 23: Hoare triple {434#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} assume true; {434#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-08 22:21:51,787 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {434#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} {418#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} #55#return; {427#(and (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:51,789 INFO L263 TraceCheckUtils]: 25: Hoare triple {427#(and (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} call list_del(~dev~0.base, ~dev~0.offset); {428#(and (= 1 (select (select |#memory_int| |list_del_#in~entry.base|) 8)) (= 0 |list_del_#in~entry.offset|))} is VALID [2020-07-08 22:21:51,790 INFO L280 TraceCheckUtils]: 26: Hoare triple {428#(and (= 1 (select (select |#memory_int| |list_del_#in~entry.base|) 8)) (= 0 |list_del_#in~entry.offset|))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {429#(= 1 (select (select |#memory_int| list_del_~entry.base) (+ list_del_~entry.offset 8)))} is VALID [2020-07-08 22:21:51,791 INFO L280 TraceCheckUtils]: 27: Hoare triple {429#(= 1 (select (select |#memory_int| list_del_~entry.base) (+ list_del_~entry.offset 8)))} SUMMARY for call #t~mem29 := read~int(~entry.base, 8 + ~entry.offset, 4); srcloc: L872 {430#(= 1 |list_del_#t~mem29|)} is VALID [2020-07-08 22:21:51,792 INFO L280 TraceCheckUtils]: 28: Hoare triple {430#(= 1 |list_del_#t~mem29|)} assume !(1 == #t~mem29); {406#false} is VALID [2020-07-08 22:21:51,792 INFO L263 TraceCheckUtils]: 29: Hoare triple {406#false} call __blast_assert(); {406#false} is VALID [2020-07-08 22:21:51,792 INFO L280 TraceCheckUtils]: 30: Hoare triple {406#false} assume !false; {406#false} is VALID [2020-07-08 22:21:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:21:51,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [216288427] [2020-07-08 22:21:51,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:21:51,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-08 22:21:51,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733113611] [2020-07-08 22:21:51,798 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2020-07-08 22:21:51,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:21:51,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 22:21:51,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:51,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 22:21:51,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:21:51,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 22:21:51,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-07-08 22:21:51,862 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 13 states. [2020-07-08 22:21:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:53,715 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2020-07-08 22:21:53,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-08 22:21:53,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2020-07-08 22:21:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:21:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 22:21:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 40 transitions. [2020-07-08 22:21:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 22:21:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 40 transitions. [2020-07-08 22:21:53,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 40 transitions. [2020-07-08 22:21:53,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:53,810 INFO L225 Difference]: With dead ends: 44 [2020-07-08 22:21:53,810 INFO L226 Difference]: Without dead ends: 41 [2020-07-08 22:21:53,812 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2020-07-08 22:21:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-08 22:21:53,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-08 22:21:53,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:21:53,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2020-07-08 22:21:53,994 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-08 22:21:53,994 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-08 22:21:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:53,997 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2020-07-08 22:21:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2020-07-08 22:21:53,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:53,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:53,999 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-08 22:21:53,999 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-08 22:21:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:54,001 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2020-07-08 22:21:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2020-07-08 22:21:54,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:54,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:54,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:21:54,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:21:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-08 22:21:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 40 transitions. [2020-07-08 22:21:54,005 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 40 transitions. Word has length 31 [2020-07-08 22:21:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:21:54,006 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 40 transitions. [2020-07-08 22:21:54,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 22:21:54,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 40 transitions. [2020-07-08 22:21:54,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2020-07-08 22:21:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 22:21:54,113 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:21:54,114 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1] [2020-07-08 22:21:54,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:21:54,114 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:21:54,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:21:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash 609934341, now seen corresponding path program 1 times [2020-07-08 22:21:54,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:21:54,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [560789018] [2020-07-08 22:21:54,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:21:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:54,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {748#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {715#true} is VALID [2020-07-08 22:21:54,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {715#true} #valid := #valid[0 := 0]; {715#true} is VALID [2020-07-08 22:21:54,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {715#true} assume 0 < #StackHeapBarrier; {715#true} is VALID [2020-07-08 22:21:54,399 INFO L280 TraceCheckUtils]: 3: Hoare triple {715#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,406 INFO L280 TraceCheckUtils]: 4: Hoare triple {726#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,406 INFO L280 TraceCheckUtils]: 5: Hoare triple {726#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,409 INFO L280 TraceCheckUtils]: 6: Hoare triple {726#(= |~#head~0.offset| 0)} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,410 INFO L280 TraceCheckUtils]: 7: Hoare triple {726#(= |~#head~0.offset| 0)} assume true; {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,410 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {726#(= |~#head~0.offset| 0)} {715#true} #65#return; {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:54,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {749#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {715#true} is VALID [2020-07-08 22:21:54,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {715#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {715#true} is VALID [2020-07-08 22:21:54,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {715#true} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {715#true} is VALID [2020-07-08 22:21:54,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {715#true} assume 0 == #t~mem28; {715#true} is VALID [2020-07-08 22:21:54,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {715#true} havoc #t~mem28; {715#true} is VALID [2020-07-08 22:21:54,448 INFO L280 TraceCheckUtils]: 5: Hoare triple {715#true} SUMMARY for call write~int(1, ~new.base, 8 + ~new.offset, 4); srcloc: L868 {715#true} is VALID [2020-07-08 22:21:54,448 INFO L280 TraceCheckUtils]: 6: Hoare triple {715#true} assume true; {715#true} is VALID [2020-07-08 22:21:54,450 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {715#true} {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} #55#return; {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:54,544 INFO L280 TraceCheckUtils]: 0: Hoare triple {749#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} is VALID [2020-07-08 22:21:54,545 INFO L280 TraceCheckUtils]: 1: Hoare triple {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} SUMMARY for call #t~mem29 := read~int(~entry.base, 8 + ~entry.offset, 4); srcloc: L872 {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} is VALID [2020-07-08 22:21:54,546 INFO L280 TraceCheckUtils]: 2: Hoare triple {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} assume 1 == #t~mem29; {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} is VALID [2020-07-08 22:21:54,546 INFO L280 TraceCheckUtils]: 3: Hoare triple {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} havoc #t~mem29; {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} is VALID [2020-07-08 22:21:54,548 INFO L280 TraceCheckUtils]: 4: Hoare triple {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} SUMMARY for call write~int(0, ~entry.base, 8 + ~entry.offset, 4); srcloc: L873 {751#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-08 22:21:54,548 INFO L280 TraceCheckUtils]: 5: Hoare triple {751#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} assume true; {751#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-08 22:21:54,549 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {751#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} #57#return; {744#(and (= |~#head~0.offset| 0) (= 0 (select (select |#memory_int| main_~dev~0.base) (+ |~#head~0.offset| 8))) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:54,551 INFO L263 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {748#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} is VALID [2020-07-08 22:21:54,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {748#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {715#true} is VALID [2020-07-08 22:21:54,552 INFO L280 TraceCheckUtils]: 2: Hoare triple {715#true} #valid := #valid[0 := 0]; {715#true} is VALID [2020-07-08 22:21:54,552 INFO L280 TraceCheckUtils]: 3: Hoare triple {715#true} assume 0 < #StackHeapBarrier; {715#true} is VALID [2020-07-08 22:21:54,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {715#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,557 INFO L280 TraceCheckUtils]: 5: Hoare triple {726#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,557 INFO L280 TraceCheckUtils]: 6: Hoare triple {726#(= |~#head~0.offset| 0)} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,558 INFO L280 TraceCheckUtils]: 7: Hoare triple {726#(= |~#head~0.offset| 0)} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,558 INFO L280 TraceCheckUtils]: 8: Hoare triple {726#(= |~#head~0.offset| 0)} assume true; {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,559 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {726#(= |~#head~0.offset| 0)} {715#true} #65#return; {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,559 INFO L263 TraceCheckUtils]: 10: Hoare triple {726#(= |~#head~0.offset| 0)} call #t~ret31 := main(); {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,560 INFO L280 TraceCheckUtils]: 11: Hoare triple {726#(= |~#head~0.offset| 0)} havoc ~dev~0.base, ~dev~0.offset; {726#(= |~#head~0.offset| 0)} is VALID [2020-07-08 22:21:54,560 INFO L280 TraceCheckUtils]: 12: Hoare triple {726#(= |~#head~0.offset| 0)} SUMMARY for call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(12); srcloc: L880 {727#(and (= |~#head~0.offset| 0) (= 0 |main_#t~malloc30.offset|))} is VALID [2020-07-08 22:21:54,561 INFO L280 TraceCheckUtils]: 13: Hoare triple {727#(and (= |~#head~0.offset| 0) (= 0 |main_#t~malloc30.offset|))} ~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:54,562 INFO L280 TraceCheckUtils]: 14: Hoare triple {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} assume ~dev~0.base != 0 || ~dev~0.offset != 0; {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:54,563 INFO L280 TraceCheckUtils]: 15: Hoare triple {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} SUMMARY for call write~int(0, ~dev~0.base, 8 + ~dev~0.offset, 4); srcloc: L882 {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:54,565 INFO L263 TraceCheckUtils]: 16: Hoare triple {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {749#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 22:21:54,565 INFO L280 TraceCheckUtils]: 17: Hoare triple {749#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {715#true} is VALID [2020-07-08 22:21:54,566 INFO L280 TraceCheckUtils]: 18: Hoare triple {715#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {715#true} is VALID [2020-07-08 22:21:54,566 INFO L280 TraceCheckUtils]: 19: Hoare triple {715#true} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {715#true} is VALID [2020-07-08 22:21:54,567 INFO L280 TraceCheckUtils]: 20: Hoare triple {715#true} assume 0 == #t~mem28; {715#true} is VALID [2020-07-08 22:21:54,567 INFO L280 TraceCheckUtils]: 21: Hoare triple {715#true} havoc #t~mem28; {715#true} is VALID [2020-07-08 22:21:54,568 INFO L280 TraceCheckUtils]: 22: Hoare triple {715#true} SUMMARY for call write~int(1, ~new.base, 8 + ~new.offset, 4); srcloc: L868 {715#true} is VALID [2020-07-08 22:21:54,568 INFO L280 TraceCheckUtils]: 23: Hoare triple {715#true} assume true; {715#true} is VALID [2020-07-08 22:21:54,574 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {715#true} {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} #55#return; {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:54,578 INFO L263 TraceCheckUtils]: 25: Hoare triple {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} call list_del(~dev~0.base, ~dev~0.offset); {749#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 22:21:54,582 INFO L280 TraceCheckUtils]: 26: Hoare triple {749#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} is VALID [2020-07-08 22:21:54,583 INFO L280 TraceCheckUtils]: 27: Hoare triple {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} SUMMARY for call #t~mem29 := read~int(~entry.base, 8 + ~entry.offset, 4); srcloc: L872 {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} is VALID [2020-07-08 22:21:54,583 INFO L280 TraceCheckUtils]: 28: Hoare triple {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} assume 1 == #t~mem29; {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} is VALID [2020-07-08 22:21:54,584 INFO L280 TraceCheckUtils]: 29: Hoare triple {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} havoc #t~mem29; {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} is VALID [2020-07-08 22:21:54,585 INFO L280 TraceCheckUtils]: 30: Hoare triple {750#(and (= list_del_~entry.base |list_del_#in~entry.base|) (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)))} SUMMARY for call write~int(0, ~entry.base, 8 + ~entry.offset, 4); srcloc: L873 {751#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-08 22:21:54,586 INFO L280 TraceCheckUtils]: 31: Hoare triple {751#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} assume true; {751#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-08 22:21:54,587 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {751#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} {728#(and (= |~#head~0.offset| 0) (= 0 main_~dev~0.offset))} #57#return; {744#(and (= |~#head~0.offset| 0) (= 0 (select (select |#memory_int| main_~dev~0.base) (+ |~#head~0.offset| 8))) (= 0 main_~dev~0.offset))} is VALID [2020-07-08 22:21:54,588 INFO L263 TraceCheckUtils]: 33: Hoare triple {744#(and (= |~#head~0.offset| 0) (= 0 (select (select |#memory_int| main_~dev~0.base) (+ |~#head~0.offset| 8))) (= 0 main_~dev~0.offset))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {745#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} is VALID [2020-07-08 22:21:54,591 INFO L280 TraceCheckUtils]: 34: Hoare triple {745#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {746#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} is VALID [2020-07-08 22:21:54,592 INFO L280 TraceCheckUtils]: 35: Hoare triple {746#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {746#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} is VALID [2020-07-08 22:21:54,592 INFO L280 TraceCheckUtils]: 36: Hoare triple {746#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {747#(= 0 |list_add_#t~mem28|)} is VALID [2020-07-08 22:21:54,593 INFO L280 TraceCheckUtils]: 37: Hoare triple {747#(= 0 |list_add_#t~mem28|)} assume !(0 == #t~mem28); {716#false} is VALID [2020-07-08 22:21:54,593 INFO L263 TraceCheckUtils]: 38: Hoare triple {716#false} call __blast_assert(); {716#false} is VALID [2020-07-08 22:21:54,593 INFO L280 TraceCheckUtils]: 39: Hoare triple {716#false} assume !false; {716#false} is VALID [2020-07-08 22:21:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:21:54,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [560789018] [2020-07-08 22:21:54,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:21:54,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-08 22:21:54,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581280100] [2020-07-08 22:21:54,599 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-08 22:21:54,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:21:54,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 22:21:54,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:54,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 22:21:54,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:21:54,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 22:21:54,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-07-08 22:21:54,662 INFO L87 Difference]: Start difference. First operand 41 states and 40 transitions. Second operand 13 states. [2020-07-08 22:21:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:56,362 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2020-07-08 22:21:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-08 22:21:56,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-08 22:21:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:21:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 22:21:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2020-07-08 22:21:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 22:21:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2020-07-08 22:21:56,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 37 transitions. [2020-07-08 22:21:56,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:56,443 INFO L225 Difference]: With dead ends: 41 [2020-07-08 22:21:56,444 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 22:21:56,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2020-07-08 22:21:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 22:21:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 22:21:56,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:21:56,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:56,447 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:56,447 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:56,448 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:21:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:21:56,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:56,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:56,448 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:56,448 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:56,449 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:21:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:21:56,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:56,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:56,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:21:56,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:21:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 22:21:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 22:21:56,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2020-07-08 22:21:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:21:56,450 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 22:21:56,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 22:21:56,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 22:21:56,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:21:56,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:56,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:21:56,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 22:21:58,061 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 22:21:58,062 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-08 22:21:58,062 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 876) the Hoare annotation is: (= |~#head~0.offset| 0) [2020-07-08 22:21:58,062 INFO L271 CegarLoopResult]: At program point L876(line 876) the Hoare annotation is: true [2020-07-08 22:21:58,062 INFO L264 CegarLoopResult]: At program point L876-1(line 876) the Hoare annotation is: (= |~#head~0.offset| 0) [2020-07-08 22:21:58,063 INFO L264 CegarLoopResult]: At program point L876-2(line 876) the Hoare annotation is: (= |~#head~0.offset| 0) [2020-07-08 22:21:58,063 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |old(~#head~0.base)| |~#head~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|)) [2020-07-08 22:21:58,063 INFO L264 CegarLoopResult]: At program point L876-3(line 876) the Hoare annotation is: (= |~#head~0.offset| 0) [2020-07-08 22:21:58,063 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= |~#head~0.offset| 0) [2020-07-08 22:21:58,064 INFO L264 CegarLoopResult]: At program point list_delFINAL(lines 871 874) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,064 INFO L264 CegarLoopResult]: At program point list_delEXIT(lines 871 874) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,064 INFO L264 CegarLoopResult]: At program point L873(line 873) the Hoare annotation is: (or (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,064 INFO L264 CegarLoopResult]: At program point L872(line 872) the Hoare annotation is: (or (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,065 INFO L264 CegarLoopResult]: At program point list_delENTRY(lines 871 874) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |list_del_#in~entry.offset|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,065 INFO L264 CegarLoopResult]: At program point L872-1(line 872) the Hoare annotation is: (or (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= 1 |list_del_#t~mem29|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,065 INFO L264 CegarLoopResult]: At program point L872-3(line 872) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|)) (not (= 0 |~#head~0.offset|))) [2020-07-08 22:21:58,065 INFO L264 CegarLoopResult]: At program point L872-4(line 872) the Hoare annotation is: (or (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= 1 |list_del_#t~mem29|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,066 INFO L264 CegarLoopResult]: At program point list_addENTRY(lines 866 869) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#head~0.offset| 0)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-08 22:21:58,066 INFO L264 CegarLoopResult]: At program point L867-3(line 867) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (not (= 0 |list_add_#in~new.offset|)) (not (= 0 |~#head~0.offset|))) [2020-07-08 22:21:58,066 INFO L264 CegarLoopResult]: At program point L867-4(line 867) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) (= 0 |list_add_#t~mem28|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#head~0.offset| 0)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-08 22:21:58,066 INFO L264 CegarLoopResult]: At program point list_addFINAL(lines 866 869) the Hoare annotation is: (or (and (= list_add_~new.base |list_add_#in~new.base|) (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (= |list_add_#in~new.offset| list_add_~new.offset)) (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (not (= |~#head~0.offset| 0)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-08 22:21:58,066 INFO L264 CegarLoopResult]: At program point L868(line 868) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#head~0.offset| 0)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-08 22:21:58,067 INFO L264 CegarLoopResult]: At program point list_addEXIT(lines 866 869) the Hoare annotation is: (or (and (= list_add_~new.base |list_add_#in~new.base|) (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (= |list_add_#in~new.offset| list_add_~new.offset)) (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (not (= |~#head~0.offset| 0)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-08 22:21:58,067 INFO L264 CegarLoopResult]: At program point L867(line 867) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#head~0.offset| 0)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-08 22:21:58,067 INFO L264 CegarLoopResult]: At program point L866(lines 866 869) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#head~0.offset| 0)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-08 22:21:58,067 INFO L264 CegarLoopResult]: At program point L867-1(line 867) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) (= 0 |list_add_#t~mem28|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#head~0.offset| 0)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-08 22:21:58,067 INFO L271 CegarLoopResult]: At program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) the Hoare annotation is: true [2020-07-08 22:21:58,068 INFO L271 CegarLoopResult]: At program point __blast_assertEXIT(lines 4 7) the Hoare annotation is: true [2020-07-08 22:21:58,068 INFO L271 CegarLoopResult]: At program point __blast_assertFINAL(lines 4 7) the Hoare annotation is: true [2020-07-08 22:21:58,068 INFO L271 CegarLoopResult]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2020-07-08 22:21:58,068 INFO L264 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: (= |~#head~0.offset| 0) [2020-07-08 22:21:58,068 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (= |~#head~0.offset| 0) [2020-07-08 22:21:58,068 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 22:21:58,068 INFO L264 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: (= |~#head~0.offset| 0) [2020-07-08 22:21:58,069 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 878 888) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,069 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 878 888) the Hoare annotation is: (or (and (= 0 |main_#t~malloc30.offset|) (= |~#head~0.offset| main_~dev~0.offset)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,069 INFO L264 CegarLoopResult]: At program point L884(line 884) the Hoare annotation is: (or (and (= 0 |main_#t~malloc30.offset|) (= 0 (select (select |#memory_int| main_~dev~0.base) (+ |~#head~0.offset| 8))) (= 0 main_~dev~0.offset)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,069 INFO L264 CegarLoopResult]: At program point L883(line 883) the Hoare annotation is: (or (and (= 0 |main_#t~malloc30.offset|) (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,069 INFO L264 CegarLoopResult]: At program point L882(line 882) the Hoare annotation is: (or (and (= 0 |main_#t~malloc30.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 main_~dev~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,069 INFO L264 CegarLoopResult]: At program point L881(lines 881 886) the Hoare annotation is: (or (and (= 0 |main_#t~malloc30.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 main_~dev~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,070 INFO L264 CegarLoopResult]: At program point L882-1(line 882) the Hoare annotation is: (or (and (= 0 |main_#t~malloc30.offset|) (= 0 (select (select |#memory_int| main_~dev~0.base) (+ |~#head~0.offset| 8))) (= 0 main_~dev~0.offset)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,070 INFO L264 CegarLoopResult]: At program point L880(line 880) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,070 INFO L264 CegarLoopResult]: At program point L881-1(lines 881 886) the Hoare annotation is: (or (and (= 0 |main_#t~malloc30.offset|) (= |~#head~0.offset| main_~dev~0.offset)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,070 INFO L264 CegarLoopResult]: At program point L880-1(line 880) the Hoare annotation is: (or (and (= 0 |main_#t~malloc30.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,070 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 878 888) the Hoare annotation is: (or (and (= 0 |main_#t~malloc30.offset|) (= |~#head~0.offset| main_~dev~0.offset)) (not (= |~#head~0.offset| 0))) [2020-07-08 22:21:58,119 INFO L163 areAnnotationChecker]: CFG has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 22:21:58,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 22:21:58,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 22:21:58,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 22:21:58,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 22:21:58,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:21:58 BoogieIcfgContainer [2020-07-08 22:21:58,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:21:58,138 INFO L168 Benchmark]: Toolchain (without parser) took 11053.56 ms. Allocated memory was 144.7 MB in the beginning and 344.5 MB in the end (delta: 199.8 MB). Free memory was 101.9 MB in the beginning and 130.0 MB in the end (delta: -28.1 MB). Peak memory consumption was 171.6 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:58,139 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 22:21:58,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.97 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 166.2 MB in the end (delta: -64.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:58,141 INFO L168 Benchmark]: Boogie Preprocessor took 62.87 ms. Allocated memory is still 201.9 MB. Free memory was 166.2 MB in the beginning and 162.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:58,141 INFO L168 Benchmark]: RCFGBuilder took 699.07 ms. Allocated memory is still 201.9 MB. Free memory was 162.8 MB in the beginning and 110.6 MB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:58,143 INFO L168 Benchmark]: TraceAbstraction took 9602.71 ms. Allocated memory was 201.9 MB in the beginning and 344.5 MB in the end (delta: 142.6 MB). Free memory was 110.6 MB in the beginning and 130.0 MB in the end (delta: -19.4 MB). Peak memory consumption was 123.2 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:58,146 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 676.97 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 166.2 MB in the end (delta: -64.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.87 ms. Allocated memory is still 201.9 MB. Free memory was 166.2 MB in the beginning and 162.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 699.07 ms. Allocated memory is still 201.9 MB. Free memory was 162.8 MB in the beginning and 110.6 MB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9602.71 ms. Allocated memory was 201.9 MB in the beginning and 344.5 MB in the end (delta: 142.6 MB). Free memory was 110.6 MB in the beginning and 130.0 MB in the end (delta: -19.4 MB). Peak memory consumption was 123.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 871]: Procedure Contract for list_del [2020-07-08 22:21:58,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 22:21:58,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 22:21:58,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 22:21:58,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived contract for procedure list_del: ((!(1 == \old(unknown-#memory_int-unknown)[entry][8]) || ((entry == entry && entry == entry) && 0 == unknown-#memory_int-unknown[entry][8])) || !(0 == entry)) || !(head == 0) - ProcedureContractResult [Line: 4]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert: 1 - ProcedureContractResult [Line: 866]: Procedure Contract for list_add [2020-07-08 22:21:58,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 22:21:58,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 22:21:58,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 22:21:58,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived contract for procedure list_add: ((((new == new && 1 == unknown-#memory_int-unknown[new][8]) && new == new) || !(0 == \old(unknown-#memory_int-unknown)[new][8])) || !(head == 0)) || !(0 == new) - ProcedureContractResult [Line: 878]: Procedure Contract for main Derived contract for procedure main: (0 == malloc(sizeof(*dev)) && head == dev) || !(head == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.8s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 71 SDtfs, 189 SDslu, 108 SDs, 0 SdLazy, 700 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 83 PreInvPairs, 102 NumberOfFragments, 771 HoareAnnotationTreeSize, 83 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 923 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 17748 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...