java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/SifaC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-queue-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-584d7b9 [2019-08-31 03:46:54,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-31 03:46:54,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-31 03:46:54,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-31 03:46:54,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-31 03:46:54,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-31 03:46:54,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-31 03:46:54,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-31 03:46:54,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-31 03:46:54,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-31 03:46:54,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-08-31 03:46:54,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-31 03:46:54,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-31 03:46:54,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-31 03:46:54,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-31 03:46:54,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-31 03:46:54,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-31 03:46:54,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-31 03:46:54,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-31 03:46:54,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-31 03:46:54,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-31 03:46:54,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-31 03:46:54,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-31 03:46:54,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-31 03:46:54,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-31 03:46:54,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-31 03:46:54,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-31 03:46:54,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-31 03:46:54,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-31 03:46:54,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-31 03:46:54,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-31 03:46:54,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-31 03:46:54,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-31 03:46:54,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-31 03:46:54,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-31 03:46:54,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-31 03:46:54,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-31 03:46:54,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-31 03:46:54,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-31 03:46:54,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-31 03:46:54,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-31 03:46:54,846 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-08-31 03:46:54,870 INFO L113 SettingsManager]: Loading preferences was successful [2019-08-31 03:46:54,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-08-31 03:46:54,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-08-31 03:46:54,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-08-31 03:46:54,872 INFO L138 SettingsManager]: * Use SBE=true [2019-08-31 03:46:54,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-08-31 03:46:54,872 INFO L138 SettingsManager]: * sizeof long=4 [2019-08-31 03:46:54,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-08-31 03:46:54,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-08-31 03:46:54,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-08-31 03:46:54,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-08-31 03:46:54,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-08-31 03:46:54,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-08-31 03:46:54,874 INFO L138 SettingsManager]: * sizeof long double=12 [2019-08-31 03:46:54,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-08-31 03:46:54,874 INFO L138 SettingsManager]: * Use constant arrays=true [2019-08-31 03:46:54,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-08-31 03:46:54,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-08-31 03:46:54,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-08-31 03:46:54,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-08-31 03:46:54,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-08-31 03:46:54,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-31 03:46:54,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-08-31 03:46:54,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-08-31 03:46:54,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-08-31 03:46:54,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-08-31 03:46:54,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-08-31 03:46:54,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-08-31 03:46:54,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-08-31 03:46:54,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-31 03:46:54,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-31 03:46:54,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-31 03:46:54,935 INFO L271 PluginConnector]: Initializing CDTParser... [2019-08-31 03:46:54,937 INFO L275 PluginConnector]: CDTParser initialized [2019-08-31 03:46:54,938 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-queue-2.i [2019-08-31 03:46:55,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc08b02a/e6a477b016184ba29c68d1844158fff6/FLAG022073cbb [2019-08-31 03:46:55,635 INFO L306 CDTParser]: Found 1 translation units. [2019-08-31 03:46:55,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-queue-2.i [2019-08-31 03:46:55,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc08b02a/e6a477b016184ba29c68d1844158fff6/FLAG022073cbb [2019-08-31 03:46:55,891 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc08b02a/e6a477b016184ba29c68d1844158fff6 [2019-08-31 03:46:55,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-31 03:46:55,902 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-31 03:46:55,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-08-31 03:46:55,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-08-31 03:46:55,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-08-31 03:46:55,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:46:55" (1/1) ... [2019-08-31 03:46:55,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24827bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:55, skipping insertion in model container [2019-08-31 03:46:55,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:46:55" (1/1) ... [2019-08-31 03:46:55,920 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-08-31 03:46:55,982 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-08-31 03:46:56,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-08-31 03:46:56,479 INFO L188 MainTranslator]: Completed pre-run [2019-08-31 03:46:56,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-08-31 03:46:56,617 INFO L192 MainTranslator]: Completed translation [2019-08-31 03:46:56,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:56 WrapperNode [2019-08-31 03:46:56,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-08-31 03:46:56,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-31 03:46:56,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-31 03:46:56,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-31 03:46:56,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:56" (1/1) ... [2019-08-31 03:46:56,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:56" (1/1) ... [2019-08-31 03:46:56,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:56" (1/1) ... [2019-08-31 03:46:56,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:56" (1/1) ... [2019-08-31 03:46:56,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:56" (1/1) ... [2019-08-31 03:46:56,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:56" (1/1) ... [2019-08-31 03:46:56,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:56" (1/1) ... [2019-08-31 03:46:56,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-31 03:46:56,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-31 03:46:56,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-31 03:46:56,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-31 03:46:56,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:56" (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-08-31 03:46:56,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-08-31 03:46:56,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-31 03:46:56,747 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-31 03:46:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-08-31 03:46:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-08-31 03:46:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-08-31 03:46:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-08-31 03:46:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-08-31 03:46:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-08-31 03:46:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-08-31 03:46:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-08-31 03:46:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-08-31 03:46:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-08-31 03:46:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-08-31 03:46:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-08-31 03:46:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-08-31 03:46:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-08-31 03:46:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-08-31 03:46:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-08-31 03:46:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-08-31 03:46:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-08-31 03:46:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-08-31 03:46:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-08-31 03:46:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-08-31 03:46:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-08-31 03:46:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-08-31 03:46:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-08-31 03:46:56,752 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-08-31 03:46:56,752 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-08-31 03:46:56,752 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-08-31 03:46:56,752 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-08-31 03:46:56,752 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-08-31 03:46:56,752 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-08-31 03:46:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-08-31 03:46:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-08-31 03:46:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-08-31 03:46:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-08-31 03:46:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-08-31 03:46:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-08-31 03:46:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-08-31 03:46:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-08-31 03:46:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-08-31 03:46:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-08-31 03:46:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-08-31 03:46:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-08-31 03:46:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-08-31 03:46:56,755 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-08-31 03:46:56,755 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-08-31 03:46:56,755 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-08-31 03:46:56,755 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-08-31 03:46:56,755 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-08-31 03:46:56,755 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-08-31 03:46:56,756 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-08-31 03:46:56,756 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-08-31 03:46:56,756 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-08-31 03:46:56,756 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-08-31 03:46:56,756 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-08-31 03:46:56,756 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-08-31 03:46:56,757 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-08-31 03:46:56,757 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-08-31 03:46:56,757 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-08-31 03:46:56,757 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-08-31 03:46:56,757 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-08-31 03:46:56,757 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-08-31 03:46:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-08-31 03:46:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-08-31 03:46:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-08-31 03:46:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-08-31 03:46:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-08-31 03:46:56,759 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-08-31 03:46:56,759 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-08-31 03:46:56,759 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-08-31 03:46:56,759 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-08-31 03:46:56,759 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-08-31 03:46:56,759 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-08-31 03:46:56,759 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-08-31 03:46:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-08-31 03:46:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-08-31 03:46:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-08-31 03:46:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-08-31 03:46:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-08-31 03:46:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-08-31 03:46:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-08-31 03:46:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-08-31 03:46:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-08-31 03:46:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-08-31 03:46:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-08-31 03:46:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-08-31 03:46:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-08-31 03:46:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-08-31 03:46:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-08-31 03:46:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-08-31 03:46:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-08-31 03:46:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-08-31 03:46:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-08-31 03:46:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-08-31 03:46:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-08-31 03:46:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-08-31 03:46:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-08-31 03:46:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-08-31 03:46:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-08-31 03:46:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-08-31 03:46:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-08-31 03:46:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-08-31 03:46:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-08-31 03:46:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-08-31 03:46:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-08-31 03:46:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-08-31 03:46:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-31 03:46:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-08-31 03:46:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-08-31 03:46:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-08-31 03:46:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-08-31 03:46:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-08-31 03:46:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-08-31 03:46:56,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-08-31 03:46:56,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-31 03:46:57,475 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-31 03:46:57,475 INFO L283 CfgBuilder]: Removed 31 assume(true) statements. [2019-08-31 03:46:57,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:46:57 BoogieIcfgContainer [2019-08-31 03:46:57,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-31 03:46:57,477 INFO L113 PluginConnector]: ------------------------Sifa---------------------------- [2019-08-31 03:46:57,477 INFO L271 PluginConnector]: Initializing Sifa... [2019-08-31 03:46:57,478 INFO L275 PluginConnector]: Sifa initialized [2019-08-31 03:46:57,479 INFO L185 PluginConnector]: Executing the observer SifaObserver from plugin Sifa for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:46:57" (1/1) ... [2019-08-31 03:46:57,516 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-08-31 03:46:57,516 INFO L169 IcfgInterpreter]: Building call graph [2019-08-31 03:46:57,525 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-08-31 03:46:57,534 INFO L179 IcfgInterpreter]: Starting interpretation [2019-08-31 03:46:57,536 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-08-31 03:46:57,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-31 03:46:57,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 03:46:57,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:46:57,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-31 03:46:57,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-31 03:46:57,689 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-08-31 03:46:58,633 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:58,904 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-08-31 03:46:58,904 INFO L567 ElimStorePlain]: treesize reduction 9, result has 92.9 percent of original size [2019-08-31 03:46:58,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:58,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:138, output treesize:117 [2019-08-31 03:46:59,166 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_9|], 4=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_26|]} [2019-08-31 03:46:59,175 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:59,547 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-08-31 03:46:59,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:46:59,556 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:59,874 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-08-31 03:46:59,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:46:59,882 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:00,185 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-08-31 03:47:00,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:47:00,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:00,188 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:217, output treesize:214 [2019-08-31 03:47:00,227 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:00,538 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-08-31 03:47:00,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:47:00,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:00,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:249, output treesize:237 [2019-08-31 03:47:00,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:47:00,653 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:00,669 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:02,858 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 137 DAG size of output: 123 [2019-08-31 03:47:02,858 INFO L567 ElimStorePlain]: treesize reduction 362, result has 49.4 percent of original size [2019-08-31 03:47:02,865 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:04,129 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 119 [2019-08-31 03:47:04,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:47:04,146 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:05,583 WARN L188 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 116 [2019-08-31 03:47:05,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:47:05,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:05,586 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:663, output treesize:418 [2019-08-31 03:47:05,714 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:07,406 WARN L188 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 124 [2019-08-31 03:47:07,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:47:07,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:07,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:453, output treesize:441 [2019-08-31 03:47:07,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:47:07,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:47:07,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:47:07,809 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:07,824 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:07,841 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:07,982 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:56,839 WARN L188 SmtUtils]: Spent 48.86 s on a formula simplification. DAG size of input: 220 DAG size of output: 200 [2019-08-31 03:47:56,840 INFO L567 ElimStorePlain]: treesize reduction 1015, result has 49.6 percent of original size [2019-08-31 03:47:56,867 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:56,894 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:17,424 WARN L188 SmtUtils]: Spent 20.53 s on a formula simplification that was a NOOP. DAG size: 201 [2019-08-31 03:48:17,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:17,456 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:17,482 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:49,537 WARN L188 SmtUtils]: Spent 32.05 s on a formula simplification that was a NOOP. DAG size: 202 [2019-08-31 03:48:49,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:49,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 23 dim-0 vars, and 2 xjuncts. [2019-08-31 03:48:49,542 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 19 variables, input treesize:1739, output treesize:1224 [2019-08-31 03:48:50,678 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:51,600 WARN L188 SmtUtils]: Spent 921.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-08-31 03:48:51,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:51,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:51,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:453, output treesize:441 [2019-08-31 03:48:51,686 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:57,677 WARN L188 SmtUtils]: Spent 5.99 s on a formula simplification that was a NOOP. DAG size: 152 [2019-08-31 03:48:57,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:57,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:57,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 15 variables, input treesize:840, output treesize:828 [2019-08-31 03:48:57,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:57,726 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_11|], 1=[|v_#valid_18|]} [2019-08-31 03:48:57,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 126 treesize of output 125 [2019-08-31 03:48:57,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:57,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 126 treesize of output 125 [2019-08-31 03:48:57,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:57,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 126 treesize of output 125 [2019-08-31 03:48:57,792 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:57,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 126 treesize of output 125 [2019-08-31 03:48:57,824 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:58,428 WARN L188 SmtUtils]: Spent 603.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-31 03:48:58,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:58,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 122 [2019-08-31 03:48:58,456 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:58,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 122 [2019-08-31 03:48:58,482 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:58,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 122 [2019-08-31 03:48:58,508 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:58,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 122 [2019-08-31 03:48:58,529 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:58,862 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-31 03:48:58,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:58,864 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_35|, |v_#memory_int_29|, |v_#memory_$Pointer$.offset_35|], 2=[|v_#memory_int_9|]} [2019-08-31 03:48:58,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:58,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 130 [2019-08-31 03:48:58,919 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:58,969 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:58,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 130 [2019-08-31 03:48:58,971 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:58,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:58,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 106 [2019-08-31 03:48:58,998 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:59,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:59,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 106 [2019-08-31 03:48:59,031 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:59,599 WARN L188 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-08-31 03:48:59,600 INFO L567 ElimStorePlain]: treesize reduction 32, result has 93.2 percent of original size [2019-08-31 03:48:59,617 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 0 case distinctions, treesize of input 106 treesize of output 91 [2019-08-31 03:48:59,617 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:59,631 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 0 case distinctions, treesize of input 114 treesize of output 99 [2019-08-31 03:48:59,632 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:59,644 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 0 case distinctions, treesize of input 106 treesize of output 91 [2019-08-31 03:48:59,645 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:59,658 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 0 case distinctions, treesize of input 114 treesize of output 99 [2019-08-31 03:48:59,659 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:59,877 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-08-31 03:48:59,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:59,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:59,923 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 99 treesize of output 110 [2019-08-31 03:48:59,924 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:59,942 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 0 case distinctions, treesize of input 91 treesize of output 78 [2019-08-31 03:48:59,943 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:59,983 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 0 case distinctions, treesize of input 91 treesize of output 78 [2019-08-31 03:48:59,984 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:00,040 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:49:00,041 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 99 treesize of output 110 [2019-08-31 03:49:00,041 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:00,463 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-08-31 03:49:00,464 INFO L567 ElimStorePlain]: treesize reduction 32, result has 91.5 percent of original size [2019-08-31 03:49:00,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 79 [2019-08-31 03:49:00,482 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:00,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 63 [2019-08-31 03:49:00,495 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:00,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 79 [2019-08-31 03:49:00,505 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:00,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 63 [2019-08-31 03:49:00,515 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:00,691 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-08-31 03:49:00,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:49:00,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:00,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:00,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-08-31 03:49:00,696 INFO L221 ElimStorePlain]: Needed 25 recursive calls to eliminate 8 variables, input treesize:505, output treesize:285 [2019-08-31 03:49:00,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:00,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:00,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:00,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:00,723 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 30=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|]} [2019-08-31 03:49:00,737 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 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:49:00,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:00,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:00,754 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 0 case distinctions, treesize of input 117 treesize of output 1 [2019-08-31 03:49:00,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:00,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:49:00,769 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:00,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:49:00,800 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:00,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:00,819 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 0 case distinctions, treesize of input 117 treesize of output 1 [2019-08-31 03:49:00,820 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:00,832 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 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:49:00,832 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,086 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-08-31 03:49:01,086 INFO L567 ElimStorePlain]: treesize reduction 234, result has 44.9 percent of original size [2019-08-31 03:49:01,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:01,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:49:01,102 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:01,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:49:01,115 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:49:01,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:01,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:49:01,223 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:01,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:49:01,233 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:49:01,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-08-31 03:49:01,314 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:675, output treesize:115 [2019-08-31 03:49:01,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:01,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:01,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:01,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:01,349 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 30=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|]} [2019-08-31 03:49:01,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:49:01,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:49:01,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:49:01,390 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,404 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 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:49:01,405 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,417 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 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:49:01,418 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:01,428 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 0 case distinctions, treesize of input 117 treesize of output 1 [2019-08-31 03:49:01,429 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,684 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-08-31 03:49:01,684 INFO L567 ElimStorePlain]: treesize reduction 347, result has 35.5 percent of original size [2019-08-31 03:49:01,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:01,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:49:01,712 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:01,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:49:01,733 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:49:01,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:01,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:49:01,837 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:01,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:49:01,850 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:49:01,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-08-31 03:49:01,923 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:675, output treesize:115 [2019-08-31 03:49:01,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:01,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:01,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:01,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:01,947 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 30=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|]} [2019-08-31 03:49:01,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:49:01,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:01,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:49:01,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:02,005 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 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:49:02,006 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:02,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:49:02,055 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:02,069 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 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:49:02,069 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:02,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:02,099 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 0 case distinctions, treesize of input 117 treesize of output 1 [2019-08-31 03:49:02,100 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:02,373 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-08-31 03:49:02,373 INFO L567 ElimStorePlain]: treesize reduction 347, result has 35.5 percent of original size [2019-08-31 03:49:02,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:02,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:49:02,397 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:02,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:02,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:49:02,420 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:02,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:49:02,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:02,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:49:02,532 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:02,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:49:02,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:49:02,543 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-08-31 03:49:02,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:49:02,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-08-31 03:49:02,625 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:675, output treesize:115 [2019-08-31 03:49:02,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:03,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:03,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:03,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:03,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:03,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:03,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:03,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:03,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:03,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:03,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:04,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:04,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:04,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:04,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:04,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:05,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:05,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:05,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:05,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:05,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:05,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:05,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:05,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:05,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:06,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:06,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:06,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:06,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:06,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:06,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:06,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:06,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:06,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:06,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:49:06,301 INFO L183 IcfgInterpreter]: Interpretation finished [2019-08-31 03:49:06,301 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-08-31 03:49:06,303 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 11988#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (= 0 main_~head~0.base) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset)) [2019-08-31 03:49:06,304 INFO L193 IcfgInterpreter]: Reachable states at location mainErr7ASSERT_VIOLATIONERROR_FUNCTION satisfy 10628#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (<= 2 main_~status~0) (<= main_~status~0 2) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (or (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1))) (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) [2019-08-31 03:49:06,304 INFO L193 IcfgInterpreter]: Reachable states at location mainErr11ASSERT_VIOLATIONERROR_FUNCTION satisfy 8727#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) 0) (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 3 main_~status~0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= main_~status~0 2)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) (<= 2 main_~status~0) (<= main_~status~0 2))) (<= main_~status~0 3) (= main_~status~0 3) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) [2019-08-31 03:49:06,304 INFO L193 IcfgInterpreter]: Reachable states at location mainErr9ASSERT_VIOLATIONERROR_FUNCTION satisfy 11119#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 3 main_~status~0) (or (not (= main_~status~0 2)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) (<= 2 main_~status~0) (<= main_~status~0 2))) (<= main_~status~0 3) (= main_~status~0 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) [2019-08-31 03:49:06,305 INFO L193 IcfgInterpreter]: Reachable states at location mainErr2ASSERT_VIOLATIONERROR_FUNCTION satisfy 11951#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (= 0 main_~head~0.base) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset) (exists ((v_DerPreprocessor_1 Int)) (or (and (not (= 0 main_~item~0.offset)) (not (= 0 main_~head~0.base))) (and (not (= 0 main_~head~0.offset)) (not (= main_~item~0.base 0))) (and (not (= main_~item~0.base 0)) (not (= 0 main_~head~0.base))) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= main_~head~0.offset main_~item~0.offset) (= main_~status~0 0) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (= main_~item~0.base main_~head~0.base) (= 0 (select |old(#valid)| 0)) (= (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_1) (+ main_~head~0.offset 4) 0)) |#memory_int|) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (not (= 0 main_~item~0.offset)) (not (= 0 main_~head~0.offset)))))) [2019-08-31 03:49:06,305 INFO L193 IcfgInterpreter]: Reachable states at location mainErr1ASSERT_VIOLATIONERROR_FUNCTION satisfy 11982#(and (<= 0 main_~item~0.base) (= 0 main_~item~0.offset) (<= main_~item~0.base 0) (= main_~item~0.base 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 0 main_~item~0.offset) (<= main_~item~0.offset 0)) [2019-08-31 03:49:06,305 INFO L193 IcfgInterpreter]: Reachable states at location mainErr6ASSERT_VIOLATIONERROR_FUNCTION satisfy 11311#(and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) [2019-08-31 03:49:06,306 INFO L193 IcfgInterpreter]: Reachable states at location mainErr4ASSERT_VIOLATIONERROR_FUNCTION satisfy 11776#true [2019-08-31 03:49:06,306 INFO L193 IcfgInterpreter]: Reachable states at location mainErr5ASSERT_VIOLATIONERROR_FUNCTION satisfy 11670#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (= 0 main_~head~0.base) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset)) [2019-08-31 03:49:06,306 INFO L193 IcfgInterpreter]: Reachable states at location mainErr10ASSERT_VIOLATIONERROR_FUNCTION satisfy 9539#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 3 main_~status~0) (or (not (= main_~status~0 2)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) (<= 2 main_~status~0) (<= main_~status~0 2))) (<= main_~status~0 3) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (= main_~status~0 3) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) [2019-08-31 03:49:06,306 INFO L193 IcfgInterpreter]: Reachable states at location mainErr13ASSERT_VIOLATIONERROR_FUNCTION satisfy 8913#(and (not (= main_~status~0 0)) (<= (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4)) 0)) [2019-08-31 03:49:06,307 INFO L193 IcfgInterpreter]: Reachable states at location mainErr8ASSERT_VIOLATIONERROR_FUNCTION satisfy 11466#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (= 0 main_~head~0.base) (<= 3 main_~status~0) (or (not (= main_~status~0 2)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) (<= 2 main_~status~0) (<= main_~status~0 2))) (<= main_~status~0 3) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset) (= main_~status~0 3)) [2019-08-31 03:49:06,307 INFO L193 IcfgInterpreter]: Reachable states at location mainErr3ASSERT_VIOLATIONERROR_FUNCTION satisfy 11854#false [2019-08-31 03:49:06,307 INFO L193 IcfgInterpreter]: Reachable states at location mainErr12ASSERT_VIOLATIONERROR_FUNCTION satisfy 7233#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) 4)) 3) (<= 3 main_~status~0) (<= main_~status~0 3)) [2019-08-31 03:49:06,339 INFO L103 SifaObserver]: ✘ Some error locations might be reachable, see reported results. [2019-08-31 03:49:06,340 INFO L132 PluginConnector]: ------------------------ END Sifa---------------------------- [2019-08-31 03:49:06,342 INFO L168 Benchmark]: Toolchain (without parser) took 130439.23 ms. Allocated memory was 132.1 MB in the beginning and 445.1 MB in the end (delta: 313.0 MB). Free memory was 86.6 MB in the beginning and 106.9 MB in the end (delta: -20.3 MB). Peak memory consumption was 292.7 MB. Max. memory is 7.1 GB. [2019-08-31 03:49:06,342 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-08-31 03:49:06,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.66 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 86.4 MB in the beginning and 163.9 MB in the end (delta: -77.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-08-31 03:49:06,343 INFO L168 Benchmark]: Boogie Preprocessor took 75.06 ms. Allocated memory is still 199.8 MB. Free memory was 163.9 MB in the beginning and 160.1 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-08-31 03:49:06,344 INFO L168 Benchmark]: RCFGBuilder took 783.03 ms. Allocated memory is still 199.8 MB. Free memory was 160.1 MB in the beginning and 106.8 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. [2019-08-31 03:49:06,345 INFO L168 Benchmark]: Sifa took 128862.79 ms. Allocated memory was 199.8 MB in the beginning and 445.1 MB in the end (delta: 245.4 MB). Free memory was 106.8 MB in the beginning and 106.9 MB in the end (delta: -134.7 kB). Peak memory consumption was 245.2 MB. Max. memory is 7.1 GB. [2019-08-31 03:49:06,347 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 714.66 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 86.4 MB in the beginning and 163.9 MB in the end (delta: -77.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.06 ms. Allocated memory is still 199.8 MB. Free memory was 163.9 MB in the beginning and 160.1 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 783.03 ms. Allocated memory is still 199.8 MB. Free memory was 160.1 MB in the beginning and 106.8 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. * Sifa took 128862.79 ms. Allocated memory was 199.8 MB in the beginning and 445.1 MB in the end (delta: 245.4 MB). Free memory was 106.8 MB in the beginning and 106.9 MB in the end (delta: -134.7 kB). Peak memory consumption was 245.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.sifa: - StatisticsResult: Symbolic Interpretation with Fluid Abstractions 128.8s OVERALL_TIME, 2 ICFG_INTERPRETER_ENTERED_PROCEDURES, 5961 DAG_INTERPRETER_EARLY_EXIT_QUERIES, 733 DAG_INTERPRETER_EARLY_EXITS, 4717 TOOLS_POST_APPLICATIONS, 123.3s TOOLS_POST_TIME, 2 TOOLS_POST_CALL_APPLICATIONS, 0.0s TOOLS_POST_CALL_TIME, 1 TOOLS_POST_RETURN_APPLICATIONS, 0.0s TOOLS_POST_RETURN_TIME, 123.0s TOOLS_QUANTIFIERELIM_TIME, 0.1s FLUID_QUERY_TIME, 6667 FLUID_QUERIES, 150 FLUID_YES_ANSWERS, 1471 DOMAIN_JOIN_APPLICATIONS, 0.9s DOMAIN_JOIN_TIME, 150 DOMAIN_ALPHA_APPLICATIONS, 0.3s DOMAIN_ALPHA_TIME, 2 DOMAIN_WIDEN_APPLICATIONS, 0.0s DOMAIN_WIDEN_TIME, 706 DOMAIN_ISSUBSETEQ_APPLICATIONS, 0.1s DOMAIN_ISSUBSETEQ_TIME, 1777 DOMAIN_ISBOTTOM_APPLICATIONS, 2.9s DOMAIN_ISBOTTOM_TIME, 785 LOOP_SUMMARIZER_APPLICATIONS, 704 LOOP_SUMMARIZER_CACHE_MISSES, 123.7s LOOP_SUMMARIZER_OVERALL_TIME, 123.7s LOOP_SUMMARIZER_NEW_COMPUTATION_TIME, 706 LOOP_SUMMARIZER_FIXPOINT_ITERATIONS, 1 CALL_SUMMARIZER_APPLICATIONS, 1 CALL_SUMMARIZER_CACHE_MISSES, 0.1s CALL_SUMMARIZER_OVERALL_TIME, 0.1s CALL_SUMMARIZER_NEW_COMPUTATION_TIME, 0.0s PROCEDURE_GRAPH_BUILDER_TIME, 0.0s PATH_EXPR_TIME, 0.0s REGEX_TO_DAG_TIME, 0.8s DAG_COMPRESSION_TIME, 36316 DAG_COMPRESSION_PROCESSED_NODES, 14125 DAG_COMPRESSION_RETAINED_NODES - UnprovableResult [Line: 1013]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 11988#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (= 0 main_~head~0.base) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset)). Possible FailurePath: - UnprovableResult [Line: 1027]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 10628#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (<= 2 main_~status~0) (<= main_~status~0 2) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (or (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1))) (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))). Possible FailurePath: - UnprovableResult [Line: 1034]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 8727#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) 0) (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 3 main_~status~0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= main_~status~0 2)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) (<= 2 main_~status~0) (<= main_~status~0 2))) (<= main_~status~0 3) (= main_~status~0 3) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))). Possible FailurePath: - UnprovableResult [Line: 1032]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 11119#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 3 main_~status~0) (or (not (= main_~status~0 2)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) (<= 2 main_~status~0) (<= main_~status~0 2))) (<= main_~status~0 3) (= main_~status~0 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))). Possible FailurePath: - PositiveResult [Line: 1017]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - UnprovableResult [Line: 1014]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 11982#(and (<= 0 main_~item~0.base) (= 0 main_~item~0.offset) (<= main_~item~0.base 0) (= main_~item~0.base 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 0 main_~item~0.offset) (<= main_~item~0.offset 0)). Possible FailurePath: - UnprovableResult [Line: 1026]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 11311#(and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))). Possible FailurePath: - UnprovableResult [Line: 1021]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 11776#true. Possible FailurePath: - UnprovableResult [Line: 1025]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 11670#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (= 0 main_~head~0.base) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset)). Possible FailurePath: - UnprovableResult [Line: 1033]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 9539#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 3 main_~status~0) (or (not (= main_~status~0 2)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) (<= 2 main_~status~0) (<= main_~status~0 2))) (<= main_~status~0 3) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (= main_~status~0 3) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))). Possible FailurePath: - UnprovableResult [Line: 1042]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 8913#(and (not (= main_~status~0 0)) (<= (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4)) 0)). Possible FailurePath: - UnprovableResult [Line: 1031]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 11466#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (= 0 main_~head~0.base) (<= 3 main_~status~0) (or (not (= main_~status~0 2)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) (<= 2 main_~status~0) (<= main_~status~0 2))) (<= main_~status~0 3) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset) (= main_~status~0 3)). Possible FailurePath: - PositiveResult [Line: 1020]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - UnprovableResult [Line: 1035]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 7233#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) 4)) 3) (<= 3 main_~status~0) (<= main_~status~0 3)). Possible FailurePath: RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...