/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:39:56,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:39:56,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:39:56,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:39:56,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:39:56,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:39:56,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:39:56,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:39:56,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:39:56,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:39:56,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:39:56,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:39:56,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:39:56,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:39:56,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:39:56,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:39:56,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:39:56,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:39:56,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:39:56,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:39:56,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:39:56,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:39:56,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:39:56,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:39:56,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:39:56,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:39:56,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:39:56,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:39:56,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:39:56,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:39:56,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:39:56,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:39:56,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:39:56,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:39:56,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:39:56,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:39:56,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:39:56,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:39:56,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:39:56,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:39:56,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:39:56,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:39:56,682 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:39:56,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:39:56,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:39:56,686 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:39:56,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:39:56,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:39:56,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:39:56,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:39:56,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:39:56,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:39:56,689 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:39:56,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:39:56,690 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:39:56,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:39:56,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:39:56,691 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:39:56,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:39:56,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:39:56,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:39:56,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:39:56,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:39:56,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:39:56,692 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:39:57,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:39:57,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:39:57,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:39:57,263 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:39:57,265 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:39:57,267 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2020-09-04 16:39:57,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cb2afddcb/b94ed0b323ab47d1b3bca9af9cc1f8f2/FLAG2828d9ed3 [2020-09-04 16:39:58,092 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:39:58,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2020-09-04 16:39:58,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cb2afddcb/b94ed0b323ab47d1b3bca9af9cc1f8f2/FLAG2828d9ed3 [2020-09-04 16:39:58,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cb2afddcb/b94ed0b323ab47d1b3bca9af9cc1f8f2 [2020-09-04 16:39:58,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:39:58,260 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:39:58,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:39:58,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:39:58,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:39:58,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:39:58" (1/1) ... [2020-09-04 16:39:58,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a11bedd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:39:58, skipping insertion in model container [2020-09-04 16:39:58,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:39:58" (1/1) ... [2020-09-04 16:39:58,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:39:58,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:39:58,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:39:58,981 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:39:59,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:39:59,154 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:39:59,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:39:59 WrapperNode [2020-09-04 16:39:59,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:39:59,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:39:59,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:39:59,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:39:59,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:39:59" (1/1) ... [2020-09-04 16:39:59,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:39:59" (1/1) ... [2020-09-04 16:39:59,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:39:59" (1/1) ... [2020-09-04 16:39:59,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:39:59" (1/1) ... [2020-09-04 16:39:59,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:39:59" (1/1) ... [2020-09-04 16:39:59,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:39:59" (1/1) ... [2020-09-04 16:39:59,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:39:59" (1/1) ... [2020-09-04 16:39:59,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:39:59,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:39:59,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:39:59,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:39:59,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:39:59" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 16:39:59,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:39:59,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:39:59,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-09-04 16:39:59,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2020-09-04 16:39:59,323 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2020-09-04 16:39:59,323 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2020-09-04 16:39:59,323 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2020-09-04 16:39:59,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:39:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:39:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-09-04 16:39:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2020-09-04 16:39:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2020-09-04 16:39:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2020-09-04 16:39:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2020-09-04 16:39:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2020-09-04 16:39:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2020-09-04 16:39:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2020-09-04 16:39:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2020-09-04 16:39:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2020-09-04 16:39:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2020-09-04 16:39:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2020-09-04 16:39:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2020-09-04 16:39:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2020-09-04 16:39:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2020-09-04 16:39:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2020-09-04 16:39:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2020-09-04 16:39:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2020-09-04 16:39:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2020-09-04 16:39:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2020-09-04 16:39:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2020-09-04 16:39:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2020-09-04 16:39:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2020-09-04 16:39:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2020-09-04 16:39:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2020-09-04 16:39:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2020-09-04 16:39:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2020-09-04 16:39:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2020-09-04 16:39:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2020-09-04 16:39:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2020-09-04 16:39:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2020-09-04 16:39:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2020-09-04 16:39:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2020-09-04 16:39:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2020-09-04 16:39:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2020-09-04 16:39:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2020-09-04 16:39:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2020-09-04 16:39:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2020-09-04 16:39:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2020-09-04 16:39:59,335 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2020-09-04 16:39:59,335 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2020-09-04 16:39:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2020-09-04 16:39:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2020-09-04 16:39:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2020-09-04 16:39:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2020-09-04 16:39:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2020-09-04 16:39:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2020-09-04 16:39:59,337 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2020-09-04 16:39:59,337 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2020-09-04 16:39:59,337 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2020-09-04 16:39:59,337 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2020-09-04 16:39:59,337 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2020-09-04 16:39:59,337 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2020-09-04 16:39:59,337 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2020-09-04 16:39:59,338 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2020-09-04 16:39:59,338 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-09-04 16:39:59,338 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2020-09-04 16:39:59,338 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2020-09-04 16:39:59,338 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2020-09-04 16:39:59,338 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2020-09-04 16:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2020-09-04 16:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2020-09-04 16:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2020-09-04 16:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2020-09-04 16:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2020-09-04 16:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2020-09-04 16:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2020-09-04 16:39:59,340 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2020-09-04 16:39:59,340 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2020-09-04 16:39:59,340 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2020-09-04 16:39:59,341 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2020-09-04 16:39:59,342 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2020-09-04 16:39:59,342 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2020-09-04 16:39:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2020-09-04 16:39:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2020-09-04 16:39:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2020-09-04 16:39:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2020-09-04 16:39:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2020-09-04 16:39:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2020-09-04 16:39:59,345 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2020-09-04 16:39:59,345 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2020-09-04 16:39:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2020-09-04 16:39:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2020-09-04 16:39:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2020-09-04 16:39:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2020-09-04 16:39:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2020-09-04 16:39:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2020-09-04 16:39:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2020-09-04 16:39:59,347 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2020-09-04 16:39:59,347 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2020-09-04 16:39:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2020-09-04 16:39:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2020-09-04 16:39:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2020-09-04 16:39:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2020-09-04 16:39:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2020-09-04 16:39:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2020-09-04 16:39:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2020-09-04 16:39:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2020-09-04 16:39:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2020-09-04 16:39:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2020-09-04 16:39:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2020-09-04 16:39:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2020-09-04 16:39:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 16:39:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 16:39:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-09-04 16:39:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 16:39:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-09-04 16:39:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2020-09-04 16:39:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-09-04 16:39:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2020-09-04 16:39:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2020-09-04 16:39:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2020-09-04 16:39:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2020-09-04 16:39:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2020-09-04 16:39:59,353 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2020-09-04 16:39:59,353 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2020-09-04 16:39:59,353 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2020-09-04 16:39:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2020-09-04 16:39:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2020-09-04 16:39:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2020-09-04 16:39:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:39:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2020-09-04 16:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2020-09-04 16:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2020-09-04 16:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2020-09-04 16:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 16:39:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-09-04 16:39:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:39:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 16:39:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 16:39:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 16:40:00,061 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:40:00,062 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:40:00,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:40:00 BoogieIcfgContainer [2020-09-04 16:40:00,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:40:00,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:40:00,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:40:00,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:40:00,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:39:58" (1/3) ... [2020-09-04 16:40:00,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e934b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:40:00, skipping insertion in model container [2020-09-04 16:40:00,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:39:59" (2/3) ... [2020-09-04 16:40:00,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e934b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:40:00, skipping insertion in model container [2020-09-04 16:40:00,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:40:00" (3/3) ... [2020-09-04 16:40:00,081 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2020-09-04 16:40:00,096 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:40:00,110 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:40:00,137 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:40:00,167 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:40:00,167 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:40:00,167 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:40:00,167 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:40:00,168 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:40:00,168 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:40:00,168 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:40:00,168 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:40:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2020-09-04 16:40:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 16:40:00,202 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:40:00,204 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] [2020-09-04 16:40:00,204 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:40:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:40:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1653885127, now seen corresponding path program 1 times [2020-09-04 16:40:00,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:40:00,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [74160496] [2020-09-04 16:40:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:40:00,313 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:40:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:00,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:40:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:40:00,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [74160496] [2020-09-04 16:40:00,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:40:00,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:40:00,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652383984] [2020-09-04 16:40:00,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:40:00,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:40:00,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:40:00,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:40:00,645 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 7 states. [2020-09-04 16:40:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:40:01,153 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2020-09-04 16:40:01,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:40:01,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-09-04 16:40:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:40:01,171 INFO L225 Difference]: With dead ends: 126 [2020-09-04 16:40:01,172 INFO L226 Difference]: Without dead ends: 66 [2020-09-04 16:40:01,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:40:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-04 16:40:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2020-09-04 16:40:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-09-04 16:40:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2020-09-04 16:40:01,249 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 21 [2020-09-04 16:40:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:40:01,250 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2020-09-04 16:40:01,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:40:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2020-09-04 16:40:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 16:40:01,254 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:40:01,254 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] [2020-09-04 16:40:01,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:40:01,255 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:40:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:40:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1154270079, now seen corresponding path program 1 times [2020-09-04 16:40:01,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:40:01,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104376894] [2020-09-04 16:40:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:40:01,264 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:40:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:01,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:40:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:01,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 16:40:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:01,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:01,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 16:40:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:01,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 16:40:01,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104376894] [2020-09-04 16:40:01,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:40:01,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:40:01,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621633117] [2020-09-04 16:40:01,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:40:01,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:40:01,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:40:01,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:40:01,614 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 9 states. [2020-09-04 16:40:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:40:02,004 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2020-09-04 16:40:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:40:02,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-09-04 16:40:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:40:02,009 INFO L225 Difference]: With dead ends: 97 [2020-09-04 16:40:02,009 INFO L226 Difference]: Without dead ends: 72 [2020-09-04 16:40:02,012 INFO L675 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-09-04 16:40:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-04 16:40:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2020-09-04 16:40:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 16:40:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2020-09-04 16:40:02,046 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 61 [2020-09-04 16:40:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:40:02,048 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2020-09-04 16:40:02,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:40:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2020-09-04 16:40:02,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 16:40:02,053 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:40:02,053 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] [2020-09-04 16:40:02,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:40:02,055 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:40:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:40:02,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1617160578, now seen corresponding path program 1 times [2020-09-04 16:40:02,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:40:02,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1397108084] [2020-09-04 16:40:02,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:40:02,067 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:40:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:02,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:40:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:02,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 16:40:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:02,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:02,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 16:40:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:02,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 16:40:02,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1397108084] [2020-09-04 16:40:02,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:40:02,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:40:02,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081098835] [2020-09-04 16:40:02,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:40:02,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:40:02,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:40:02,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:40:02,428 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 9 states. [2020-09-04 16:40:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:40:02,795 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2020-09-04 16:40:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:40:02,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-09-04 16:40:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:40:02,798 INFO L225 Difference]: With dead ends: 100 [2020-09-04 16:40:02,799 INFO L226 Difference]: Without dead ends: 64 [2020-09-04 16:40:02,800 INFO L675 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-09-04 16:40:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-09-04 16:40:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2020-09-04 16:40:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 16:40:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2020-09-04 16:40:02,816 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 61 [2020-09-04 16:40:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:40:02,817 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2020-09-04 16:40:02,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:40:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-09-04 16:40:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 16:40:02,819 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:40:02,819 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] [2020-09-04 16:40:02,820 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:40:02,820 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:40:02,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:40:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1531514875, now seen corresponding path program 1 times [2020-09-04 16:40:02,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:40:02,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [128630019] [2020-09-04 16:40:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:40:02,830 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:40:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:03,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:40:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:03,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 16:40:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:03,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:03,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 16:40:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:03,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 16:40:03,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [128630019] [2020-09-04 16:40:03,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:40:03,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:40:03,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902306666] [2020-09-04 16:40:03,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:40:03,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:40:03,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:40:03,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:40:03,291 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 17 states. [2020-09-04 16:40:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:40:04,589 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2020-09-04 16:40:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:40:04,591 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2020-09-04 16:40:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:40:04,594 INFO L225 Difference]: With dead ends: 106 [2020-09-04 16:40:04,594 INFO L226 Difference]: Without dead ends: 91 [2020-09-04 16:40:04,599 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 16:40:04,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-09-04 16:40:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2020-09-04 16:40:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 16:40:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2020-09-04 16:40:04,631 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 61 [2020-09-04 16:40:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:40:04,632 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2020-09-04 16:40:04,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:40:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-09-04 16:40:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 16:40:04,634 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:40:04,634 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] [2020-09-04 16:40:04,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:40:04,635 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:40:04,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:40:04,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2098824736, now seen corresponding path program 1 times [2020-09-04 16:40:04,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:40:04,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1402641929] [2020-09-04 16:40:04,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:40:04,641 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:40:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:04,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:40:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:04,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 16:40:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:04,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:04,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 16:40:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:04,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:04,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 16:40:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:40:05,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1402641929] [2020-09-04 16:40:05,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:40:05,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:40:05,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139931400] [2020-09-04 16:40:05,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:40:05,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:40:05,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:40:05,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:40:05,029 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 18 states. [2020-09-04 16:40:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:40:06,229 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2020-09-04 16:40:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:40:06,231 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2020-09-04 16:40:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:40:06,234 INFO L225 Difference]: With dead ends: 89 [2020-09-04 16:40:06,235 INFO L226 Difference]: Without dead ends: 86 [2020-09-04 16:40:06,236 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 16:40:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-04 16:40:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2020-09-04 16:40:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 16:40:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-09-04 16:40:06,261 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 70 [2020-09-04 16:40:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:40:06,265 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-09-04 16:40:06,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:40:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-09-04 16:40:06,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-09-04 16:40:06,277 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:40:06,278 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] [2020-09-04 16:40:06,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:40:06,278 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:40:06,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:40:06,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2039706158, now seen corresponding path program 1 times [2020-09-04 16:40:06,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:40:06,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1251609083] [2020-09-04 16:40:06,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:40:06,289 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:40:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:06,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:40:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:06,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 16:40:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:06,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:06,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 16:40:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:06,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:06,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 16:40:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:40:06,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1251609083] [2020-09-04 16:40:06,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:40:06,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:40:06,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274275640] [2020-09-04 16:40:06,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:40:06,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:40:06,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:40:06,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:40:06,907 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 23 states. [2020-09-04 16:40:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:40:08,770 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-09-04 16:40:08,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:40:08,771 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2020-09-04 16:40:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:40:08,772 INFO L225 Difference]: With dead ends: 93 [2020-09-04 16:40:08,773 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 16:40:08,774 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 16:40:08,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 16:40:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2020-09-04 16:40:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 16:40:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2020-09-04 16:40:08,814 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 71 [2020-09-04 16:40:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:40:08,818 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2020-09-04 16:40:08,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:40:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2020-09-04 16:40:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-09-04 16:40:08,820 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:40:08,823 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] [2020-09-04 16:40:08,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:40:08,824 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:40:08,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:40:08,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2033290459, now seen corresponding path program 1 times [2020-09-04 16:40:08,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:40:08,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [461688845] [2020-09-04 16:40:08,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:40:08,832 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:40:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:09,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:40:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:09,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 16:40:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:09,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:09,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 16:40:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:09,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:09,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 16:40:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:09,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 16:40:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:09,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 16:40:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:40:09,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [461688845] [2020-09-04 16:40:09,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:40:09,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 16:40:09,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145277372] [2020-09-04 16:40:09,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 16:40:09,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:40:09,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 16:40:09,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:40:09,472 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 24 states. [2020-09-04 16:40:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:40:11,031 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2020-09-04 16:40:11,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:40:11,032 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2020-09-04 16:40:11,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:40:11,035 INFO L225 Difference]: With dead ends: 89 [2020-09-04 16:40:11,036 INFO L226 Difference]: Without dead ends: 82 [2020-09-04 16:40:11,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 16:40:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-09-04 16:40:11,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-09-04 16:40:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-09-04 16:40:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2020-09-04 16:40:11,057 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 85 [2020-09-04 16:40:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:40:11,058 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2020-09-04 16:40:11,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 16:40:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2020-09-04 16:40:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-09-04 16:40:11,060 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:40:11,060 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] [2020-09-04 16:40:11,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:40:11,061 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:40:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:40:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash 571953633, now seen corresponding path program 2 times [2020-09-04 16:40:11,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:40:11,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [270232089] [2020-09-04 16:40:11,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:40:11,066 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:40:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:11,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:40:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:11,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 16:40:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:11,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:11,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 16:40:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:11,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:11,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 16:40:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:11,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 16:40:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:11,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 16:40:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-04 16:40:11,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [270232089] [2020-09-04 16:40:11,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:40:11,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:40:11,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372385172] [2020-09-04 16:40:11,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:40:11,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:40:11,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:40:11,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:40:11,374 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 10 states. [2020-09-04 16:40:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:40:12,055 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2020-09-04 16:40:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:40:12,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2020-09-04 16:40:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:40:12,057 INFO L225 Difference]: With dead ends: 89 [2020-09-04 16:40:12,058 INFO L226 Difference]: Without dead ends: 80 [2020-09-04 16:40:12,059 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:40:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-04 16:40:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2020-09-04 16:40:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 16:40:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2020-09-04 16:40:12,076 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 85 [2020-09-04 16:40:12,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:40:12,076 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2020-09-04 16:40:12,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:40:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-09-04 16:40:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 16:40:12,078 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:40:12,079 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] [2020-09-04 16:40:12,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:40:12,079 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:40:12,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:40:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash 578402155, now seen corresponding path program 1 times [2020-09-04 16:40:12,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:40:12,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [425625266] [2020-09-04 16:40:12,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:40:12,084 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:40:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:12,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:40:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:12,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 16:40:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:12,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:12,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 16:40:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:12,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:12,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 16:40:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:12,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 16:40:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:12,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 16:40:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:40:12,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [425625266] [2020-09-04 16:40:12,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:40:12,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:40:12,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518511791] [2020-09-04 16:40:12,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:40:12,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:40:12,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:40:12,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:40:12,628 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 23 states. [2020-09-04 16:40:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:40:14,306 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2020-09-04 16:40:14,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:40:14,307 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2020-09-04 16:40:14,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:40:14,308 INFO L225 Difference]: With dead ends: 87 [2020-09-04 16:40:14,308 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 16:40:14,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=214, Invalid=1766, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 16:40:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 16:40:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 16:40:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:40:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-09-04 16:40:14,323 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 86 [2020-09-04 16:40:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:40:14,324 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-09-04 16:40:14,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:40:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-09-04 16:40:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 16:40:14,325 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:40:14,326 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] [2020-09-04 16:40:14,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:40:14,326 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:40:14,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:40:14,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1773366491, now seen corresponding path program 2 times [2020-09-04 16:40:14,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:40:14,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [573829588] [2020-09-04 16:40:14,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:40:14,331 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:40:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:14,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:40:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:14,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 16:40:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:14,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:14,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 16:40:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:14,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 16:40:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:14,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 16:40:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:14,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 16:40:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:14,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 16:40:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:40:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 16:40:14,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [573829588] [2020-09-04 16:40:14,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:40:14,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:40:14,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280505430] [2020-09-04 16:40:14,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:40:14,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:40:14,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:40:14,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:40:14,848 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 19 states. [2020-09-04 16:40:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:40:16,181 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-09-04 16:40:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:40:16,182 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2020-09-04 16:40:16,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:40:16,183 INFO L225 Difference]: With dead ends: 78 [2020-09-04 16:40:16,183 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:40:16,184 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 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-09-04 16:40:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:40:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:40:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:40:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:40:16,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2020-09-04 16:40:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:40:16,186 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:40:16,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:40:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:40:16,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:40:16,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:40:16,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:40:19,314 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-09-04 16:40:19,509 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-09-04 16:40:19,760 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2020-09-04 16:40:20,224 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2020-09-04 16:40:20,384 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2020-09-04 16:40:20,630 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-09-04 16:40:21,000 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-09-04 16:40:21,125 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2020-09-04 16:40:21,511 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2020-09-04 16:40:21,771 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-09-04 16:40:22,076 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-09-04 16:40:22,248 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-09-04 16:40:22,442 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-09-04 16:40:22,629 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2020-09-04 16:40:22,810 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-09-04 16:40:23,057 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2020-09-04 16:40:23,284 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-09-04 16:40:23,810 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-09-04 16:40:23,985 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2020-09-04 16:40:24,342 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2020-09-04 16:40:24,348 INFO L264 CegarLoopResult]: At program point my_mallocFINAL(lines 878 880) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (= my_malloc_~size 8)) (or (and (<= 0 |my_malloc_#res.base|) (<= |my_malloc_#res.base| 0) (<= 0 |my_malloc_#res.offset|) (<= |my_malloc_#res.offset| 0)) (and (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)) (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))))) [2020-09-04 16:40:24,349 INFO L264 CegarLoopResult]: At program point L879(line 879) 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)|) (= my_malloc_~size 8)) (not (= |my_malloc_#in~size| 8))) [2020-09-04 16:40:24,349 INFO L264 CegarLoopResult]: At program point L879-1(line 879) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (= my_malloc_~size 8)) (or (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~ret30.offset|) (<= 0 |my_malloc_#t~ret30.base|) (<= |my_malloc_#t~ret30.base| 0) (<= |my_malloc_#t~ret30.offset| 0)) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#t~ret30.offset|) (<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))))) [2020-09-04 16:40:24,350 INFO L264 CegarLoopResult]: At program point L879-2(line 879) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (= my_malloc_~size 8)) (or (and (<= 0 |my_malloc_#t~ret30.offset|) (<= 0 |my_malloc_#t~ret30.base|) (<= 0 |my_malloc_#res.base|) (<= |my_malloc_#res.base| 0) (<= 0 |my_malloc_#res.offset|) (<= |my_malloc_#t~ret30.base| 0) (<= |my_malloc_#t~ret30.offset| 0) (<= |my_malloc_#res.offset| 0)) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= .cse1 |my_malloc_#t~ret30.offset|) (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset) (<= .cse1 |my_malloc_#res.offset|))) (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))))) [2020-09-04 16:40:24,350 INFO L264 CegarLoopResult]: At program point my_mallocENTRY(lines 878 880) 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-09-04 16:40:24,350 INFO L264 CegarLoopResult]: At program point my_mallocEXIT(lines 878 880) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (= my_malloc_~size 8)) (or (and (<= 0 |my_malloc_#res.base|) (<= |my_malloc_#res.base| 0) (<= 0 |my_malloc_#res.offset|) (<= |my_malloc_#res.offset| 0)) (and (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)) (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))))) [2020-09-04 16:40:24,351 INFO L264 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-09-04 16:40:24,351 INFO L264 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-09-04 16:40:24,351 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 900) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 16:40:24,351 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |old(#length)| |#length|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |~#head~0.offset| |old(~#head~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~elem~0.base |old(~elem~0.base)|) (= |old(#valid)| |#valid|)) [2020-09-04 16:40:24,352 INFO L264 CegarLoopResult]: At program point L887(line 887) 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-09-04 16:40:24,352 INFO L264 CegarLoopResult]: At program point L900(line 900) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 16:40:24,352 INFO L264 CegarLoopResult]: At program point L867(line 867) 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-09-04 16:40:24,352 INFO L264 CegarLoopResult]: At program point L900-1(line 900) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 16:40:24,352 INFO L264 CegarLoopResult]: At program point L900-2(line 900) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 16:40:24,352 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 16:40:24,353 INFO L264 CegarLoopResult]: At program point L897(line 897) the Hoare annotation is: (and (= |old(~elem~0.offset)| |list_del_#in~entry.offset|) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) [2020-09-04 16:40:24,353 INFO L264 CegarLoopResult]: At program point L896(lines 896 897) the Hoare annotation is: (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) [2020-09-04 16:40:24,353 INFO L264 CegarLoopResult]: At program point L896-2(lines 895 898) 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)| |list_del_#in~entry.offset|) .cse0) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) .cse0))) [2020-09-04 16:40:24,353 INFO L264 CegarLoopResult]: At program point list_delEXIT(lines 895 898) 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)| |list_del_#in~entry.offset|) .cse0) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) .cse0))) [2020-09-04 16:40:24,354 INFO L264 CegarLoopResult]: At program point list_delENTRY(lines 895 898) the Hoare annotation is: (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) [2020-09-04 16:40:24,354 INFO L264 CegarLoopResult]: At program point list_addENTRY(lines 889 893) the Hoare annotation is: (let ((.cse0 (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)))) (and (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-09-04 16:40:24,354 INFO L264 CegarLoopResult]: At program point L892(line 892) the Hoare annotation is: (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse1 (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) .cse2 .cse3))) (and (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse1) (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse2 .cse3))))) [2020-09-04 16:40:24,354 INFO L264 CegarLoopResult]: At program point L891(lines 891 892) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse1 (= list_add_~new.base |list_add_#in~new.base|)) (.cse2 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse4 (= |old(~elem~0.offset)| ~elem~0.offset))) (and (or .cse0 (and .cse1 .cse2) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse1 .cse2 .cse3 .cse4)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse3 .cse4)))) [2020-09-04 16:40:24,355 INFO L264 CegarLoopResult]: At program point L890(line 890) the Hoare annotation is: (let ((.cse0 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse3 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse4 (= list_add_~new.base |list_add_#in~new.base|))) (and (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse0 .cse1 .cse2)) (or .cse3 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse0 .cse1 .cse2)) (or .cse3 .cse4 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))))) [2020-09-04 16:40:24,355 INFO L264 CegarLoopResult]: At program point L891-1(line 891) the Hoare annotation is: (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse1 (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) .cse2 .cse3))) (and (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse1) (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse2 .cse3))))) [2020-09-04 16:40:24,355 INFO L264 CegarLoopResult]: At program point L889(lines 889 893) the Hoare annotation is: (let ((.cse0 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse3 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse4 (= list_add_~new.base |list_add_#in~new.base|))) (and (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse0 .cse1 .cse2)) (or .cse3 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse0 .cse1 .cse2)) (or .cse3 .cse4 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))))) [2020-09-04 16:40:24,355 INFO L264 CegarLoopResult]: At program point L890-2(line 890) 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)|)))) [2020-09-04 16:40:24,355 INFO L264 CegarLoopResult]: At program point L891-3(line 891) the Hoare annotation is: (let ((.cse1 (= list_add_~new.base |list_add_#in~new.base|)) (.cse2 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse4 (= |old(~elem~0.offset)| ~elem~0.offset))) (and (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse1 .cse2 .cse3 .cse4)) (or (and .cse1 .cse2) .cse0 (not (<= 2 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse3 .cse4)))) [2020-09-04 16:40:24,356 INFO L264 CegarLoopResult]: At program point L890-3(line 890) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse1 (= list_add_~new.base |list_add_#in~new.base|)) (.cse2 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse4 (= |old(~elem~0.offset)| ~elem~0.offset))) (and (or .cse0 (and .cse1 .cse2) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse1 .cse2 .cse3 .cse4)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse3 .cse4)))) [2020-09-04 16:40:24,356 INFO L264 CegarLoopResult]: At program point L891-4(lines 889 893) the Hoare annotation is: (let ((.cse5 (= list_add_~new.base |list_add_#in~new.base|)) (.cse6 (= |list_add_#in~new.offset| list_add_~new.offset))) (let ((.cse1 (and .cse5 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse6)) (.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse4 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and .cse2 .cse3) .cse4) (or .cse0 .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse5 .cse6 .cse2 .cse3)) (or (and .cse5 .cse6) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse4)))) [2020-09-04 16:40:24,356 INFO L264 CegarLoopResult]: At program point list_addEXIT(lines 889 893) the Hoare annotation is: (let ((.cse5 (= list_add_~new.base |list_add_#in~new.base|)) (.cse6 (= |list_add_#in~new.offset| list_add_~new.offset))) (let ((.cse1 (and .cse5 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse6)) (.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse4 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and .cse2 .cse3) .cse4) (or .cse0 .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse5 .cse6 .cse2 .cse3)) (or (and .cse5 .cse6) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse4)))) [2020-09-04 16:40:24,356 INFO L271 CegarLoopResult]: At program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) the Hoare annotation is: true [2020-09-04 16:40:24,357 INFO L271 CegarLoopResult]: At program point __blast_assertEXIT(lines 4 7) the Hoare annotation is: true [2020-09-04 16:40:24,357 INFO L271 CegarLoopResult]: At program point __blast_assertFINAL(lines 4 7) the Hoare annotation is: true [2020-09-04 16:40:24,357 INFO L271 CegarLoopResult]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2020-09-04 16:40:24,357 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:40:24,357 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 16:40:24,357 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:40:24,357 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:40:24,357 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 902 917) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 16:40:24,357 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 902 917) the Hoare annotation is: true [2020-09-04 16:40:24,358 INFO L264 CegarLoopResult]: At program point L909(line 909) the Hoare annotation is: (or (and (<= 2 main_~dev2~0.offset) (= ~elem~0.offset 0) (<= 1 ~guard_malloc_counter~0.offset)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= (+ ~elem~0.offset 1) main_~dev2~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 16:40:24,358 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 902 917) the Hoare annotation is: true [2020-09-04 16:40:24,358 INFO L264 CegarLoopResult]: At program point L908(line 908) the Hoare annotation is: (let ((.cse2 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset))) (let ((.cse0 (<= 2 main_~dev2~0.offset)) (.cse1 (let ((.cse3 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)) (.cse4 (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)) (.cse5 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and .cse3 .cse4 (= main_~dev2~0.base ~elem~0.base) (= main_~dev2~0.offset ~elem~0.offset) .cse5) (and .cse3 .cse2 .cse4 .cse5))))) (or (and .cse0 (= ~elem~0.offset 0) (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and .cse0 .cse1) (and .cse2 .cse1)))) [2020-09-04 16:40:24,358 INFO L264 CegarLoopResult]: At program point L907(line 907) the Hoare annotation is: (or (and (<= 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) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 16:40:24,359 INFO L264 CegarLoopResult]: At program point L906(lines 906 915) the Hoare annotation is: (or (and (<= 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) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev2~0.offset 0) (= main_~dev2~0.base 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 16:40:24,359 INFO L264 CegarLoopResult]: At program point L907-1(line 907) the Hoare annotation is: (let ((.cse0 (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)) (.cse1 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and (<= 1 main_~dev1~0.offset) .cse0 (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) .cse1) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (<= 2 main_~dev2~0.offset) .cse0 (= main_~dev2~0.base ~elem~0.base) (= main_~dev2~0.offset ~elem~0.offset) .cse1 (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~elem~0.offset)| 0)))) [2020-09-04 16:40:24,359 INFO L264 CegarLoopResult]: At program point L905(line 905) the Hoare annotation is: (or (and (<= 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-09-04 16:40:24,359 INFO L271 CegarLoopResult]: At program point L906-1(lines 906 915) the Hoare annotation is: true [2020-09-04 16:40:24,359 INFO L264 CegarLoopResult]: At program point L904(line 904) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 16:40:24,359 INFO L264 CegarLoopResult]: At program point L905-1(line 905) the Hoare annotation is: (or (and (<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|) (<= 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)) (and (= |main_#t~ret33.base| 0) (= |main_#t~ret33.offset| 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 16:40:24,360 INFO L264 CegarLoopResult]: At program point L903(line 903) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 16:40:24,360 INFO L264 CegarLoopResult]: At program point L904-1(line 904) the Hoare annotation is: (or (and (<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset) (<= 1 |main_#t~ret32.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)) (and (= |main_#t~ret32.offset| 0) (= |main_#t~ret32.base| 0))) [2020-09-04 16:40:24,360 INFO L264 CegarLoopResult]: At program point L905-2(line 905) the Hoare annotation is: (or (and (= main_~dev2~0.offset 0) (= |main_#t~ret33.base| 0) (= |main_#t~ret33.offset| 0) (= main_~dev2~0.base 0)) (let ((.cse0 (+ main_~dev1~0.offset 1))) (and (<= .cse0 |main_#t~ret33.offset|) (<= 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) (<= .cse0 main_~dev2~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-09-04 16:40:24,360 INFO L264 CegarLoopResult]: At program point L904-2(line 904) the Hoare annotation is: (or (and (<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset) (<= 1 main_~dev1~0.offset) (<= 1 |main_#t~ret32.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_#t~ret32.offset| 0) (= main_~dev1~0.offset 0) (= |main_#t~ret32.base| 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 16:40:24,360 INFO L264 CegarLoopResult]: At program point __getMemoryENTRY(lines 869 876) 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)|)) (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-09-04 16:40:24,361 INFO L264 CegarLoopResult]: At program point __getMemoryEXIT(lines 869 876) the Hoare annotation is: (let ((.cse1 (= 8 __getMemory_~size))) (or (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 (<= |__getMemory_#res.offset| 0) (<= |__getMemory_#res.base| 0) .cse1 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|) .cse1 (<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)))) [2020-09-04 16:40:24,361 INFO L264 CegarLoopResult]: At program point __getMemoryFINAL(lines 869 876) the Hoare annotation is: (let ((.cse1 (= 8 __getMemory_~size))) (or (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 (<= |__getMemory_#res.offset| 0) (<= |__getMemory_#res.base| 0) .cse1 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|) .cse1 (<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)))) [2020-09-04 16:40:24,361 INFO L264 CegarLoopResult]: At program point L875(line 875) the Hoare annotation is: (or (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)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-09-04 16:40:24,361 INFO L264 CegarLoopResult]: At program point L874(line 874) the Hoare annotation is: (or (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-09-04 16:40:24,361 INFO L264 CegarLoopResult]: At program point L873(line 873) the Hoare annotation is: (or (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)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-09-04 16:40:24,361 INFO L264 CegarLoopResult]: At program point L872(line 872) the Hoare annotation is: (or (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)|) (= |old(~guard_malloc_counter~0.offset)| |__getMemory_#t~post28.offset|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2020-09-04 16:40:24,362 INFO L264 CegarLoopResult]: At program point L873-1(lines 873 874) the Hoare annotation is: (or (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)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-09-04 16:40:24,362 INFO L264 CegarLoopResult]: At program point L871(line 871) the Hoare annotation is: (or (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-09-04 16:40:24,362 INFO L264 CegarLoopResult]: At program point L872-1(line 872) the Hoare annotation is: (or (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 (= |old(~guard_malloc_counter~0.offset)| |__getMemory_#t~post28.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2020-09-04 16:40:24,362 INFO L264 CegarLoopResult]: At program point L873-2(line 873) the Hoare annotation is: (or (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-09-04 16:40:24,362 INFO L264 CegarLoopResult]: At program point L873-3(line 873) the Hoare annotation is: (or (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)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-09-04 16:40:24,363 INFO L264 CegarLoopResult]: At program point L871-2(line 871) the Hoare annotation is: (or (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-09-04 16:40:24,363 INFO L264 CegarLoopResult]: At program point L871-3(line 871) the Hoare annotation is: (or (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-09-04 16:40:24,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:40:24 BoogieIcfgContainer [2020-09-04 16:40:24,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:40:24,399 INFO L168 Benchmark]: Toolchain (without parser) took 26140.78 ms. Allocated memory was 146.3 MB in the beginning and 421.5 MB in the end (delta: 275.3 MB). Free memory was 102.8 MB in the beginning and 209.0 MB in the end (delta: -106.3 MB). Peak memory consumption was 271.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:40:24,400 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 146.3 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 16:40:24,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 894.65 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 168.0 MB in the end (delta: -65.5 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:40:24,402 INFO L168 Benchmark]: Boogie Preprocessor took 74.99 ms. Allocated memory is still 203.4 MB. Free memory was 168.0 MB in the beginning and 165.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:40:24,403 INFO L168 Benchmark]: RCFGBuilder took 836.91 ms. Allocated memory is still 203.4 MB. Free memory was 165.3 MB in the beginning and 118.4 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2020-09-04 16:40:24,404 INFO L168 Benchmark]: TraceAbstraction took 24326.94 ms. Allocated memory was 203.4 MB in the beginning and 421.5 MB in the end (delta: 218.1 MB). Free memory was 117.8 MB in the beginning and 209.0 MB in the end (delta: -91.3 MB). Peak memory consumption was 229.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:40:24,408 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 146.3 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 894.65 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 168.0 MB in the end (delta: -65.5 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.99 ms. Allocated memory is still 203.4 MB. Free memory was 168.0 MB in the beginning and 165.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.91 ms. Allocated memory is still 203.4 MB. Free memory was 165.3 MB in the beginning and 118.4 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24326.94 ms. Allocated memory was 203.4 MB in the beginning and 421.5 MB in the end (delta: 218.1 MB). Free memory was 117.8 MB in the beginning and 209.0 MB in the end (delta: -91.3 MB). Peak memory consumption was 229.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 878]: Procedure Contract for my_malloc Derived contract for procedure my_malloc: (!(\old(size) == 8) || size == 8) && ((((((0 <= \result && \result <= 0) && 0 <= \result) && \result <= 0) || (\result <= guard_malloc_counter && \old(guard_malloc_counter) + 1 <= \result)) || ((!(1 <= \old(guard_malloc_counter)) || !(\old(size) == 8)) && (!(\old(guard_malloc_counter) == 0) || !(\old(size) == 8)))) || !(elem == 0)) - ProcedureContractResult [Line: 895]: Procedure Contract for list_del Derived contract for procedure list_del: (\old(elem) == entry || (\old(elem) == elem && \old(elem) == elem)) && ((!(1 <= guard_malloc_counter) || elem == 0) || (\old(elem) == elem && \old(elem) == elem)) - ProcedureContractResult [Line: 4]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert: 1 - ProcedureContractResult [Line: 889]: Procedure Contract for list_add Derived contract for procedure list_add: (((((!(1 <= guard_malloc_counter) || !(1 <= new)) || (((new == new && elem == new) && elem == new) && new == new)) || (\old(elem) == elem && \old(elem) == elem)) || !(\old(elem) == 0)) && (((!(1 <= guard_malloc_counter) || (((new == new && elem == new) && elem == new) && new == new)) || !(new + 1 <= \old(elem))) || (((new == new && new == new) && \old(elem) == elem) && \old(elem) == elem))) && ((((new == new && new == new) || !(1 <= guard_malloc_counter)) || !(2 <= new)) || !(\old(elem) == 0)) - ProcedureContractResult [Line: 902]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 869]: Procedure Contract for __getMemory Derived contract for procedure __getMemory: ((((!(\old(size) == 8) || !(1 <= \old(guard_malloc_counter))) && (!(\old(size) == 8) || !(\old(guard_malloc_counter) == 0))) || ((((\result <= 0 && \result <= 0) && 8 == size) && 0 <= \result) && 0 <= \result)) || !(elem == 0)) || ((\old(guard_malloc_counter) + 1 <= \result && 8 == size) && \result <= guard_malloc_counter) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.0s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 545 SDtfs, 784 SDslu, 2053 SDs, 0 SdLazy, 5834 SolverSat, 366 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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, 10 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 357 PreInvPairs, 641 NumberOfFragments, 2152 HoareAnnotationTreeSize, 357 FomulaSimplifications, 30106 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 70 FomulaSimplificationsInter, 6529 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...