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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:58:57,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:58:57,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:58:57,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:58:57,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:58:57,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:58:57,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:58:57,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:58:57,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:58:57,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:58:57,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:58:57,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:58:57,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:58:57,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:58:57,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:58:57,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:58:57,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:58:57,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:58:57,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:58:57,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:58:57,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:58:57,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:58:57,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:58:57,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:58:57,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:58:57,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:58:57,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:58:57,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:58:57,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:58:57,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:58:57,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:58:57,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:58:57,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:58:57,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:58:57,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:58:57,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:58:57,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:58:57,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:58:57,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:58:57,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:58:57,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:58:57,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:58:57,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:58:57,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:58:57,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:58:57,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:58:57,700 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:58:57,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:58:57,701 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:58:57,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:58:57,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:58:57,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:58:57,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:58:57,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:58:57,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:58:57,703 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:58:57,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:58:57,704 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:58:57,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:58:57,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:58:57,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:58:57,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:58:57,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:58:57,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:58:57,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:58:57,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:58:57,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:58:57,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:58:57,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:58:57,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:58:57,706 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 01:58:58,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:58:58,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:58:58,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:58:58,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:58:58,019 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:58:58,020 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets-1.i [2019-10-15 01:58:58,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0934faf17/5758e410222f432c8b457e139727573c/FLAG4335d49fb [2019-10-15 01:58:58,657 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:58:58,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i [2019-10-15 01:58:58,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0934faf17/5758e410222f432c8b457e139727573c/FLAG4335d49fb [2019-10-15 01:58:58,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0934faf17/5758e410222f432c8b457e139727573c [2019-10-15 01:58:58,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:58:58,919 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:58:58,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:58:58,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:58:58,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:58:58,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:58:58" (1/1) ... [2019-10-15 01:58:58,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca28fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:58, skipping insertion in model container [2019-10-15 01:58:58,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:58:58" (1/1) ... [2019-10-15 01:58:58,936 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:58:58,986 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:58:59,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:58:59,502 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:58:59,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:58:59,617 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:58:59,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59 WrapperNode [2019-10-15 01:58:59,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:58:59,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:58:59,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:58:59,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:58:59,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... [2019-10-15 01:58:59,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:58:59,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:58:59,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:58:59,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:58:59,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:58:59,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:58:59,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:58:59,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:58:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 01:58:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 01:58:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 01:58:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 01:58:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 01:58:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 01:58:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 01:58:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 01:58:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 01:58:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 01:58:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 01:58:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 01:58:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 01:58:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 01:58:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 01:58:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 01:58:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 01:58:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 01:58:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 01:58:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 01:58:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 01:58:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 01:58:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 01:58:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 01:58:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 01:58:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 01:58:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 01:58:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 01:58:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 01:58:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 01:58:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 01:58:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 01:58:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 01:58:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 01:58:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 01:58:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 01:58:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 01:58:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 01:58:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 01:58:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 01:58:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 01:58:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 01:58:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 01:58:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 01:58:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 01:58:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 01:58:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 01:58:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 01:58:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 01:58:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 01:58:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:58:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 01:58:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 01:58:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:58:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 01:58:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 01:58:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 01:58:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 01:58:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 01:58:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 01:58:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 01:58:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 01:58:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 01:58:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:58:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 01:58:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 01:58:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 01:58:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 01:58:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 01:58:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 01:58:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 01:58:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 01:58:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 01:58:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 01:58:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 01:58:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 01:58:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 01:58:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 01:58:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 01:58:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 01:58:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 01:58:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 01:58:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 01:58:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 01:58:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 01:58:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 01:58:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 01:58:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 01:58:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 01:58:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 01:58:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 01:58:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 01:58:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 01:58:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 01:58:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 01:58:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 01:58:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 01:58:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 01:58:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 01:58:59,774 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 01:58:59,774 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 01:58:59,774 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 01:58:59,774 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 01:58:59,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:58:59,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:58:59,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:58:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:58:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:58:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:58:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:58:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:58:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:58:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:58:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:59:00,572 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:59:00,573 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-15 01:59:00,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:59:00 BoogieIcfgContainer [2019-10-15 01:59:00,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:59:00,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:59:00,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:59:00,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:59:00,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:58:58" (1/3) ... [2019-10-15 01:59:00,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a45bae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:59:00, skipping insertion in model container [2019-10-15 01:59:00,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:59" (2/3) ... [2019-10-15 01:59:00,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a45bae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:59:00, skipping insertion in model container [2019-10-15 01:59:00,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:59:00" (3/3) ... [2019-10-15 01:59:00,584 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2019-10-15 01:59:00,593 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:59:00,599 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-15 01:59:00,611 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-15 01:59:00,637 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:59:00,637 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:59:00,637 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:59:00,638 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:59:00,639 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:59:00,639 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:59:00,639 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:59:00,640 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:59:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-10-15 01:59:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-15 01:59:00,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:00,667 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:00,669 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:00,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:00,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1367569032, now seen corresponding path program 1 times [2019-10-15 01:59:00,682 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:00,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251241108] [2019-10-15 01:59:00,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:00,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:00,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:01,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251241108] [2019-10-15 01:59:01,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:01,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:59:01,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983652113] [2019-10-15 01:59:01,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:59:01,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:01,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:59:01,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:59:01,056 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 4 states. [2019-10-15 01:59:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:01,234 INFO L93 Difference]: Finished difference Result 104 states and 168 transitions. [2019-10-15 01:59:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:59:01,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-15 01:59:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:01,251 INFO L225 Difference]: With dead ends: 104 [2019-10-15 01:59:01,251 INFO L226 Difference]: Without dead ends: 63 [2019-10-15 01:59:01,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:59:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-15 01:59:01,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2019-10-15 01:59:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-15 01:59:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-10-15 01:59:01,323 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 9 [2019-10-15 01:59:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:01,323 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-10-15 01:59:01,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:59:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-10-15 01:59:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 01:59:01,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:01,324 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:01,325 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash 26280220, now seen corresponding path program 1 times [2019-10-15 01:59:01,327 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:01,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157556449] [2019-10-15 01:59:01,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:01,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157556449] [2019-10-15 01:59:01,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:01,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:59:01,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590769339] [2019-10-15 01:59:01,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:59:01,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:01,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:59:01,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,447 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2019-10-15 01:59:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:01,544 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-10-15 01:59:01,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:59:01,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-15 01:59:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:01,546 INFO L225 Difference]: With dead ends: 45 [2019-10-15 01:59:01,546 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 01:59:01,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 01:59:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-10-15 01:59:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 01:59:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-10-15 01:59:01,554 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 11 [2019-10-15 01:59:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:01,554 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-10-15 01:59:01,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:59:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-10-15 01:59:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 01:59:01,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:01,555 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:01,556 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash -82509002, now seen corresponding path program 1 times [2019-10-15 01:59:01,556 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:01,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223896474] [2019-10-15 01:59:01,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:01,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223896474] [2019-10-15 01:59:01,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:01,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:59:01,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109469288] [2019-10-15 01:59:01,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:59:01,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:01,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:59:01,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,617 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 3 states. [2019-10-15 01:59:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:01,648 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-10-15 01:59:01,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:59:01,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-15 01:59:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:01,650 INFO L225 Difference]: With dead ends: 43 [2019-10-15 01:59:01,650 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 01:59:01,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:59:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 01:59:01,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2019-10-15 01:59:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 01:59:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-10-15 01:59:01,657 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 12 [2019-10-15 01:59:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:01,657 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-10-15 01:59:01,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:59:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-10-15 01:59:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:59:01,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:01,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:01,659 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:01,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1735436749, now seen corresponding path program 1 times [2019-10-15 01:59:01,659 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:01,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291067054] [2019-10-15 01:59:01,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:01,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:01,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291067054] [2019-10-15 01:59:01,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:01,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:59:01,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940260970] [2019-10-15 01:59:01,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:59:01,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:01,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:59:01,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:59:01,838 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 5 states. [2019-10-15 01:59:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:02,032 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-10-15 01:59:02,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:59:02,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-15 01:59:02,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:02,034 INFO L225 Difference]: With dead ends: 57 [2019-10-15 01:59:02,034 INFO L226 Difference]: Without dead ends: 46 [2019-10-15 01:59:02,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:59:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-15 01:59:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-10-15 01:59:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-15 01:59:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-10-15 01:59:02,055 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 13 [2019-10-15 01:59:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:02,055 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-10-15 01:59:02,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:59:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-10-15 01:59:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:59:02,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:02,061 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:02,062 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:02,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:02,062 INFO L82 PathProgramCache]: Analyzing trace with hash 23609448, now seen corresponding path program 1 times [2019-10-15 01:59:02,062 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:02,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978117443] [2019-10-15 01:59:02,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:02,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:02,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:02,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978117443] [2019-10-15 01:59:02,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905249205] [2019-10-15 01:59:02,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:59:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:02,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-15 01:59:02,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:59:02,604 INFO L341 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2019-10-15 01:59:02,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 42 [2019-10-15 01:59:02,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:02,825 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-10-15 01:59:02,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:02,830 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_51|], 4=[|v_#memory_$Pointer$.base_52|], 6=[|v_#memory_$Pointer$.base_53|]} [2019-10-15 01:59:02,882 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-15 01:59:02,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2019-10-15 01:59:02,883 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:02,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:02,956 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:59:03,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:03,061 INFO L341 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2019-10-15 01:59:03,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 64 [2019-10-15 01:59:03,063 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:03,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:03,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-15 01:59:03,097 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:142, output treesize:126 [2019-10-15 01:59:03,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:03,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-15 01:59:03,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:03,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:03,271 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|, |v_#memory_$Pointer$.offset_51|], 54=[|v_#memory_$Pointer$.base_54|]} [2019-10-15 01:59:03,283 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:03,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:03,330 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_51| vanished before elimination [2019-10-15 01:59:03,927 WARN L191 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 120 [2019-10-15 01:59:03,928 INFO L341 Elim1Store]: treesize reduction 272, result has 51.1 percent of original size [2019-10-15 01:59:03,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 141 treesize of output 342 [2019-10-15 01:59:03,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:03,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:03,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:03,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:03,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:03,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:03,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:03,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:03,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:03,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:03,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:04,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:04,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:04,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:04,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:04,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:04,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:04,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:04,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:59:04,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,075 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:59:04,184 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 45 [2019-10-15 01:59:04,184 INFO L567 ElimStorePlain]: treesize reduction 294, result has 25.6 percent of original size [2019-10-15 01:59:04,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-15 01:59:04,187 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:175, output treesize:130 [2019-10-15 01:59:04,596 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2019-10-15 01:59:04,596 INFO L341 Elim1Store]: treesize reduction 30, result has 88.0 percent of original size [2019-10-15 01:59:04,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 133 treesize of output 269 [2019-10-15 01:59:04,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,619 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:59:04,667 INFO L567 ElimStorePlain]: treesize reduction 104, result has 21.8 percent of original size [2019-10-15 01:59:04,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:59:04,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:4 [2019-10-15 01:59:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:04,673 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:59:04,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:59:04,686 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|, |v_#memory_$Pointer$.offset_52|], 2=[|v_#memory_$Pointer$.base_55|]} [2019-10-15 01:59:04,690 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 01:59:04,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:04,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 8 [2019-10-15 01:59:04,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:04,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:04,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-15 01:59:04,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:59:04,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:04,725 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:59:04,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:59:04,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-15 01:59:04,734 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:61, output treesize:28 [2019-10-15 01:59:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:04,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [789028842] [2019-10-15 01:59:04,814 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 01:59:04,815 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:59:04,820 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:59:04,828 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:59:04,829 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:59:04,963 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:59:15,339 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:59:15,347 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:59:18,024 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_13 Int) (v_prenex_27 Int) (v_DerPreprocessor_14 Int) (v_prenex_26 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_17 Int) (v_prenex_23 Int) (v_DerPreprocessor_18 Int) (v_prenex_22 Int) (v_DerPreprocessor_15 Int) (v_prenex_25 Int) (v_DerPreprocessor_16 Int) (v_prenex_24 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_DerPreprocessor_10 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_DerPreprocessor_19 Int) (v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (v_prenex_10 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_20 Int) (v_prenex_8 Int) (v_prenex_9 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int)) (let ((.cse73 (store |c_old(#valid)| |c_main_#t~malloc0.base| 1))) (let ((.cse74 (store .cse73 |c_main_#t~malloc1.base| 1))) (let ((.cse27 (+ c_main_~bucket~0.offset 8)) (.cse18 (+ c_main_~item~0.offset 4)) (.cse72 (store .cse74 |c_main_#t~malloc3.base| 1))) (let ((.cse0 (not (= |c_main_#t~malloc6.base| 0))) (.cse1 (= 0 |c_#NULL.base|)) (.cse2 (= (select .cse72 |c_main_#t~malloc6.base|) 0)) (.cse3 (= c_main_~bucket~0.base c_main_~bcki~0.base)) (.cse4 (= 0 |c_main_#t~malloc0.offset|)) (.cse5 (= |c_main_#t~malloc1.offset| 0)) (.cse6 (= (select .cse74 |c_main_#t~malloc3.base|) 0)) (.cse7 (<= 0 |c_#NULL.base|)) (.cse8 (= |c_main_#t~malloc3.offset| 0)) (.cse9 (<= 0 |c_#NULL.offset|)) (.cse10 (< |c_#StackHeapBarrier| |c_main_#t~malloc3.base|)) (.cse11 (= (select .cse73 |c_main_#t~malloc1.base|) 0)) (.cse12 (= c_main_~bcki~0.offset c_main_~bucket~0.offset)) (.cse13 (= 0 c_main_~itr~0.base)) (.cse14 (< |c_#StackHeapBarrier| |c_main_#t~malloc0.base|)) (.cse46 (select (select |c_#memory_$Pointer$.base| c_main_~item~0.base) .cse18)) (.cse49 (select |c_old(#memory_$Pointer$.base)| c_main_~bucket~0.base)) (.cse15 (not (= |c_main_#t~malloc0.base| 0))) (.cse16 (not (= |c_main_#t~malloc3.base| 0))) (.cse29 (= |c_#length| (store (store (store (store |c_old(#length)| |c_main_#t~malloc0.base| 12) |c_main_#t~malloc1.base| 12) |c_main_#t~malloc3.base| 12) |c_main_#t~malloc6.base| 8))) (.cse19 (select (select |c_#memory_$Pointer$.offset| c_main_~item~0.base) .cse18)) (.cse26 (select |c_old(#memory_$Pointer$.offset)| c_main_~bucket~0.base)) (.cse34 (= |c_main_#t~malloc6.offset| 0)) (.cse35 (= |c_main_#t~malloc6.offset| c_main_~item~0.offset)) (.cse21 (+ |c_main_#t~malloc3.offset| 8)) (.cse22 (+ |c_main_#t~malloc3.offset| 4)) (.cse24 (+ |c_main_#t~malloc1.offset| 8)) (.cse25 (+ |c_main_#t~malloc1.offset| 4)) (.cse33 (store (select |c_old(#memory_int)| c_main_~bucket~0.base) .cse27 0)) (.cse28 (+ c_main_~bucket~0.offset 4)) (.cse36 (<= |c_#NULL.base| 0)) (.cse37 (= |c_main_#t~malloc0.base| c_main_~bucket~0.base)) (.cse38 (= c_main_~itr~0.offset 0)) (.cse39 (< |c_#StackHeapBarrier| |c_main_#t~malloc1.base|)) (.cse40 (= 0 (select |c_old(#valid)| 0))) (.cse41 (<= |c_#NULL.offset| 0)) (.cse42 (< |c_#StackHeapBarrier| |c_main_#t~malloc6.base|)) (.cse43 (= |c_main_#t~malloc6.base| c_main_~item~0.base)) (.cse44 (= |c_#valid| (store .cse72 |c_main_#t~malloc6.base| 1))) (.cse50 (= (select |c_old(#valid)| |c_main_#t~malloc0.base|) 0)) (.cse51 (= |c_#NULL.offset| 0)) (.cse52 (= c_main_~bucket~0.offset |c_main_#t~malloc0.offset|)) (.cse53 (not (= |c_main_#t~malloc1.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= (let ((.cse17 (let ((.cse20 (let ((.cse23 (store |c_old(#memory_$Pointer$.offset)| c_main_~bucket~0.base (store (store (store .cse26 .cse27 v_prenex_1) .cse28 0) c_main_~bucket~0.offset |c_main_#t~malloc1.offset|)))) (store .cse23 |c_main_#t~malloc1.base| (store (store (store (select .cse23 |c_main_#t~malloc1.base|) .cse24 v_prenex_4) .cse25 0) |c_main_#t~malloc1.offset| |c_main_#t~malloc3.offset|))))) (store .cse20 |c_main_#t~malloc3.base| (store (store (store (select .cse20 |c_main_#t~malloc3.base|) .cse21 v_prenex_14) .cse22 0) |c_main_#t~malloc3.offset| 0))))) (store .cse17 c_main_~item~0.base (store (store (select .cse17 c_main_~item~0.base) c_main_~item~0.offset 0) .cse18 .cse19))) |c_#memory_$Pointer$.offset|) .cse29 (= |c_#memory_int| (let ((.cse30 (let ((.cse31 (let ((.cse32 (store |c_old(#memory_int)| c_main_~bucket~0.base (store (store .cse33 .cse28 v_prenex_12) c_main_~bucket~0.offset v_prenex_5)))) (store .cse32 |c_main_#t~malloc1.base| (store (store (store (select .cse32 |c_main_#t~malloc1.base|) .cse24 1) .cse25 v_prenex_9) |c_main_#t~malloc1.offset| v_prenex_13))))) (store .cse31 |c_main_#t~malloc3.base| (store (store (store (select .cse31 |c_main_#t~malloc3.base|) .cse21 2) .cse22 v_prenex_10) |c_main_#t~malloc3.offset| v_DerPreprocessor_19))))) (store .cse30 c_main_~item~0.base (store (store (select .cse30 c_main_~item~0.base) c_main_~item~0.offset v_DerPreprocessor_17) .cse18 2)))) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (= |c_#memory_$Pointer$.base| (let ((.cse45 (let ((.cse47 (let ((.cse48 (store |c_old(#memory_$Pointer$.base)| c_main_~bucket~0.base (store (store (store .cse49 .cse27 v_prenex_3) .cse28 0) c_main_~bucket~0.offset |c_main_#t~malloc1.base|)))) (store .cse48 |c_main_#t~malloc1.base| (store (store (store (select .cse48 |c_main_#t~malloc1.base|) .cse24 v_prenex_2) .cse25 0) |c_main_#t~malloc1.offset| |c_main_#t~malloc3.base|))))) (store .cse47 |c_main_#t~malloc3.base| (store (store (store (select .cse47 |c_main_#t~malloc3.base|) .cse21 v_prenex_8) .cse22 0) |c_main_#t~malloc3.offset| 0))))) (store .cse45 c_main_~item~0.base (store (store (select .cse45 c_main_~item~0.base) c_main_~item~0.offset 0) .cse18 .cse46)))) .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse34 .cse35 (= (let ((.cse54 (let ((.cse55 (let ((.cse56 (store |c_old(#memory_int)| c_main_~bucket~0.base (store (store .cse33 .cse28 v_DerPreprocessor_4) c_main_~bucket~0.offset v_DerPreprocessor_10)))) (store .cse56 |c_main_#t~malloc1.base| (store (store (store (select .cse56 |c_main_#t~malloc1.base|) .cse24 1) .cse25 v_DerPreprocessor_6) |c_main_#t~malloc1.offset| v_DerPreprocessor_9))))) (store .cse55 |c_main_#t~malloc3.base| (store (store (store (select .cse55 |c_main_#t~malloc3.base|) .cse21 2) .cse22 v_DerPreprocessor_5) |c_main_#t~malloc3.offset| v_DerPreprocessor_20))))) (store .cse54 c_main_~item~0.base (store (store (select .cse54 c_main_~item~0.base) c_main_~item~0.offset v_DerPreprocessor_16) .cse18 0))) |c_#memory_int|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (= (let ((.cse57 (let ((.cse58 (let ((.cse59 (store |c_old(#memory_$Pointer$.offset)| c_main_~bucket~0.base (store (store (store .cse26 .cse27 v_DerPreprocessor_13) .cse28 0) c_main_~bucket~0.offset |c_main_#t~malloc1.offset|)))) (store .cse59 |c_main_#t~malloc1.base| (store (store (store (select .cse59 |c_main_#t~malloc1.base|) .cse24 v_DerPreprocessor_12) .cse25 0) |c_main_#t~malloc1.offset| |c_main_#t~malloc3.offset|))))) (store .cse58 |c_main_#t~malloc3.base| (store (store (store (select .cse58 |c_main_#t~malloc3.base|) .cse21 v_DerPreprocessor_8) .cse22 0) |c_main_#t~malloc3.offset| 0))))) (store .cse57 c_main_~item~0.base (store (store (select .cse57 c_main_~item~0.base) c_main_~item~0.offset 0) .cse18 .cse19))) |c_#memory_$Pointer$.offset|) .cse43 .cse44 (= (let ((.cse60 (let ((.cse61 (let ((.cse62 (store |c_old(#memory_$Pointer$.base)| c_main_~bucket~0.base (store (store (store .cse49 .cse27 v_DerPreprocessor_11) .cse28 0) c_main_~bucket~0.offset |c_main_#t~malloc1.base|)))) (store .cse62 |c_main_#t~malloc1.base| (store (store (store (select .cse62 |c_main_#t~malloc1.base|) .cse24 v_DerPreprocessor_14) .cse25 0) |c_main_#t~malloc1.offset| |c_main_#t~malloc3.base|))))) (store .cse61 |c_main_#t~malloc3.base| (store (store (store (select .cse61 |c_main_#t~malloc3.base|) .cse21 v_DerPreprocessor_7) .cse22 0) |c_main_#t~malloc3.offset| 0))))) (store .cse60 c_main_~item~0.base (store (store (select .cse60 c_main_~item~0.base) c_main_~item~0.offset 0) .cse18 .cse46))) |c_#memory_$Pointer$.base|) .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= (let ((.cse63 (let ((.cse64 (let ((.cse65 (store |c_old(#memory_$Pointer$.base)| c_main_~bucket~0.base (store (store (store .cse49 .cse27 v_prenex_25) .cse28 0) c_main_~bucket~0.offset |c_main_#t~malloc1.base|)))) (store .cse65 |c_main_#t~malloc1.base| (store (store (store (select .cse65 |c_main_#t~malloc1.base|) .cse24 v_prenex_24) .cse25 0) |c_main_#t~malloc1.offset| |c_main_#t~malloc3.base|))))) (store .cse64 |c_main_#t~malloc3.base| (store (store (store (select .cse64 |c_main_#t~malloc3.base|) .cse21 v_prenex_16) .cse22 0) |c_main_#t~malloc3.offset| 0))))) (store .cse63 c_main_~item~0.base (store (store (select .cse63 c_main_~item~0.base) c_main_~item~0.offset 0) .cse18 .cse46))) |c_#memory_$Pointer$.base|) .cse15 .cse16 .cse29 (= (let ((.cse66 (let ((.cse67 (let ((.cse68 (store |c_old(#memory_$Pointer$.offset)| c_main_~bucket~0.base (store (store (store .cse26 .cse27 v_prenex_23) .cse28 0) c_main_~bucket~0.offset |c_main_#t~malloc1.offset|)))) (store .cse68 |c_main_#t~malloc1.base| (store (store (store (select .cse68 |c_main_#t~malloc1.base|) .cse24 v_prenex_26) .cse25 0) |c_main_#t~malloc1.offset| |c_main_#t~malloc3.offset|))))) (store .cse67 |c_main_#t~malloc3.base| (store (store (store (select .cse67 |c_main_#t~malloc3.base|) .cse21 v_prenex_22) .cse22 0) |c_main_#t~malloc3.offset| 0))))) (store .cse66 c_main_~item~0.base (store (store (select .cse66 c_main_~item~0.base) c_main_~item~0.offset 0) .cse18 .cse19))) |c_#memory_$Pointer$.offset|) .cse34 .cse35 (= |c_#memory_int| (let ((.cse69 (let ((.cse70 (let ((.cse71 (store |c_old(#memory_int)| c_main_~bucket~0.base (store (store .cse33 .cse28 v_prenex_20) c_main_~bucket~0.offset v_prenex_27)))) (store .cse71 |c_main_#t~malloc1.base| (store (store (store (select .cse71 |c_main_#t~malloc1.base|) .cse24 1) .cse25 v_prenex_17) |c_main_#t~malloc1.offset| v_prenex_21))))) (store .cse70 |c_main_#t~malloc3.base| (store (store (store (select .cse70 |c_main_#t~malloc3.base|) .cse21 2) .cse22 v_prenex_18) |c_main_#t~malloc3.offset| v_DerPreprocessor_18))))) (store .cse69 c_main_~item~0.base (store (store (select .cse69 c_main_~item~0.base) c_main_~item~0.offset v_DerPreprocessor_15) .cse18 1)))) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse50 .cse51 .cse52 .cse53))))))) is different from false [2019-10-15 01:59:44,228 WARN L191 SmtUtils]: Spent 9.54 s on a formula simplification. DAG size of input: 319 DAG size of output: 312 [2019-10-15 01:59:45,504 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:59:45,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 18 [2019-10-15 01:59:45,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141356711] [2019-10-15 01:59:45,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 01:59:45,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:45,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 01:59:45,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=211, Unknown=7, NotChecked=30, Total=306 [2019-10-15 01:59:45,506 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 18 states.