/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 01:04:08,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 01:04:08,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 01:04:08,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 01:04:08,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 01:04:08,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 01:04:08,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 01:04:08,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 01:04:08,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 01:04:08,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 01:04:08,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 01:04:08,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 01:04:08,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 01:04:08,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 01:04:08,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 01:04:08,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 01:04:08,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 01:04:08,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 01:04:08,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 01:04:08,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 01:04:08,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 01:04:08,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 01:04:08,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 01:04:08,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 01:04:08,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 01:04:08,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 01:04:08,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 01:04:08,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 01:04:08,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 01:04:08,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 01:04:08,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 01:04:08,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 01:04:08,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 01:04:08,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 01:04:08,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 01:04:08,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 01:04:08,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 01:04:08,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 01:04:08,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 01:04:08,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 01:04:08,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 01:04:08,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 01:04:08,916 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 01:04:08,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 01:04:08,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 01:04:08,921 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 01:04:08,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 01:04:08,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 01:04:08,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 01:04:08,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 01:04:08,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 01:04:08,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 01:04:08,923 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 01:04:08,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 01:04:08,923 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 01:04:08,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 01:04:08,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 01:04:08,925 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 01:04:08,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 01:04:08,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 01:04:08,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 01:04:08,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 01:04:08,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 01:04:08,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 01:04:08,926 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-10-24 01:04:09,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 01:04:09,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 01:04:09,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 01:04:09,384 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 01:04:09,385 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 01:04:09,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2020-10-24 01:04:09,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819886cf4/07a4dfe337284bcfa06dc93a961f4388/FLAG08c3a1130 [2020-10-24 01:04:10,210 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 01:04:10,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2020-10-24 01:04:10,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819886cf4/07a4dfe337284bcfa06dc93a961f4388/FLAG08c3a1130 [2020-10-24 01:04:10,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819886cf4/07a4dfe337284bcfa06dc93a961f4388 [2020-10-24 01:04:10,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 01:04:10,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 01:04:10,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 01:04:10,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 01:04:10,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 01:04:10,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:04:10" (1/1) ... [2020-10-24 01:04:10,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b4cfec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:10, skipping insertion in model container [2020-10-24 01:04:10,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:04:10" (1/1) ... [2020-10-24 01:04:10,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 01:04:10,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 01:04:10,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 01:04:10,910 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 01:04:10,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 01:04:11,028 INFO L208 MainTranslator]: Completed translation [2020-10-24 01:04:11,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:11 WrapperNode [2020-10-24 01:04:11,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 01:04:11,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 01:04:11,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 01:04:11,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 01:04:11,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:11" (1/1) ... [2020-10-24 01:04:11,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:11" (1/1) ... [2020-10-24 01:04:11,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:11" (1/1) ... [2020-10-24 01:04:11,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:11" (1/1) ... [2020-10-24 01:04:11,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:11" (1/1) ... [2020-10-24 01:04:11,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:11" (1/1) ... [2020-10-24 01:04:11,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:11" (1/1) ... [2020-10-24 01:04:11,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 01:04:11,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 01:04:11,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 01:04:11,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 01:04:11,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:11" (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-10-24 01:04:11,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 01:04:11,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 01:04:11,178 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 01:04:11,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-10-24 01:04:11,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2020-10-24 01:04:11,179 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2020-10-24 01:04:11,179 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2020-10-24 01:04:11,179 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2020-10-24 01:04:11,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 01:04:11,180 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 01:04:11,180 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 01:04:11,180 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 01:04:11,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 01:04:11,180 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-10-24 01:04:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2020-10-24 01:04:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2020-10-24 01:04:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2020-10-24 01:04:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2020-10-24 01:04:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2020-10-24 01:04:11,182 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2020-10-24 01:04:11,182 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2020-10-24 01:04:11,182 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2020-10-24 01:04:11,182 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2020-10-24 01:04:11,182 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2020-10-24 01:04:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2020-10-24 01:04:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2020-10-24 01:04:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2020-10-24 01:04:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2020-10-24 01:04:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2020-10-24 01:04:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2020-10-24 01:04:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2020-10-24 01:04:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2020-10-24 01:04:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2020-10-24 01:04:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2020-10-24 01:04:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2020-10-24 01:04:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2020-10-24 01:04:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2020-10-24 01:04:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2020-10-24 01:04:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2020-10-24 01:04:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2020-10-24 01:04:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2020-10-24 01:04:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2020-10-24 01:04:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2020-10-24 01:04:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2020-10-24 01:04:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2020-10-24 01:04:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2020-10-24 01:04:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2020-10-24 01:04:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2020-10-24 01:04:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2020-10-24 01:04:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2020-10-24 01:04:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2020-10-24 01:04:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2020-10-24 01:04:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2020-10-24 01:04:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2020-10-24 01:04:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2020-10-24 01:04:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2020-10-24 01:04:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2020-10-24 01:04:11,189 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2020-10-24 01:04:11,189 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2020-10-24 01:04:11,189 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2020-10-24 01:04:11,189 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2020-10-24 01:04:11,189 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2020-10-24 01:04:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2020-10-24 01:04:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2020-10-24 01:04:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2020-10-24 01:04:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2020-10-24 01:04:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2020-10-24 01:04:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2020-10-24 01:04:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-10-24 01:04:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2020-10-24 01:04:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2020-10-24 01:04:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2020-10-24 01:04:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2020-10-24 01:04:11,192 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2020-10-24 01:04:11,192 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2020-10-24 01:04:11,192 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2020-10-24 01:04:11,192 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2020-10-24 01:04:11,192 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2020-10-24 01:04:11,193 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2020-10-24 01:04:11,193 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2020-10-24 01:04:11,193 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2020-10-24 01:04:11,193 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2020-10-24 01:04:11,193 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2020-10-24 01:04:11,193 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2020-10-24 01:04:11,194 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2020-10-24 01:04:11,194 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2020-10-24 01:04:11,194 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2020-10-24 01:04:11,194 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2020-10-24 01:04:11,194 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2020-10-24 01:04:11,194 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2020-10-24 01:04:11,195 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2020-10-24 01:04:11,195 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2020-10-24 01:04:11,195 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2020-10-24 01:04:11,195 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2020-10-24 01:04:11,195 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2020-10-24 01:04:11,196 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2020-10-24 01:04:11,196 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2020-10-24 01:04:11,196 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2020-10-24 01:04:11,196 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2020-10-24 01:04:11,196 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2020-10-24 01:04:11,196 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2020-10-24 01:04:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2020-10-24 01:04:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2020-10-24 01:04:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2020-10-24 01:04:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2020-10-24 01:04:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2020-10-24 01:04:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2020-10-24 01:04:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2020-10-24 01:04:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2020-10-24 01:04:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2020-10-24 01:04:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2020-10-24 01:04:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2020-10-24 01:04:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2020-10-24 01:04:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2020-10-24 01:04:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2020-10-24 01:04:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-24 01:04:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-24 01:04:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-24 01:04:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-24 01:04:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-10-24 01:04:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2020-10-24 01:04:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-24 01:04:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2020-10-24 01:04:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2020-10-24 01:04:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2020-10-24 01:04:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2020-10-24 01:04:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2020-10-24 01:04:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2020-10-24 01:04:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2020-10-24 01:04:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2020-10-24 01:04:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2020-10-24 01:04:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2020-10-24 01:04:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2020-10-24 01:04:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 01:04:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2020-10-24 01:04:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2020-10-24 01:04:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2020-10-24 01:04:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2020-10-24 01:04:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 01:04:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 01:04:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 01:04:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-24 01:04:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 01:04:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-24 01:04:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-24 01:04:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 01:04:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 01:04:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 01:04:11,783 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 01:04:11,784 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 01:04:11,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:04:11 BoogieIcfgContainer [2020-10-24 01:04:11,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 01:04:11,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 01:04:11,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 01:04:11,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 01:04:11,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:04:10" (1/3) ... [2020-10-24 01:04:11,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52363a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:04:11, skipping insertion in model container [2020-10-24 01:04:11,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:11" (2/3) ... [2020-10-24 01:04:11,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52363a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:04:11, skipping insertion in model container [2020-10-24 01:04:11,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:04:11" (3/3) ... [2020-10-24 01:04:11,804 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2020-10-24 01:04:11,815 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 01:04:11,821 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 01:04:11,834 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 01:04:11,864 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 01:04:11,864 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 01:04:11,865 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 01:04:11,865 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 01:04:11,865 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 01:04:11,865 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 01:04:11,865 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 01:04:11,865 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 01:04:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2020-10-24 01:04:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-24 01:04:11,891 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:11,892 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] [2020-10-24 01:04:11,892 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:11,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:11,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1307017256, now seen corresponding path program 1 times [2020-10-24 01:04:11,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:11,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1136676385] [2020-10-24 01:04:11,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:12,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:04:12,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1136676385] [2020-10-24 01:04:12,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:04:12,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 01:04:12,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118673062] [2020-10-24 01:04:12,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 01:04:12,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:12,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 01:04:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 01:04:12,360 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 7 states. [2020-10-24 01:04:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:12,909 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2020-10-24 01:04:12,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 01:04:12,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-24 01:04:12,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:12,923 INFO L225 Difference]: With dead ends: 136 [2020-10-24 01:04:12,924 INFO L226 Difference]: Without dead ends: 72 [2020-10-24 01:04:12,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-24 01:04:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-24 01:04:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2020-10-24 01:04:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-24 01:04:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2020-10-24 01:04:12,990 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 27 [2020-10-24 01:04:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:12,991 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2020-10-24 01:04:12,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 01:04:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2020-10-24 01:04:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-24 01:04:12,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:12,995 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2020-10-24 01:04:12,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 01:04:12,995 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:12,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:12,996 INFO L82 PathProgramCache]: Analyzing trace with hash -662895711, now seen corresponding path program 1 times [2020-10-24 01:04:12,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:12,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [733371977] [2020-10-24 01:04:12,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-24 01:04:13,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [733371977] [2020-10-24 01:04:13,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:04:13,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 01:04:13,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287901054] [2020-10-24 01:04:13,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 01:04:13,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:13,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 01:04:13,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 01:04:13,359 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 9 states. [2020-10-24 01:04:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:13,647 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2020-10-24 01:04:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 01:04:13,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-10-24 01:04:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:13,650 INFO L225 Difference]: With dead ends: 104 [2020-10-24 01:04:13,650 INFO L226 Difference]: Without dead ends: 78 [2020-10-24 01:04:13,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-24 01:04:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-24 01:04:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2020-10-24 01:04:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-24 01:04:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2020-10-24 01:04:13,672 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 67 [2020-10-24 01:04:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:13,673 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2020-10-24 01:04:13,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 01:04:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-10-24 01:04:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-24 01:04:13,675 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:13,676 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:13,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 01:04:13,676 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:13,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2127599292, now seen corresponding path program 1 times [2020-10-24 01:04:13,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:13,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1797822022] [2020-10-24 01:04:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-10-24 01:04:13,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1797822022] [2020-10-24 01:04:13,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:13,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 01:04:13,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716210726] [2020-10-24 01:04:13,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 01:04:13,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:13,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 01:04:13,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 01:04:13,934 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 9 states. [2020-10-24 01:04:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:14,217 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2020-10-24 01:04:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 01:04:14,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-10-24 01:04:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:14,220 INFO L225 Difference]: With dead ends: 107 [2020-10-24 01:04:14,220 INFO L226 Difference]: Without dead ends: 70 [2020-10-24 01:04:14,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-24 01:04:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-24 01:04:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2020-10-24 01:04:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-24 01:04:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2020-10-24 01:04:14,238 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 67 [2020-10-24 01:04:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:14,238 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2020-10-24 01:04:14,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 01:04:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-10-24 01:04:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-24 01:04:14,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:14,241 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2020-10-24 01:04:14,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 01:04:14,241 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:14,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:14,242 INFO L82 PathProgramCache]: Analyzing trace with hash 992059239, now seen corresponding path program 1 times [2020-10-24 01:04:14,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:14,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [767992042] [2020-10-24 01:04:14,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:14,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:14,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:14,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:14,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:14,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-24 01:04:14,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [767992042] [2020-10-24 01:04:14,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:14,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 01:04:14,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783877316] [2020-10-24 01:04:14,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 01:04:14,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:14,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 01:04:14,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-10-24 01:04:14,683 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 17 states. [2020-10-24 01:04:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:16,099 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2020-10-24 01:04:16,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 01:04:16,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2020-10-24 01:04:16,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:16,102 INFO L225 Difference]: With dead ends: 114 [2020-10-24 01:04:16,102 INFO L226 Difference]: Without dead ends: 98 [2020-10-24 01:04:16,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 01:04:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-24 01:04:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2020-10-24 01:04:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-24 01:04:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2020-10-24 01:04:16,131 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 67 [2020-10-24 01:04:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:16,132 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2020-10-24 01:04:16,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 01:04:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2020-10-24 01:04:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-24 01:04:16,133 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:16,134 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:16,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 01:04:16,134 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash -898061266, now seen corresponding path program 1 times [2020-10-24 01:04:16,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:16,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910690436] [2020-10-24 01:04:16,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:16,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:16,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:16,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:16,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:16,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:16,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 01:04:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:04:16,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910690436] [2020-10-24 01:04:16,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:16,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 01:04:16,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91439763] [2020-10-24 01:04:16,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 01:04:16,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:16,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 01:04:16,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-10-24 01:04:16,545 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 18 states. [2020-10-24 01:04:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:17,874 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-10-24 01:04:17,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 01:04:17,875 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 76 [2020-10-24 01:04:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:17,877 INFO L225 Difference]: With dead ends: 96 [2020-10-24 01:04:17,877 INFO L226 Difference]: Without dead ends: 92 [2020-10-24 01:04:17,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 01:04:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-24 01:04:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2020-10-24 01:04:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-24 01:04:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2020-10-24 01:04:17,903 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 76 [2020-10-24 01:04:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:17,903 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2020-10-24 01:04:17,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 01:04:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2020-10-24 01:04:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-24 01:04:17,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:17,905 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:17,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 01:04:17,905 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:17,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:17,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1599704300, now seen corresponding path program 1 times [2020-10-24 01:04:17,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:17,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2129270006] [2020-10-24 01:04:17,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 01:04:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:04:18,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2129270006] [2020-10-24 01:04:18,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:18,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 01:04:18,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120892477] [2020-10-24 01:04:18,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 01:04:18,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:18,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 01:04:18,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2020-10-24 01:04:18,415 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 23 states. [2020-10-24 01:04:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:20,197 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2020-10-24 01:04:20,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 01:04:20,199 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2020-10-24 01:04:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:20,201 INFO L225 Difference]: With dead ends: 100 [2020-10-24 01:04:20,201 INFO L226 Difference]: Without dead ends: 91 [2020-10-24 01:04:20,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2020-10-24 01:04:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-24 01:04:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2020-10-24 01:04:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-24 01:04:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2020-10-24 01:04:20,233 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 77 [2020-10-24 01:04:20,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:20,234 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2020-10-24 01:04:20,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 01:04:20,234 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2020-10-24 01:04:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-24 01:04:20,235 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:20,236 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:20,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 01:04:20,236 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:20,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1887351743, now seen corresponding path program 1 times [2020-10-24 01:04:20,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:20,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1816987701] [2020-10-24 01:04:20,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:20,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:20,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:20,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:20,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:20,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:20,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 01:04:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:20,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-10-24 01:04:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:20,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 01:04:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 01:04:20,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1816987701] [2020-10-24 01:04:20,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:20,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 01:04:20,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107186723] [2020-10-24 01:04:20,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 01:04:20,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:20,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 01:04:20,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2020-10-24 01:04:20,999 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 24 states. [2020-10-24 01:04:23,249 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-10-24 01:04:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:23,430 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2020-10-24 01:04:23,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-24 01:04:23,430 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2020-10-24 01:04:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:23,434 INFO L225 Difference]: With dead ends: 113 [2020-10-24 01:04:23,434 INFO L226 Difference]: Without dead ends: 105 [2020-10-24 01:04:23,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=309, Invalid=2447, Unknown=0, NotChecked=0, Total=2756 [2020-10-24 01:04:23,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-24 01:04:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-10-24 01:04:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-24 01:04:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2020-10-24 01:04:23,460 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 91 [2020-10-24 01:04:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:23,461 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2020-10-24 01:04:23,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 01:04:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2020-10-24 01:04:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-24 01:04:23,463 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:23,463 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:23,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 01:04:23,464 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:23,464 INFO L82 PathProgramCache]: Analyzing trace with hash 464416903, now seen corresponding path program 2 times [2020-10-24 01:04:23,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:23,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626901069] [2020-10-24 01:04:23,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:23,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:23,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:23,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:23,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:23,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:23,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 01:04:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:23,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-10-24 01:04:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:23,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 01:04:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-24 01:04:23,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626901069] [2020-10-24 01:04:23,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:23,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 01:04:23,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339809986] [2020-10-24 01:04:23,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 01:04:23,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:23,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 01:04:23,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2020-10-24 01:04:23,982 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 24 states. [2020-10-24 01:04:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:25,732 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2020-10-24 01:04:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 01:04:25,732 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2020-10-24 01:04:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:25,735 INFO L225 Difference]: With dead ends: 113 [2020-10-24 01:04:25,735 INFO L226 Difference]: Without dead ends: 103 [2020-10-24 01:04:25,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2020-10-24 01:04:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-24 01:04:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2020-10-24 01:04:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-24 01:04:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2020-10-24 01:04:25,775 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 91 [2020-10-24 01:04:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:25,776 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2020-10-24 01:04:25,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 01:04:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2020-10-24 01:04:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-24 01:04:25,785 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:25,785 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:25,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 01:04:25,786 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:25,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:25,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1704791095, now seen corresponding path program 1 times [2020-10-24 01:04:25,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:25,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2063839604] [2020-10-24 01:04:25,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:25,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:25,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:26,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:26,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:26,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:26,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 01:04:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:26,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-10-24 01:04:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:26,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 01:04:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-24 01:04:26,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2063839604] [2020-10-24 01:04:26,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:26,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 01:04:26,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242182005] [2020-10-24 01:04:26,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 01:04:26,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:26,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 01:04:26,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-10-24 01:04:26,198 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 19 states. [2020-10-24 01:04:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:27,670 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2020-10-24 01:04:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 01:04:27,671 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2020-10-24 01:04:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:27,672 INFO L225 Difference]: With dead ends: 106 [2020-10-24 01:04:27,672 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 01:04:27,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 01:04:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 01:04:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 01:04:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 01:04:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 01:04:27,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2020-10-24 01:04:27,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:27,675 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 01:04:27,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 01:04:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 01:04:27,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 01:04:27,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 01:04:27,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 01:04:28,864 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2020-10-24 01:04:29,187 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2020-10-24 01:04:29,427 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-24 01:04:29,564 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2020-10-24 01:04:29,793 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2020-10-24 01:04:30,110 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-10-24 01:04:30,373 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-10-24 01:04:30,476 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2020-10-24 01:04:30,804 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-10-24 01:04:31,073 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-10-24 01:04:31,276 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 12 [2020-10-24 01:04:31,503 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2020-10-24 01:04:31,611 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2020-10-24 01:04:31,834 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2020-10-24 01:04:32,287 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 26 [2020-10-24 01:04:32,482 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2020-10-24 01:04:32,586 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2020-10-24 01:04:32,841 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2020-10-24 01:04:33,025 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2020-10-24 01:04:33,184 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2020-10-24 01:04:33,393 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 31 [2020-10-24 01:04:33,642 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2020-10-24 01:04:33,899 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2020-10-24 01:04:34,058 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2020-10-24 01:04:34,369 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2020-10-24 01:04:34,793 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2020-10-24 01:04:34,954 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2020-10-24 01:04:35,262 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2020-10-24 01:04:35,565 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2020-10-24 01:04:35,833 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 30 [2020-10-24 01:04:36,146 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2020-10-24 01:04:36,255 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2020-10-24 01:04:36,577 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-24 01:04:36,582 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 01:04:36,583 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 01:04:36,583 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 01:04:36,583 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 01:04:36,583 INFO L270 CegarLoopResult]: At program point L881(line 881) the Hoare annotation is: (or (not (= |my_malloc_#in~size| 8)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= my_malloc_~size 8))) [2020-10-24 01:04:36,583 INFO L270 CegarLoopResult]: At program point my_mallocFINAL(lines 880 882) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= 0 |my_malloc_#res.base|) (<= |my_malloc_#res.base| 0) (<= 0 |my_malloc_#res.offset|) (<= |my_malloc_#res.offset| 0)) (and (or (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse0) (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) .cse0)) (not (= ~elem~0.offset 0)) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse1) (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= .cse1 |my_malloc_#res.offset|)))))) [2020-10-24 01:04:36,584 INFO L270 CegarLoopResult]: At program point L881-1(line 881) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (or (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse0) (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) .cse0)) (and (<= 0 |my_malloc_#t~ret37.base|) (<= 0 |my_malloc_#t~ret37.offset|) (<= |my_malloc_#t~ret37.base| 0) (<= |my_malloc_#t~ret37.offset| 0)) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse1) (<= |my_malloc_#t~ret37.offset| .cse1) (<= .cse1 |my_malloc_#t~ret37.offset|) (<= .cse1 ~guard_malloc_counter~0.offset))) (not (= ~elem~0.offset 0))))) [2020-10-24 01:04:36,586 INFO L270 CegarLoopResult]: At program point L881-2(line 881) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= 0 |my_malloc_#t~ret37.base|) (<= 0 |my_malloc_#t~ret37.offset|) (<= |my_malloc_#t~ret37.base| 0) (<= 0 |my_malloc_#res.base|) (<= |my_malloc_#t~ret37.offset| 0) (<= |my_malloc_#res.base| 0) (<= 0 |my_malloc_#res.offset|) (<= |my_malloc_#res.offset| 0)) (and (or (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse0) (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) .cse0)) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse1) (<= |my_malloc_#t~ret37.offset| .cse1) (<= .cse1 |my_malloc_#t~ret37.offset|) (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= .cse1 |my_malloc_#res.offset|))) (not (= ~elem~0.offset 0))) (or .cse0 (= my_malloc_~size 8)))) [2020-10-24 01:04:36,586 INFO L270 CegarLoopResult]: At program point my_mallocENTRY(lines 880 882) the Hoare annotation is: (or (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|)) (not (= |my_malloc_#in~size| 8))) [2020-10-24 01:04:36,586 INFO L270 CegarLoopResult]: At program point my_mallocEXIT(lines 880 882) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= 0 |my_malloc_#res.base|) (<= |my_malloc_#res.base| 0) (<= 0 |my_malloc_#res.offset|) (<= |my_malloc_#res.offset| 0)) (and (or (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse0) (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) .cse0)) (not (= ~elem~0.offset 0)) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse1) (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= .cse1 |my_malloc_#res.offset|)))))) [2020-10-24 01:04:36,586 INFO L270 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-10-24 01:04:36,586 INFO L270 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-10-24 01:04:36,586 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-10-24 01:04:36,587 INFO L270 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-10-24 01:04:36,587 INFO L270 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-10-24 01:04:36,587 INFO L270 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-10-24 01:04:36,587 INFO L270 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 902) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-10-24 01:04:36,587 INFO L270 CegarLoopResult]: At program point L889(line 889) the Hoare annotation is: (and (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|) (= ~guard_malloc_counter~0.offset 0)) [2020-10-24 01:04:36,587 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |~#head~0.offset| |old(~#head~0.offset)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(#valid)| |#valid|) (= |#t~string5.base| |old(#t~string5.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-10-24 01:04:36,587 INFO L270 CegarLoopResult]: At program point L902(line 902) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-10-24 01:04:36,587 INFO L270 CegarLoopResult]: At program point L902-1(line 902) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-10-24 01:04:36,588 INFO L270 CegarLoopResult]: At program point L902-2(line 902) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-10-24 01:04:36,588 INFO L270 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-10-24 01:04:36,588 INFO L270 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-10-24 01:04:36,588 INFO L270 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-10-24 01:04:36,588 INFO L270 CegarLoopResult]: At program point L898-2(lines 897 900) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) (and (or (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)) (not (= |list_del_#in~entry.offset| ~elem~0.offset))) (= |old(~elem~0.base)| ~elem~0.base) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset))) [2020-10-24 01:04:36,588 INFO L270 CegarLoopResult]: At program point list_delEXIT(lines 897 900) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) (and (or (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)) (not (= |list_del_#in~entry.offset| ~elem~0.offset))) (= |old(~elem~0.base)| ~elem~0.base) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset))) [2020-10-24 01:04:36,588 INFO L270 CegarLoopResult]: At program point list_delENTRY(lines 897 900) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))) [2020-10-24 01:04:36,589 INFO L270 CegarLoopResult]: At program point L899(line 899) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset))) [2020-10-24 01:04:36,589 INFO L270 CegarLoopResult]: At program point L898(lines 898 899) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset))) [2020-10-24 01:04:36,589 INFO L270 CegarLoopResult]: At program point list_addENTRY(lines 891 895) the Hoare annotation is: (let ((.cse0 (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse0) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0))) [2020-10-24 01:04:36,589 INFO L270 CegarLoopResult]: At program point L894(line 894) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (and .cse2 .cse3) .cse1 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2020-10-24 01:04:36,589 INFO L270 CegarLoopResult]: At program point L893(lines 893 894) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (and .cse2 .cse3) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2020-10-24 01:04:36,589 INFO L270 CegarLoopResult]: At program point L892(line 892) the Hoare annotation is: (let ((.cse0 (= list_add_~new.base |list_add_#in~new.base|)) (.cse1 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse3 (and .cse0 .cse1 (= |old(~elem~0.base)| ~elem~0.base) .cse2))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (and .cse0 (= ~elem~0.base |list_add_#in~new.base|) .cse1 .cse2) (not (<= |list_add_#in~new.offset| 2))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse3) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse3)))) [2020-10-24 01:04:36,590 INFO L270 CegarLoopResult]: At program point L893-1(line 893) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (and .cse2 .cse3) .cse1 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2020-10-24 01:04:36,590 INFO L270 CegarLoopResult]: At program point L891(lines 891 895) the Hoare annotation is: (let ((.cse0 (= list_add_~new.base |list_add_#in~new.base|)) (.cse1 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse3 (and .cse0 .cse1 (= |old(~elem~0.base)| ~elem~0.base) .cse2))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (and .cse0 (= ~elem~0.base |list_add_#in~new.base|) .cse1 .cse2) (not (<= |list_add_#in~new.offset| 2))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse3) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse3)))) [2020-10-24 01:04:36,590 INFO L270 CegarLoopResult]: At program point L892-2(line 892) the Hoare annotation is: (and (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|))) (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (not (<= |list_add_#in~new.offset| 2)))) [2020-10-24 01:04:36,590 INFO L270 CegarLoopResult]: At program point L893-3(line 893) the Hoare annotation is: (let ((.cse5 (= |old(~elem~0.base)| ~elem~0.base)) (.cse6 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse3 (= list_add_~new.base |list_add_#in~new.base|)) (.cse4 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (not (<= 2 |list_add_#in~new.offset|))) (.cse1 (and .cse5 .cse6))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) .cse0 .cse1 (not (<= |list_add_#in~new.offset| 2))) (or .cse2 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse3 .cse4 .cse5 .cse6)) (or .cse2 (and .cse3 .cse4) .cse0 (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse1)))) [2020-10-24 01:04:36,590 INFO L270 CegarLoopResult]: At program point L892-3(line 892) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (and .cse2 .cse3) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2020-10-24 01:04:36,591 INFO L270 CegarLoopResult]: At program point L893-4(lines 891 895) the Hoare annotation is: (let ((.cse4 (= list_add_~new.base |list_add_#in~new.base|)) (.cse5 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse6 (<= 1 ~guard_malloc_counter~0.offset))) (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (and .cse4 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse5 .cse6)) (.cse0 (not .cse6)) (.cse1 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and (= ~elem~0.offset 0) .cse2) .cse3) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse5 .cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) .cse3) (or (and .cse4 .cse5) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse1)))) [2020-10-24 01:04:36,591 INFO L270 CegarLoopResult]: At program point list_addEXIT(lines 891 895) the Hoare annotation is: (let ((.cse4 (= list_add_~new.base |list_add_#in~new.base|)) (.cse5 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse6 (<= 1 ~guard_malloc_counter~0.offset))) (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (and .cse4 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse5 .cse6)) (.cse0 (not .cse6)) (.cse1 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and (= ~elem~0.offset 0) .cse2) .cse3) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse5 .cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) .cse3) (or (and .cse4 .cse5) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse1)))) [2020-10-24 01:04:36,591 INFO L277 CegarLoopResult]: At program point __blast_assertEXIT(lines 6 9) the Hoare annotation is: true [2020-10-24 01:04:36,591 INFO L277 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-10-24 01:04:36,591 INFO L277 CegarLoopResult]: At program point __blast_assertFINAL(lines 6 9) the Hoare annotation is: true [2020-10-24 01:04:36,592 INFO L277 CegarLoopResult]: At program point __blast_assertENTRY(lines 6 9) the Hoare annotation is: true [2020-10-24 01:04:36,592 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 01:04:36,592 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-10-24 01:04:36,592 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 01:04:36,592 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 01:04:36,592 INFO L270 CegarLoopResult]: At program point mainENTRY(lines 904 919) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2020-10-24 01:04:36,592 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 904 919) the Hoare annotation is: true [2020-10-24 01:04:36,593 INFO L270 CegarLoopResult]: At program point L911(line 911) the Hoare annotation is: (let ((.cse1 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)) (.cse2 (<= main_~dev2~0.offset 2)) (.cse0 (<= 2 main_~dev2~0.offset)) (.cse3 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and .cse0 (= ~elem~0.offset 0) (<= 1 ~guard_malloc_counter~0.offset)) (and .cse1 .cse2 (not (= 2 ~elem~0.offset)) .cse0 (= main_~dev2~0.base ~elem~0.base) .cse3) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and .cse1 .cse2 .cse0 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset) .cse3) (not (= |old(~elem~0.offset)| 0)))) [2020-10-24 01:04:36,593 INFO L270 CegarLoopResult]: At program point L910(line 910) the Hoare annotation is: (let ((.cse0 (<= 2 main_~dev2~0.offset)) (.cse1 (<= 1 ~guard_malloc_counter~0.offset))) (or (and .cse0 (= ~elem~0.offset 0) .cse1) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (let ((.cse2 (<= main_~dev2~0.offset 2)) (.cse3 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and .cse2 .cse0 (= main_~dev2~0.base ~elem~0.base) .cse3) (and .cse2 .cse0 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset) .cse3))) .cse1))) [2020-10-24 01:04:36,593 INFO L270 CegarLoopResult]: At program point L909(line 909) the Hoare annotation is: (or (and (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2020-10-24 01:04:36,593 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 904 919) the Hoare annotation is: true [2020-10-24 01:04:36,593 INFO L270 CegarLoopResult]: At program point L908(lines 908 917) the Hoare annotation is: (or (and (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (and (= main_~dev2~0.offset 0) (= main_~dev2~0.base 0)) (not (= |old(~elem~0.offset)| 0))) [2020-10-24 01:04:36,594 INFO L270 CegarLoopResult]: At program point L909-1(line 909) the Hoare annotation is: (let ((.cse1 (+ main_~dev1~0.offset 1))) (let ((.cse0 (<= main_~dev2~0.offset 2)) (.cse2 (<= .cse1 main_~dev2~0.offset)) (.cse3 (<= 1 ~guard_malloc_counter~0.offset))) (or (and .cse0 (<= 2 main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base) (<= .cse1 ~elem~0.offset) .cse2 .cse3) (and .cse0 (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) .cse2 .cse3) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))))) [2020-10-24 01:04:36,594 INFO L270 CegarLoopResult]: At program point L907(line 907) the Hoare annotation is: (or (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0))) [2020-10-24 01:04:36,594 INFO L277 CegarLoopResult]: At program point L908-1(lines 908 917) the Hoare annotation is: true [2020-10-24 01:04:36,594 INFO L270 CegarLoopResult]: At program point L906(line 906) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2020-10-24 01:04:36,594 INFO L270 CegarLoopResult]: At program point L907-1(line 907) the Hoare annotation is: (or (and (= |main_#t~ret40.base| 0) (= |main_#t~ret40.offset| 0)) (and (<= |main_#t~ret40.offset| 2) (<= (+ main_~dev1~0.offset 1) |main_#t~ret40.offset|) (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0))) [2020-10-24 01:04:36,594 INFO L270 CegarLoopResult]: At program point L905(line 905) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2020-10-24 01:04:36,595 INFO L270 CegarLoopResult]: At program point L906-1(line 906) the Hoare annotation is: (or (and (= |main_#t~ret39.base| 0) (= |main_#t~ret39.offset| 0)) (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 |main_#t~ret39.offset|) (<= |main_#t~ret39.offset| ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2020-10-24 01:04:36,595 INFO L270 CegarLoopResult]: At program point L907-2(line 907) the Hoare annotation is: (or (and (= main_~dev2~0.offset 0) (= |main_#t~ret40.base| 0) (= main_~dev2~0.base 0) (= |main_#t~ret40.offset| 0)) (and (<= |main_#t~ret40.offset| 2) (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) (= ~elem~0.offset 0) (<= 2 |main_#t~ret40.offset|) (= |old(~elem~0.base)| ~elem~0.base) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0))) [2020-10-24 01:04:36,595 INFO L270 CegarLoopResult]: At program point L906-2(line 906) the Hoare annotation is: (or (and (= main_~dev1~0.base 0) (= |main_#t~ret39.base| 0) (= main_~dev1~0.offset 0) (= |main_#t~ret39.offset| 0)) (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 |main_#t~ret39.offset|) (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (<= |main_#t~ret39.offset| ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2020-10-24 01:04:36,595 INFO L270 CegarLoopResult]: At program point __getMemoryENTRY(lines 871 878) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,595 INFO L270 CegarLoopResult]: At program point __getMemoryEXIT(lines 871 878) the Hoare annotation is: (let ((.cse2 (= 8 __getMemory_~size))) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse1) (<= .cse1 ~guard_malloc_counter~0.offset) (<= .cse1 |__getMemory_#res.offset|) .cse2 (<= |__getMemory_#res.offset| .cse1))) (and (<= |__getMemory_#res.offset| 0) (<= |__getMemory_#res.base| 0) .cse2 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (not (= ~elem~0.offset 0)))) [2020-10-24 01:04:36,596 INFO L270 CegarLoopResult]: At program point __getMemoryFINAL(lines 871 878) the Hoare annotation is: (let ((.cse2 (= 8 __getMemory_~size))) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse1) (<= .cse1 ~guard_malloc_counter~0.offset) (<= .cse1 |__getMemory_#res.offset|) .cse2 (<= |__getMemory_#res.offset| .cse1))) (and (<= |__getMemory_#res.offset| 0) (<= |__getMemory_#res.base| 0) .cse2 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (not (= ~elem~0.offset 0)))) [2020-10-24 01:04:36,596 INFO L270 CegarLoopResult]: At program point L877(line 877) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,596 INFO L270 CegarLoopResult]: At program point L876(line 876) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (= 8 __getMemory_~size) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,596 INFO L270 CegarLoopResult]: At program point L875(line 875) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,596 INFO L270 CegarLoopResult]: At program point L874(line 874) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#t~post35.offset| |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,597 INFO L270 CegarLoopResult]: At program point L875-1(lines 875 876) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,597 INFO L270 CegarLoopResult]: At program point L873(line 873) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,597 INFO L270 CegarLoopResult]: At program point L874-1(line 874) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= |__getMemory_#t~post35.offset| |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,598 INFO L270 CegarLoopResult]: At program point L875-2(line 875) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (= 8 __getMemory_~size) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,599 INFO L270 CegarLoopResult]: At program point L875-3(line 875) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,599 INFO L270 CegarLoopResult]: At program point L873-2(line 873) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,599 INFO L270 CegarLoopResult]: At program point L873-3(line 873) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2020-10-24 01:04:36,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:04:36 BoogieIcfgContainer [2020-10-24 01:04:36,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 01:04:36,632 INFO L168 Benchmark]: Toolchain (without parser) took 26096.35 ms. Allocated memory was 151.0 MB in the beginning and 330.3 MB in the end (delta: 179.3 MB). Free memory was 126.9 MB in the beginning and 178.9 MB in the end (delta: -52.0 MB). Peak memory consumption was 195.5 MB. Max. memory is 8.0 GB. [2020-10-24 01:04:36,632 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 01:04:36,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 488.64 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 102.3 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2020-10-24 01:04:36,634 INFO L168 Benchmark]: Boogie Preprocessor took 73.65 ms. Allocated memory is still 151.0 MB. Free memory was 102.3 MB in the beginning and 134.2 MB in the end (delta: -31.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 8.0 GB. [2020-10-24 01:04:36,636 INFO L168 Benchmark]: RCFGBuilder took 687.68 ms. Allocated memory is still 151.0 MB. Free memory was 134.2 MB in the beginning and 89.3 MB in the end (delta: 44.9 MB). Peak memory consumption was 45.1 MB. Max. memory is 8.0 GB. [2020-10-24 01:04:36,637 INFO L168 Benchmark]: TraceAbstraction took 24830.39 ms. Allocated memory was 151.0 MB in the beginning and 330.3 MB in the end (delta: 179.3 MB). Free memory was 88.8 MB in the beginning and 178.9 MB in the end (delta: -90.1 MB). Peak memory consumption was 156.9 MB. Max. memory is 8.0 GB. [2020-10-24 01:04:36,642 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 488.64 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 102.3 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 73.65 ms. Allocated memory is still 151.0 MB. Free memory was 102.3 MB in the beginning and 134.2 MB in the end (delta: -31.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 687.68 ms. Allocated memory is still 151.0 MB. Free memory was 134.2 MB in the beginning and 89.3 MB in the end (delta: 44.9 MB). Peak memory consumption was 45.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24830.39 ms. Allocated memory was 151.0 MB in the beginning and 330.3 MB in the end (delta: 179.3 MB). Free memory was 88.8 MB in the beginning and 178.9 MB in the end (delta: -90.1 MB). Peak memory consumption was 156.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 880]: Procedure Contract for my_malloc Derived contract for procedure my_malloc: (!(\old(size) == 8) || size == 8) && ((((!(\old(guard_malloc_counter) <= 1) || (((0 <= \result && \result <= 0) && 0 <= \result) && \result <= 0)) || ((!(1 <= \old(guard_malloc_counter)) || !(\old(size) == 8)) && (!(\old(guard_malloc_counter) == 0) || !(\old(size) == 8)))) || !(elem == 0)) || ((guard_malloc_counter <= \old(guard_malloc_counter) + 1 && \result <= guard_malloc_counter) && \old(guard_malloc_counter) + 1 <= \result)) - ProcedureContractResult [Line: 897]: Procedure Contract for list_del Derived contract for procedure list_del: (!(1 <= guard_malloc_counter) || elem == 0) || (((((!(\old(elem) == entry) || !(entry == elem)) && \old(elem) == elem) && entry == entry) && \old(elem) == elem) && entry == entry) - ProcedureContractResult [Line: 6]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert: 1 - ProcedureContractResult [Line: 891]: Procedure Contract for list_add Derived contract for procedure list_add: (((((!(1 <= guard_malloc_counter) || !(1 <= new)) || !(\old(elem) == 0)) || (elem == 0 && \old(elem) == elem)) || ((((new == new && elem == new) && elem == new) && new == new) && 1 <= guard_malloc_counter)) && (((!(1 <= guard_malloc_counter) || !(new + 1 <= \old(elem))) || (((new == new && new == new) && \old(elem) == elem) && \old(elem) == elem)) || ((((new == new && elem == new) && elem == new) && new == new) && 1 <= guard_malloc_counter))) && ((((new == new && new == new) || !(1 <= guard_malloc_counter)) || !(2 <= new)) || !(\old(elem) == 0)) - ProcedureContractResult [Line: 904]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 871]: Procedure Contract for __getMemory Derived contract for procedure __getMemory: (((!(\old(guard_malloc_counter) <= 1) || ((!(\old(size) == 8) || !(1 <= \old(guard_malloc_counter))) && (!(\old(size) == 8) || !(\old(guard_malloc_counter) == 0)))) || ((((guard_malloc_counter <= \old(guard_malloc_counter) + 1 && \old(guard_malloc_counter) + 1 <= guard_malloc_counter) && \old(guard_malloc_counter) + 1 <= \result) && 8 == size) && \result <= \old(guard_malloc_counter) + 1)) || ((((\result <= 0 && \result <= 0) && 8 == size) && 0 <= \result) && 0 <= \result)) || !(elem == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.8s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 548 SDtfs, 922 SDslu, 2473 SDs, 0 SdLazy, 5783 SolverSat, 388 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 45 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 79 LocationsWithAnnotation, 378 PreInvPairs, 622 NumberOfFragments, 2600 HoareAnnotationTreeSize, 378 FomulaSimplifications, 25223 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 79 FomulaSimplificationsInter, 8535 FormulaSimplificationTreeSizeReductionInter, 7.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 655 NumberOfCodeBlocks, 655 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 646 ConstructedInterpolants, 0 QuantifiedInterpolants, 216634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 104/179 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...