java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-queue_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:51:33,921 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:51:33,923 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:51:33,938 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:51:33,938 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:51:33,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:51:33,943 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:51:33,945 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:51:33,948 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:51:33,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:51:33,950 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:51:33,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:51:33,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:51:33,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:51:33,956 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:51:33,958 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:51:33,960 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:51:33,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:51:33,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:51:33,974 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:51:33,975 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:51:33,981 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:51:33,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:51:33,986 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:51:33,986 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:51:33,987 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:51:33,988 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:51:33,990 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:51:33,991 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:51:33,994 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:51:33,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:51:33,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:51:33,995 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:51:33,995 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:51:33,996 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:51:33,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:51:33,997 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 21:51:34,012 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:51:34,012 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:51:34,013 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:51:34,013 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:51:34,014 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:51:34,014 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:51:34,014 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:51:34,015 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:51:34,015 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:51:34,015 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:51:34,015 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:51:34,015 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:51:34,016 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:51:34,016 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:51:34,016 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:51:34,016 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:51:34,016 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:51:34,017 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:51:34,017 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:51:34,017 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:51:34,017 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:51:34,017 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:51:34,018 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:51:34,018 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:51:34,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:51:34,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:51:34,020 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:51:34,020 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:51:34,020 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:51:34,020 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:51:34,021 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:51:34,021 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:51:34,021 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:51:34,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:51:34,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:51:34,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:51:34,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:51:34,086 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:51:34,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-18 21:51:34,153 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eac5cc53/3a3ae0aab3a044e799dc530e00c3d5be/FLAGd9c1817a3 [2018-11-18 21:51:34,775 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:51:34,775 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-18 21:51:34,789 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eac5cc53/3a3ae0aab3a044e799dc530e00c3d5be/FLAGd9c1817a3 [2018-11-18 21:51:35,021 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eac5cc53/3a3ae0aab3a044e799dc530e00c3d5be [2018-11-18 21:51:35,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:51:35,036 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:51:35,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:51:35,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:51:35,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:51:35,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:51:35" (1/1) ... [2018-11-18 21:51:35,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b3c57b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:35, skipping insertion in model container [2018-11-18 21:51:35,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:51:35" (1/1) ... [2018-11-18 21:51:35,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:51:35,110 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:51:35,520 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:51:35,549 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:51:35,732 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:51:35,797 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:51:35,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:35 WrapperNode [2018-11-18 21:51:35,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:51:35,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:51:35,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:51:35,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:51:35,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:35" (1/1) ... [2018-11-18 21:51:35,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:35" (1/1) ... [2018-11-18 21:51:35,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:35" (1/1) ... [2018-11-18 21:51:35,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:35" (1/1) ... [2018-11-18 21:51:35,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:35" (1/1) ... [2018-11-18 21:51:35,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:35" (1/1) ... [2018-11-18 21:51:35,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:35" (1/1) ... [2018-11-18 21:51:35,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:51:35,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:51:35,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:51:35,919 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:51:35,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:35" (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 [2018-11-18 21:51:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:51:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:51:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:51:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 21:51:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 21:51:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 21:51:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 21:51:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 21:51:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 21:51:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 21:51:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 21:51:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 21:51:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 21:51:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 21:51:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 21:51:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 21:51:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 21:51:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 21:51:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 21:51:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 21:51:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 21:51:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 21:51:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 21:51:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 21:51:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 21:51:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 21:51:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 21:51:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 21:51:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 21:51:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 21:51:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 21:51:35,979 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 21:51:35,979 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 21:51:35,979 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 21:51:35,979 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 21:51:35,979 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 21:51:35,979 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 21:51:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 21:51:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 21:51:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 21:51:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 21:51:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 21:51:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 21:51:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 21:51:35,981 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 21:51:35,981 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 21:51:35,981 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 21:51:35,981 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 21:51:35,981 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 21:51:35,981 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 21:51:35,982 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 21:51:35,982 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 21:51:35,982 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 21:51:35,982 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 21:51:35,982 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 21:51:35,982 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 21:51:35,982 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 21:51:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 21:51:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 21:51:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 21:51:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 21:51:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 21:51:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 21:51:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 21:51:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 21:51:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 21:51:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 21:51:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 21:51:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 21:51:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 21:51:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 21:51:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 21:51:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 21:51:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 21:51:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 21:51:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 21:51:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 21:51:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 21:51:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 21:51:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 21:51:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 21:51:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 21:51:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 21:51:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 21:51:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 21:51:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 21:51:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 21:51:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 21:51:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 21:51:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 21:51:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 21:51:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 21:51:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 21:51:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 21:51:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 21:51:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 21:51:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 21:51:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 21:51:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 21:51:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 21:51:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 21:51:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 21:51:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 21:51:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 21:51:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 21:51:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 21:51:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 21:51:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:51:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:51:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:51:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 21:51:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:51:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 21:51:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:51:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:51:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:51:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:51:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:51:37,623 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:51:37,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:51:37 BoogieIcfgContainer [2018-11-18 21:51:37,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:51:37,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:51:37,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:51:37,629 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:51:37,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:51:35" (1/3) ... [2018-11-18 21:51:37,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b62f5b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:51:37, skipping insertion in model container [2018-11-18 21:51:37,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:35" (2/3) ... [2018-11-18 21:51:37,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b62f5b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:51:37, skipping insertion in model container [2018-11-18 21:51:37,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:51:37" (3/3) ... [2018-11-18 21:51:37,633 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-18 21:51:37,643 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:51:37,652 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-11-18 21:51:37,670 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-11-18 21:51:37,705 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:51:37,705 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:51:37,706 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:51:37,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:51:37,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:51:37,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:51:37,706 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:51:37,706 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:51:37,707 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:51:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2018-11-18 21:51:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 21:51:37,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:37,736 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:51:37,740 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:37,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash 820246688, now seen corresponding path program 1 times [2018-11-18 21:51:37,751 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:37,752 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:37,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:37,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:51:37,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {99#true} call ULTIMATE.init(); {99#true} is VALID [2018-11-18 21:51:37,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {99#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {99#true} is VALID [2018-11-18 21:51:37,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2018-11-18 21:51:37,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} #359#return; {99#true} is VALID [2018-11-18 21:51:37,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {99#true} call #t~ret25 := main(); {99#true} is VALID [2018-11-18 21:51:37,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {99#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {99#true} is VALID [2018-11-18 21:51:37,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {99#true} assume !true; {100#false} is VALID [2018-11-18 21:51:37,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {100#false} assume true; {100#false} is VALID [2018-11-18 21:51:37,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {100#false} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {100#false} is VALID [2018-11-18 21:51:37,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {100#false} assume !false; {100#false} is VALID [2018-11-18 21:51:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:51:37,905 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:51:37,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:51:37,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 21:51:37,914 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 21:51:37,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:51:37,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 21:51:37,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:37,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 21:51:37,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 21:51:37,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 21:51:37,964 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 2 states. [2018-11-18 21:51:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:38,485 INFO L93 Difference]: Finished difference Result 186 states and 294 transitions. [2018-11-18 21:51:38,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 21:51:38,485 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 21:51:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:51:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:51:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2018-11-18 21:51:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:51:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2018-11-18 21:51:38,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 294 transitions. [2018-11-18 21:51:39,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:39,549 INFO L225 Difference]: With dead ends: 186 [2018-11-18 21:51:39,549 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 21:51:39,557 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 21:51:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 21:51:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-18 21:51:39,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:51:39,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 89 states. [2018-11-18 21:51:39,615 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2018-11-18 21:51:39,615 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2018-11-18 21:51:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:39,623 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-18 21:51:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-11-18 21:51:39,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:39,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:39,625 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2018-11-18 21:51:39,625 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2018-11-18 21:51:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:39,633 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-18 21:51:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-11-18 21:51:39,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:39,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:39,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:51:39,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:51:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-18 21:51:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-11-18 21:51:39,648 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 10 [2018-11-18 21:51:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:51:39,649 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-11-18 21:51:39,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 21:51:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-11-18 21:51:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 21:51:39,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:39,652 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:51:39,653 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:39,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:39,653 INFO L82 PathProgramCache]: Analyzing trace with hash -401264630, now seen corresponding path program 1 times [2018-11-18 21:51:39,654 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:39,654 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:39,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:39,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:51:39,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {609#true} call ULTIMATE.init(); {609#true} is VALID [2018-11-18 21:51:39,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {609#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {609#true} is VALID [2018-11-18 21:51:39,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {609#true} assume true; {609#true} is VALID [2018-11-18 21:51:39,793 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {609#true} {609#true} #359#return; {609#true} is VALID [2018-11-18 21:51:39,793 INFO L256 TraceCheckUtils]: 4: Hoare triple {609#true} call #t~ret25 := main(); {609#true} is VALID [2018-11-18 21:51:39,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {609#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {629#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-18 21:51:39,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {629#(not (= (_ bv0 32) main_~head~0.base))} assume true; {629#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-18 21:51:39,795 INFO L273 TraceCheckUtils]: 7: Hoare triple {629#(not (= (_ bv0 32) main_~head~0.base))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {629#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-18 21:51:39,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {629#(not (= (_ bv0 32) main_~head~0.base))} assume true; {629#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-18 21:51:39,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {629#(not (= (_ bv0 32) main_~head~0.base))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {610#false} is VALID [2018-11-18 21:51:39,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {610#false} assume !false; {610#false} is VALID [2018-11-18 21:51:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:51:39,801 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:51:39,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:51:39,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:51:39,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 21:51:39,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:51:39,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:51:39,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:39,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:51:39,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:51:39,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:51:39,824 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 3 states. [2018-11-18 21:51:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:40,462 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-18 21:51:40,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:51:40,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 21:51:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:51:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:51:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2018-11-18 21:51:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:51:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2018-11-18 21:51:40,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 97 transitions. [2018-11-18 21:51:40,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:40,649 INFO L225 Difference]: With dead ends: 89 [2018-11-18 21:51:40,649 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 21:51:40,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:51:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 21:51:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-18 21:51:40,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:51:40,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2018-11-18 21:51:40,710 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-18 21:51:40,710 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-18 21:51:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:40,714 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-11-18 21:51:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-11-18 21:51:40,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:40,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:40,716 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-18 21:51:40,716 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-18 21:51:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:40,720 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-11-18 21:51:40,721 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-11-18 21:51:40,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:40,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:40,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:51:40,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:51:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 21:51:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-11-18 21:51:40,727 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 11 [2018-11-18 21:51:40,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:51:40,727 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-11-18 21:51:40,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:51:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-11-18 21:51:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 21:51:40,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:40,728 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:51:40,729 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:40,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:40,730 INFO L82 PathProgramCache]: Analyzing trace with hash 904946878, now seen corresponding path program 1 times [2018-11-18 21:51:40,730 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:40,730 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:40,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:40,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:51:40,885 INFO L477 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 [2018-11-18 21:51:40,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:40,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:40,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 21:51:40,905 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:51:41,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:51:41,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:51:41,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 21:51:41,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:41,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-18 21:51:41,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 21:51:41,290 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:41,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-18 21:51:41,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 21:51:41,337 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:41,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:41,344 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:41,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:41,359 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:50, output treesize:4 [2018-11-18 21:51:41,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {990#true} call ULTIMATE.init(); {990#true} is VALID [2018-11-18 21:51:41,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {990#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {990#true} is VALID [2018-11-18 21:51:41,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {990#true} assume true; {990#true} is VALID [2018-11-18 21:51:41,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {990#true} {990#true} #359#return; {990#true} is VALID [2018-11-18 21:51:41,387 INFO L256 TraceCheckUtils]: 4: Hoare triple {990#true} call #t~ret25 := main(); {990#true} is VALID [2018-11-18 21:51:41,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {990#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {1010#(= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 21:51:41,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {1010#(= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1))} assume true; {1010#(= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 21:51:41,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {1010#(= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~item~0.base, ~item~0.offset, 4bv32); {1017#(not (= main_~item~0.base (_ bv0 32)))} is VALID [2018-11-18 21:51:41,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {1017#(not (= main_~item~0.base (_ bv0 32)))} assume 0bv32 == ~status~0;call write~intINTTYPE4(1bv32, ~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);~status~0 := 1bv32; {1017#(not (= main_~item~0.base (_ bv0 32)))} is VALID [2018-11-18 21:51:41,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {1017#(not (= main_~item~0.base (_ bv0 32)))} assume true; {1017#(not (= main_~item~0.base (_ bv0 32)))} is VALID [2018-11-18 21:51:41,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {1017#(not (= main_~item~0.base (_ bv0 32)))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1017#(not (= main_~item~0.base (_ bv0 32)))} is VALID [2018-11-18 21:51:41,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {1017#(not (= main_~item~0.base (_ bv0 32)))} assume true; {1017#(not (= main_~item~0.base (_ bv0 32)))} is VALID [2018-11-18 21:51:41,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {1017#(not (= main_~item~0.base (_ bv0 32)))} assume true; {1017#(not (= main_~item~0.base (_ bv0 32)))} is VALID [2018-11-18 21:51:41,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {1017#(not (= main_~item~0.base (_ bv0 32)))} assume !(~item~0.base != 0bv32 || ~item~0.offset != 0bv32); {991#false} is VALID [2018-11-18 21:51:41,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {991#false} assume !false; {991#false} is VALID [2018-11-18 21:51:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:51:41,400 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 21:51:41,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:51:41,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:51:41,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-18 21:51:41,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:51:41,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:51:41,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:41,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:51:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:51:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:51:41,428 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 4 states. [2018-11-18 21:51:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:41,848 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-11-18 21:51:41,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:51:41,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-18 21:51:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:51:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:51:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-18 21:51:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:51:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-18 21:51:41,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2018-11-18 21:51:42,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:42,021 INFO L225 Difference]: With dead ends: 79 [2018-11-18 21:51:42,022 INFO L226 Difference]: Without dead ends: 77 [2018-11-18 21:51:42,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:51:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-18 21:51:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-18 21:51:42,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:51:42,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2018-11-18 21:51:42,048 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2018-11-18 21:51:42,048 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2018-11-18 21:51:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:42,052 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-11-18 21:51:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-11-18 21:51:42,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:42,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:42,053 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2018-11-18 21:51:42,054 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2018-11-18 21:51:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:42,057 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-11-18 21:51:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-11-18 21:51:42,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:42,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:42,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:51:42,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:51:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-18 21:51:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-11-18 21:51:42,063 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 15 [2018-11-18 21:51:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:51:42,063 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-11-18 21:51:42,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:51:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-11-18 21:51:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 21:51:42,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:42,064 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:51:42,065 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:42,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1417854658, now seen corresponding path program 1 times [2018-11-18 21:51:42,066 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:42,066 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:42,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:42,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:51:42,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {1370#true} call ULTIMATE.init(); {1370#true} is VALID [2018-11-18 21:51:42,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {1370#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1370#true} is VALID [2018-11-18 21:51:42,184 INFO L273 TraceCheckUtils]: 2: Hoare triple {1370#true} assume true; {1370#true} is VALID [2018-11-18 21:51:42,185 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1370#true} {1370#true} #359#return; {1370#true} is VALID [2018-11-18 21:51:42,185 INFO L256 TraceCheckUtils]: 4: Hoare triple {1370#true} call #t~ret25 := main(); {1370#true} is VALID [2018-11-18 21:51:42,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {1370#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {1390#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:42,196 INFO L273 TraceCheckUtils]: 6: Hoare triple {1390#(= main_~status~0 (_ bv0 32))} assume true; {1390#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:42,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {1390#(= main_~status~0 (_ bv0 32))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1390#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:42,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {1390#(= main_~status~0 (_ bv0 32))} assume true; {1390#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:42,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {1390#(= main_~status~0 (_ bv0 32))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1390#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:42,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {1390#(= main_~status~0 (_ bv0 32))} assume true; {1390#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:42,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {1390#(= main_~status~0 (_ bv0 32))} assume 1bv32 == ~status~0; {1371#false} is VALID [2018-11-18 21:51:42,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {1371#false} assume true; {1371#false} is VALID [2018-11-18 21:51:42,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {1371#false} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1371#false} is VALID [2018-11-18 21:51:42,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {1371#false} assume true; {1371#false} is VALID [2018-11-18 21:51:42,200 INFO L273 TraceCheckUtils]: 15: Hoare triple {1371#false} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32); {1371#false} is VALID [2018-11-18 21:51:42,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {1371#false} assume !(#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32);havoc #t~mem5.base, #t~mem5.offset; {1371#false} is VALID [2018-11-18 21:51:42,201 INFO L273 TraceCheckUtils]: 17: Hoare triple {1371#false} assume !false; {1371#false} is VALID [2018-11-18 21:51:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:51:42,203 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:51:42,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:51:42,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:51:42,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 21:51:42,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:51:42,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:51:42,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:42,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:51:42,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:51:42,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:51:42,232 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-11-18 21:51:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:42,613 INFO L93 Difference]: Finished difference Result 167 states and 189 transitions. [2018-11-18 21:51:42,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:51:42,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 21:51:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:51:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:51:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-18 21:51:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:51:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-18 21:51:42,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2018-11-18 21:51:42,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:42,934 INFO L225 Difference]: With dead ends: 167 [2018-11-18 21:51:42,935 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 21:51:42,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:51:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 21:51:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2018-11-18 21:51:42,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:51:42,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 86 states. [2018-11-18 21:51:42,972 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 86 states. [2018-11-18 21:51:42,972 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 86 states. [2018-11-18 21:51:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:42,976 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-11-18 21:51:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-11-18 21:51:42,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:42,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:42,977 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 96 states. [2018-11-18 21:51:42,978 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 96 states. [2018-11-18 21:51:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:42,981 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-11-18 21:51:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-11-18 21:51:42,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:42,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:42,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:51:42,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:51:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-18 21:51:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-11-18 21:51:42,986 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2018-11-18 21:51:42,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:51:42,987 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-11-18 21:51:42,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:51:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-11-18 21:51:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 21:51:42,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:42,988 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:51:42,988 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:42,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:42,989 INFO L82 PathProgramCache]: Analyzing trace with hash -236724551, now seen corresponding path program 1 times [2018-11-18 21:51:42,990 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:42,990 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:43,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:43,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:51:43,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {1901#true} call ULTIMATE.init(); {1901#true} is VALID [2018-11-18 21:51:43,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {1901#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1901#true} is VALID [2018-11-18 21:51:43,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {1901#true} assume true; {1901#true} is VALID [2018-11-18 21:51:43,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1901#true} {1901#true} #359#return; {1901#true} is VALID [2018-11-18 21:51:43,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {1901#true} call #t~ret25 := main(); {1901#true} is VALID [2018-11-18 21:51:43,095 INFO L273 TraceCheckUtils]: 5: Hoare triple {1901#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} assume true; {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,098 INFO L273 TraceCheckUtils]: 8: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} assume true; {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} assume true; {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} assume !(1bv32 == ~status~0); {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} assume !(2bv32 == ~status~0); {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} assume !(3bv32 == ~status~0); {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,103 INFO L273 TraceCheckUtils]: 14: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} assume true; {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} assume !!((~item~0.base != 0bv32 || ~item~0.offset != 0bv32) && 0bv32 != #t~nondet20);havoc #t~nondet20; {1921#(= main_~status~0 (_ bv0 32))} is VALID [2018-11-18 21:51:43,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {1921#(= main_~status~0 (_ bv0 32))} assume true;#t~short22 := 0bv32 == ~status~0; {1958#|main_#t~short22|} is VALID [2018-11-18 21:51:43,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {1958#|main_#t~short22|} assume #t~short22; {1958#|main_#t~short22|} is VALID [2018-11-18 21:51:43,106 INFO L273 TraceCheckUtils]: 19: Hoare triple {1958#|main_#t~short22|} assume !#t~short22;havoc #t~mem21;havoc #t~short22; {1902#false} is VALID [2018-11-18 21:51:43,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {1902#false} assume !false; {1902#false} is VALID [2018-11-18 21:51:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:51:43,109 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:51:43,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:51:43,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:51:43,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-18 21:51:43,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:51:43,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:51:43,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:43,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:51:43,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:51:43,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:51:43,144 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 4 states. [2018-11-18 21:51:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:43,586 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-11-18 21:51:43,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 21:51:43,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-18 21:51:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:51:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:51:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2018-11-18 21:51:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:51:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2018-11-18 21:51:43,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 117 transitions. [2018-11-18 21:51:43,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:43,760 INFO L225 Difference]: With dead ends: 104 [2018-11-18 21:51:43,760 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 21:51:43,761 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:51:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 21:51:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-18 21:51:43,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:51:43,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2018-11-18 21:51:43,860 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-18 21:51:43,860 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-18 21:51:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:43,863 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-18 21:51:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-18 21:51:43,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:43,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:43,864 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-18 21:51:43,864 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-18 21:51:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:43,867 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-18 21:51:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-18 21:51:43,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:43,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:43,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:51:43,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:51:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 21:51:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-11-18 21:51:43,871 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 21 [2018-11-18 21:51:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:51:43,872 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-18 21:51:43,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:51:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-18 21:51:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 21:51:43,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:43,874 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:51:43,874 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:43,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:43,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1486307260, now seen corresponding path program 1 times [2018-11-18 21:51:43,875 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:43,875 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:43,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:43,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:51:44,001 INFO L477 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 [2018-11-18 21:51:44,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:44,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:44,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-18 21:51:44,026 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:51:44,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:51:44,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:51:44,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 21:51:44,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:44,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 68 [2018-11-18 21:51:44,415 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2018-11-18 21:51:44,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 21:51:44,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:44,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-11-18 21:51:44,490 INFO L477 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 10 treesize of output 9 [2018-11-18 21:51:44,492 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:44,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-11-18 21:51:44,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 21:51:44,686 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 21:51:44,744 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:51:44,783 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:51:44,858 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:51:44,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 21:51:44,940 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:141, output treesize:78 [2018-11-18 21:51:44,985 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:51:59,090 WARN L180 SmtUtils]: Spent 14.09 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-18 21:52:00,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2018-11-18 21:52:00,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 21:52:00,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:00,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 21:52:00,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:00,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:52:00,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-11-18 21:52:00,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 21:52:00,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:00,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 1 [2018-11-18 21:52:00,380 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:00,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:00,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:00,451 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:86, output treesize:4 [2018-11-18 21:52:00,461 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:52:00,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {2342#true} call ULTIMATE.init(); {2342#true} is VALID [2018-11-18 21:52:00,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {2342#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2342#true} is VALID [2018-11-18 21:52:00,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2018-11-18 21:52:00,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #359#return; {2342#true} is VALID [2018-11-18 21:52:00,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {2342#true} call #t~ret25 := main(); {2342#true} is VALID [2018-11-18 21:52:00,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {2342#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {2362#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:00,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {2362#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume true; {2362#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:00,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {2362#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~item~0.base, ~item~0.offset, 4bv32); {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume 0bv32 == ~status~0;call write~intINTTYPE4(1bv32, ~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);~status~0 := 1bv32; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,573 INFO L273 TraceCheckUtils]: 11: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,573 INFO L273 TraceCheckUtils]: 12: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !!(~item~0.base != 0bv32 || ~item~0.offset != 0bv32); {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,574 INFO L273 TraceCheckUtils]: 14: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,576 INFO L273 TraceCheckUtils]: 16: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,577 INFO L273 TraceCheckUtils]: 17: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,578 INFO L273 TraceCheckUtils]: 18: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,578 INFO L273 TraceCheckUtils]: 19: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,579 INFO L273 TraceCheckUtils]: 20: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume 1bv32 == ~status~0; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,580 INFO L273 TraceCheckUtils]: 22: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:52:00,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {2369#(or (and (exists ((|main_#t~malloc2.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd |main_#t~malloc2.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd v_prenex_1 (_ bv4 32))) main_~head~0.base)) (exists ((main_~item~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~item~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32); {2421#(not (= |main_#t~mem5.base| (_ bv0 32)))} is VALID [2018-11-18 21:52:00,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {2421#(not (= |main_#t~mem5.base| (_ bv0 32)))} assume !(#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32);havoc #t~mem5.base, #t~mem5.offset; {2343#false} is VALID [2018-11-18 21:52:00,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {2343#false} assume !false; {2343#false} is VALID [2018-11-18 21:52:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:52:00,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:52:00,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 74 [2018-11-18 21:52:00,968 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2018-11-18 21:52:00,977 INFO L477 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 9 treesize of output 8 [2018-11-18 21:52:00,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:01,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 57 [2018-11-18 21:52:01,553 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-11-18 21:52:01,563 INFO L477 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 35 treesize of output 34 [2018-11-18 21:52:01,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:01,574 INFO L477 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 31 treesize of output 30 [2018-11-18 21:52:01,577 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:01,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 32 treesize of output 31 [2018-11-18 21:52:01,824 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:01,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 31 [2018-11-18 21:52:01,835 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:02,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 46 [2018-11-18 21:52:02,581 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-18 21:52:02,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 16 [2018-11-18 21:52:02,650 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:02,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 27 treesize of output 21 [2018-11-18 21:52:02,996 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:03,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2018-11-18 21:52:03,384 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:03,725 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:03,726 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:03,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-18 21:52:03,729 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:04,000 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:04,010 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:04,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-11-18 21:52:04,046 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-11-18 21:52:04,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-18 21:52:04,569 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:04,753 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:04,762 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:04,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2018-11-18 21:52:04,796 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-11-18 21:52:05,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 20 treesize of output 14 [2018-11-18 21:52:05,106 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:05,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:05,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:05,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-11-18 21:52:05,134 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:05,210 INFO L267 ElimStorePlain]: Start of recursive call 9: 10 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 21:52:05,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-11-18 21:52:05,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 20 treesize of output 12 [2018-11-18 21:52:05,265 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:05,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 19 [2018-11-18 21:52:05,347 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:05,374 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:05,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 45 [2018-11-18 21:52:05,724 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:05,724 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:05,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:05,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:05,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2018-11-18 21:52:05,745 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:06,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2018-11-18 21:52:06,141 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:06,511 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:06,512 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:06,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-18 21:52:06,515 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:06,882 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:06,890 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:06,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2018-11-18 21:52:06,950 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-11-18 21:52:07,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 22 [2018-11-18 21:52:07,296 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:07,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 16 [2018-11-18 21:52:07,523 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:07,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 8 [2018-11-18 21:52:07,737 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:07,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 12 [2018-11-18 21:52:07,745 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:08,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-18 21:52:08,283 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:08,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-11-18 21:52:08,423 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:08,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 18 [2018-11-18 21:52:08,558 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:08,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 14 [2018-11-18 21:52:08,692 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:08,767 INFO L267 ElimStorePlain]: Start of recursive call 22: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 21:52:08,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-18 21:52:08,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-18 21:52:09,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-11-18 21:52:09,064 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 4 variables, input treesize:138, output treesize:86 [2018-11-18 21:52:09,081 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:52:09,336 INFO L273 TraceCheckUtils]: 26: Hoare triple {2343#false} assume !false; {2343#false} is VALID [2018-11-18 21:52:09,338 INFO L273 TraceCheckUtils]: 25: Hoare triple {2421#(not (= |main_#t~mem5.base| (_ bv0 32)))} assume !(#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32);havoc #t~mem5.base, #t~mem5.offset; {2343#false} is VALID [2018-11-18 21:52:09,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32); {2421#(not (= |main_#t~mem5.base| (_ bv0 32)))} is VALID [2018-11-18 21:52:09,341 INFO L273 TraceCheckUtils]: 23: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,343 INFO L273 TraceCheckUtils]: 20: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume 1bv32 == ~status~0; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,345 INFO L273 TraceCheckUtils]: 18: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume !!(~item~0.base != 0bv32 || ~item~0.offset != 0bv32); {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume true; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} assume 0bv32 == ~status~0;call write~intINTTYPE4(1bv32, ~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);~status~0 := 1bv32; {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {2486#(and (or (= main_~item~0.base main_~head~0.base) (forall ((v_prenex_26 (_ BitVec 32))) (or (= v_prenex_26 (_ bv0 32)) (not (= (select |#valid| v_prenex_26) (_ bv0 1))) (= v_prenex_26 main_~head~0.base)))) (or (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= |v_main_#t~malloc2.base_2| (_ bv0 32)))) (= main_~head~0.offset main_~item~0.offset)))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~item~0.base, ~item~0.offset, 4bv32); {2434#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-18 21:52:09,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {2486#(and (or (= main_~item~0.base main_~head~0.base) (forall ((v_prenex_26 (_ BitVec 32))) (or (= v_prenex_26 (_ bv0 32)) (not (= (select |#valid| v_prenex_26) (_ bv0 1))) (= v_prenex_26 main_~head~0.base)))) (or (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= |v_main_#t~malloc2.base_2| (_ bv0 32)))) (= main_~head~0.offset main_~item~0.offset)))} assume true; {2486#(and (or (= main_~item~0.base main_~head~0.base) (forall ((v_prenex_26 (_ BitVec 32))) (or (= v_prenex_26 (_ bv0 32)) (not (= (select |#valid| v_prenex_26) (_ bv0 1))) (= v_prenex_26 main_~head~0.base)))) (or (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= |v_main_#t~malloc2.base_2| (_ bv0 32)))) (= main_~head~0.offset main_~item~0.offset)))} is VALID [2018-11-18 21:52:09,379 INFO L273 TraceCheckUtils]: 5: Hoare triple {2342#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {2486#(and (or (= main_~item~0.base main_~head~0.base) (forall ((v_prenex_26 (_ BitVec 32))) (or (= v_prenex_26 (_ bv0 32)) (not (= (select |#valid| v_prenex_26) (_ bv0 1))) (= v_prenex_26 main_~head~0.base)))) (or (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= |v_main_#t~malloc2.base_2| (_ bv0 32)))) (= main_~head~0.offset main_~item~0.offset)))} is VALID [2018-11-18 21:52:09,380 INFO L256 TraceCheckUtils]: 4: Hoare triple {2342#true} call #t~ret25 := main(); {2342#true} is VALID [2018-11-18 21:52:09,380 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #359#return; {2342#true} is VALID [2018-11-18 21:52:09,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2018-11-18 21:52:09,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {2342#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2342#true} is VALID [2018-11-18 21:52:09,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {2342#true} call ULTIMATE.init(); {2342#true} is VALID [2018-11-18 21:52:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:52:09,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:52:09,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-18 21:52:09,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 21:52:09,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:52:09,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 21:52:09,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:52:09,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 21:52:09,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 21:52:09,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 21:52:09,558 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 7 states. [2018-11-18 21:52:28,930 WARN L180 SmtUtils]: Spent 14.09 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 21:52:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:52:29,990 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2018-11-18 21:52:29,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 21:52:29,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 21:52:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:52:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 21:52:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2018-11-18 21:52:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 21:52:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2018-11-18 21:52:29,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 161 transitions. [2018-11-18 21:52:30,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:52:30,528 INFO L225 Difference]: With dead ends: 150 [2018-11-18 21:52:30,528 INFO L226 Difference]: Without dead ends: 148 [2018-11-18 21:52:30,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 21:52:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-18 21:52:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2018-11-18 21:52:30,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:52:30,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 98 states. [2018-11-18 21:52:30,607 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 98 states. [2018-11-18 21:52:30,608 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 98 states. [2018-11-18 21:52:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:52:30,613 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2018-11-18 21:52:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2018-11-18 21:52:30,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:52:30,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:52:30,614 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 148 states. [2018-11-18 21:52:30,614 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 148 states. [2018-11-18 21:52:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:52:30,619 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2018-11-18 21:52:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2018-11-18 21:52:30,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:52:30,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:52:30,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:52:30,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:52:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-18 21:52:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-11-18 21:52:30,624 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 27 [2018-11-18 21:52:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:52:30,625 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-11-18 21:52:30,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 21:52:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-11-18 21:52:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 21:52:30,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:52:30,626 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:52:30,627 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:52:30,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:52:30,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1530243589, now seen corresponding path program 1 times [2018-11-18 21:52:30,627 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:52:30,627 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:52:30,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:52:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:52:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:52:30,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:52:30,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {3086#true} call ULTIMATE.init(); {3086#true} is VALID [2018-11-18 21:52:30,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {3086#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3086#true} is VALID [2018-11-18 21:52:30,784 INFO L273 TraceCheckUtils]: 2: Hoare triple {3086#true} assume true; {3086#true} is VALID [2018-11-18 21:52:30,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3086#true} {3086#true} #359#return; {3086#true} is VALID [2018-11-18 21:52:30,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {3086#true} call #t~ret25 := main(); {3086#true} is VALID [2018-11-18 21:52:30,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {3086#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {3086#true} is VALID [2018-11-18 21:52:30,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {3086#true} assume true; {3086#true} is VALID [2018-11-18 21:52:30,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {3086#true} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~item~0.base, ~item~0.offset, 4bv32); {3086#true} is VALID [2018-11-18 21:52:30,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {3086#true} assume 0bv32 == ~status~0;call write~intINTTYPE4(1bv32, ~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);~status~0 := 1bv32; {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~item~0.base != 0bv32 || ~item~0.offset != 0bv32); {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,790 INFO L273 TraceCheckUtils]: 18: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:52:30,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {3115#(= (bvadd main_~status~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(1bv32 == ~status~0); {3087#false} is VALID [2018-11-18 21:52:30,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {3087#false} assume 2bv32 == ~status~0; {3087#false} is VALID [2018-11-18 21:52:30,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {3087#false} assume true; {3087#false} is VALID [2018-11-18 21:52:30,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {3087#false} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3087#false} is VALID [2018-11-18 21:52:30,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {3087#false} assume true; {3087#false} is VALID [2018-11-18 21:52:30,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {3087#false} assume true;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32); {3087#false} is VALID [2018-11-18 21:52:30,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {3087#false} assume !(#t~mem6.base != 0bv32 || #t~mem6.offset != 0bv32);havoc #t~mem6.base, #t~mem6.offset; {3087#false} is VALID [2018-11-18 21:52:30,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {3087#false} assume !false; {3087#false} is VALID [2018-11-18 21:52:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:52:30,801 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:52:30,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:52:30,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:52:30,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 21:52:30,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:52:30,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:52:30,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:52:30,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:52:30,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:52:30,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:52:30,835 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 3 states. [2018-11-18 21:52:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:52:31,298 INFO L93 Difference]: Finished difference Result 197 states and 222 transitions. [2018-11-18 21:52:31,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:52:31,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 21:52:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:52:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:52:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2018-11-18 21:52:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:52:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2018-11-18 21:52:31,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 197 transitions. [2018-11-18 21:52:31,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:52:31,498 INFO L225 Difference]: With dead ends: 197 [2018-11-18 21:52:31,499 INFO L226 Difference]: Without dead ends: 125 [2018-11-18 21:52:31,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:52:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-18 21:52:31,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2018-11-18 21:52:31,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:52:31,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 114 states. [2018-11-18 21:52:31,729 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 114 states. [2018-11-18 21:52:31,730 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 114 states. [2018-11-18 21:52:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:52:31,735 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-11-18 21:52:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2018-11-18 21:52:31,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:52:31,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:52:31,735 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 125 states. [2018-11-18 21:52:31,736 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 125 states. [2018-11-18 21:52:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:52:31,740 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-11-18 21:52:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2018-11-18 21:52:31,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:52:31,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:52:31,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:52:31,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:52:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-18 21:52:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-11-18 21:52:31,744 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 28 [2018-11-18 21:52:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:52:31,745 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-11-18 21:52:31,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:52:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-11-18 21:52:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 21:52:31,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:52:31,746 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:52:31,746 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:52:31,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:52:31,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1371792117, now seen corresponding path program 1 times [2018-11-18 21:52:31,747 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:52:31,747 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:52:31,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:52:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:52:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:52:31,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:52:32,177 INFO L477 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 [2018-11-18 21:52:32,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:32,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:32,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-18 21:52:32,345 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:52:32,448 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:52:32,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:52:32,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 21:52:32,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:32,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-11-18 21:52:32,947 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-18 21:52:32,957 INFO L477 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 8 treesize of output 7 [2018-11-18 21:52:32,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:33,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-18 21:52:33,097 INFO L477 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 8 treesize of output 7 [2018-11-18 21:52:33,098 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:33,176 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:33,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 63 [2018-11-18 21:52:33,260 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:52:33,260 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:33,261 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 114 [2018-11-18 21:52:33,263 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:33,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:33,328 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:33,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:33,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 93 [2018-11-18 21:52:33,709 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2018-11-18 21:52:33,717 INFO L477 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 8 treesize of output 7 [2018-11-18 21:52:33,724 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:33,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2018-11-18 21:52:33,793 INFO L477 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 8 treesize of output 7 [2018-11-18 21:52:33,803 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:33,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2018-11-18 21:52:33,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:52:33,931 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-11-18 21:52:33,934 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:33,960 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:33,984 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:34,010 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:34,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:34,053 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:194, output treesize:77 [2018-11-18 21:52:34,977 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:52:35,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 18 [2018-11-18 21:52:35,185 INFO L477 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 18 treesize of output 17 [2018-11-18 21:52:35,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:35,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:35,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:35,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:88 [2018-11-18 21:52:35,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61 [2018-11-18 21:52:35,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 48 treesize of output 35 [2018-11-18 21:52:35,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:35,641 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:52:35,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 21:52:35,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:35,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:35,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-11-18 21:52:35,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:52:36,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 21:52:36,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:36,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 16 [2018-11-18 21:52:36,025 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:36,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:36,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:36,050 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:101, output treesize:15 [2018-11-18 21:52:36,059 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:52:36,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2018-11-18 21:52:36,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {3769#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3769#true} is VALID [2018-11-18 21:52:36,173 INFO L273 TraceCheckUtils]: 2: Hoare triple {3769#true} assume true; {3769#true} is VALID [2018-11-18 21:52:36,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3769#true} {3769#true} #359#return; {3769#true} is VALID [2018-11-18 21:52:36,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {3769#true} call #t~ret25 := main(); {3769#true} is VALID [2018-11-18 21:52:36,175 INFO L273 TraceCheckUtils]: 5: Hoare triple {3769#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {3789#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,176 INFO L273 TraceCheckUtils]: 6: Hoare triple {3789#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume true; {3789#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {3789#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~item~0.base, ~item~0.offset, 4bv32); {3796#(and (= (select (select |#memory_$Pointer$.base| main_~item~0.base) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~item~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {3796#(and (= (select (select |#memory_$Pointer$.base| main_~item~0.base) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~item~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume 0bv32 == ~status~0;call write~intINTTYPE4(1bv32, ~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);~status~0 := 1bv32; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume true; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,189 INFO L273 TraceCheckUtils]: 10: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume true; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume true; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,197 INFO L273 TraceCheckUtils]: 13: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume !!(~item~0.base != 0bv32 || ~item~0.offset != 0bv32); {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,199 INFO L273 TraceCheckUtils]: 14: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume true; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume true; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,215 INFO L273 TraceCheckUtils]: 17: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume true; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume true; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,221 INFO L273 TraceCheckUtils]: 20: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume 1bv32 == ~status~0; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,223 INFO L273 TraceCheckUtils]: 21: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume true; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,228 INFO L273 TraceCheckUtils]: 23: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume true; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32); {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,234 INFO L273 TraceCheckUtils]: 25: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume !!(#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32);havoc #t~mem5.base, #t~mem5.offset; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,235 INFO L273 TraceCheckUtils]: 26: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume true; {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,236 INFO L273 TraceCheckUtils]: 27: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume !(2bv32 == ~status~0); {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,255 INFO L273 TraceCheckUtils]: 28: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} assume !(3bv32 == ~status~0); {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:52:36,269 INFO L273 TraceCheckUtils]: 29: Hoare triple {3800#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (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)) (_ bv0 32)) (= (_ bv0 32) (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| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv4 32)) main_~head~0.base) (= (_ bv0 32) main_~head~0.offset))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {3864#(and (= (_ bv0 32) main_~item~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32)))))} is VALID [2018-11-18 21:52:36,285 INFO L273 TraceCheckUtils]: 30: Hoare triple {3864#(and (= (_ bv0 32) main_~item~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32)))))} assume true; {3864#(and (= (_ bv0 32) main_~item~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32)))))} is VALID [2018-11-18 21:52:36,292 INFO L273 TraceCheckUtils]: 31: Hoare triple {3864#(and (= (_ bv0 32) main_~item~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32)))))} assume !!((~item~0.base != 0bv32 || ~item~0.offset != 0bv32) && 0bv32 != #t~nondet20);havoc #t~nondet20; {3864#(and (= (_ bv0 32) main_~item~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32)))))} is VALID [2018-11-18 21:52:36,293 INFO L273 TraceCheckUtils]: 32: Hoare triple {3864#(and (= (_ bv0 32) main_~item~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32)))))} assume true;#t~short22 := 0bv32 == ~status~0; {3864#(and (= (_ bv0 32) main_~item~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32)))))} is VALID [2018-11-18 21:52:36,294 INFO L273 TraceCheckUtils]: 33: Hoare triple {3864#(and (= (_ bv0 32) main_~item~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32)))))} assume !#t~short22;call #t~mem21 := read~intINTTYPE4(~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);#t~short22 := ~bvsgt32(#t~mem21, 0bv32); {3877#|main_#t~short22|} is VALID [2018-11-18 21:52:36,294 INFO L273 TraceCheckUtils]: 34: Hoare triple {3877#|main_#t~short22|} assume !#t~short22;havoc #t~mem21;havoc #t~short22; {3770#false} is VALID [2018-11-18 21:52:36,294 INFO L273 TraceCheckUtils]: 35: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2018-11-18 21:52:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:52:36,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:52:38,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-18 21:52:38,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 21:52:38,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:38,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:38,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:52:38,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:15 [2018-11-18 21:52:38,555 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:52:40,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 175 [2018-11-18 21:52:40,329 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 21:52:40,336 INFO L477 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 9 treesize of output 8 [2018-11-18 21:52:40,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:40,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 156 [2018-11-18 21:52:40,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 156 treesize of output 147 [2018-11-18 21:52:40,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:40,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:40,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-18 21:52:40,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-18 21:52:40,539 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:40,562 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:40,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 21:52:41,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 86 [2018-11-18 21:52:41,360 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-11-18 21:52:41,366 INFO L477 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 9 treesize of output 8 [2018-11-18 21:52:41,368 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:41,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-11-18 21:52:41,503 INFO L477 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 9 treesize of output 8 [2018-11-18 21:52:41,505 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:41,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-11-18 21:52:41,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-18 21:52:41,626 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:41,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 8 [2018-11-18 21:52:41,650 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:41,662 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:41,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44 [2018-11-18 21:52:41,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 28 [2018-11-18 21:52:41,733 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:41,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-11-18 21:52:41,874 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:42,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 13 [2018-11-18 21:52:42,009 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:42,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 22 [2018-11-18 21:52:42,115 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:42,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-18 21:52:42,240 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:42,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-18 21:52:42,356 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:42,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-11-18 21:52:42,441 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:42,490 INFO L267 ElimStorePlain]: Start of recursive call 15: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:52:42,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 42 [2018-11-18 21:52:42,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-18 21:52:42,596 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:42,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 29 treesize of output 21 [2018-11-18 21:52:42,755 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:42,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 19 [2018-11-18 21:52:42,871 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:42,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 10 [2018-11-18 21:52:42,979 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:43,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 20 [2018-11-18 21:52:43,074 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:43,168 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:43,171 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:43,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2018-11-18 21:52:43,192 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:43,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-18 21:52:43,280 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:43,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-11-18 21:52:43,336 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:43,363 INFO L267 ElimStorePlain]: Start of recursive call 23: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:52:43,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2018-11-18 21:52:43,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 34 treesize of output 32 [2018-11-18 21:52:43,429 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:43,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 15 [2018-11-18 21:52:43,499 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:43,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-11-18 21:52:43,542 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:43,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-18 21:52:43,588 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:43,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-18 21:52:43,622 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:43,644 INFO L267 ElimStorePlain]: Start of recursive call 32: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:52:43,694 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 21:52:43,744 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 21:52:43,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 91 [2018-11-18 21:52:43,881 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-11-18 21:52:43,889 INFO L477 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 9 treesize of output 8 [2018-11-18 21:52:43,891 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:43,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:52:43,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-11-18 21:52:44,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-18 21:52:44,043 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:44,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-18 21:52:44,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-18 21:52:44,094 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:44,104 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:44,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-11-18 21:52:44,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 13 [2018-11-18 21:52:44,146 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:44,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 3 [2018-11-18 21:52:44,177 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:44,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-18 21:52:44,211 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:44,219 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:52:44,240 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:52:44,260 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:52:44,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 86 [2018-11-18 21:52:44,407 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-11-18 21:52:44,417 INFO L477 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 9 treesize of output 8 [2018-11-18 21:52:44,420 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:44,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 56 [2018-11-18 21:52:44,827 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-18 21:52:44,836 INFO L477 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 40 treesize of output 39 [2018-11-18 21:52:44,839 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:44,848 INFO L477 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 35 treesize of output 34 [2018-11-18 21:52:44,884 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:44,915 INFO L477 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 39 treesize of output 38 [2018-11-18 21:52:44,944 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:44,973 INFO L477 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 39 treesize of output 38 [2018-11-18 21:52:45,005 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:45,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 34 treesize of output 42 [2018-11-18 21:52:45,830 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:45,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-11-18 21:52:45,845 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:45,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 43 [2018-11-18 21:52:45,872 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:46,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2018-11-18 21:52:46,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-11-18 21:52:46,271 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:46,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2018-11-18 21:52:46,324 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:46,345 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:46,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2018-11-18 21:52:46,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 15 [2018-11-18 21:52:46,450 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:46,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2018-11-18 21:52:46,573 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:46,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 13 [2018-11-18 21:52:46,677 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:46,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-11-18 21:52:46,797 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:47,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 10 [2018-11-18 21:52:47,047 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:47,079 INFO L267 ElimStorePlain]: Start of recursive call 61: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:52:47,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 48 [2018-11-18 21:52:48,061 WARN L180 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2018-11-18 21:52:48,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-18 21:52:48,077 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:48,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 16 [2018-11-18 21:52:48,471 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:48,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-18 21:52:48,812 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:48,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 17 treesize of output 11 [2018-11-18 21:52:48,821 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:49,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-11-18 21:52:49,154 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:49,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-18 21:52:49,323 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:49,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 13 [2018-11-18 21:52:49,428 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:49,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-11-18 21:52:49,614 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:49,736 INFO L267 ElimStorePlain]: Start of recursive call 67: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:52:50,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2018-11-18 21:52:50,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 32 treesize of output 26 [2018-11-18 21:52:50,097 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:50,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-18 21:52:50,495 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:50,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-11-18 21:52:50,885 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:51,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-18 21:52:51,099 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:51,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-18 21:52:51,517 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:51,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 13 [2018-11-18 21:52:51,660 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:51,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-18 21:52:51,941 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:51,989 INFO L267 ElimStorePlain]: Start of recursive call 76: 13 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:52:52,043 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 21:52:52,103 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 21:52:52,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 127 [2018-11-18 21:52:52,747 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-18 21:52:52,756 INFO L477 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 9 treesize of output 8 [2018-11-18 21:52:52,757 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:52,901 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:52,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2018-11-18 21:52:53,128 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-11-18 21:52:53,135 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:53,136 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2018-11-18 21:52:53,137 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:53,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-11-18 21:52:53,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 9 [2018-11-18 21:52:53,200 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:53,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 7 [2018-11-18 21:52:53,229 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:53,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-18 21:52:53,250 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:53,259 INFO L267 ElimStorePlain]: Start of recursive call 88: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:52:53,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2018-11-18 21:52:53,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 4 [2018-11-18 21:52:53,270 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:53,279 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:53,296 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:53,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 181 [2018-11-18 21:52:54,197 WARN L180 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2018-11-18 21:52:54,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:52:54,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-11-18 21:52:54,217 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:54,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 43 [2018-11-18 21:52:54,260 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:54,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 71 [2018-11-18 21:52:54,304 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:54,987 INFO L477 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 70 treesize of output 69 [2018-11-18 21:52:54,989 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:54,997 INFO L477 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 72 treesize of output 71 [2018-11-18 21:52:54,999 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:55,005 INFO L477 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 46 treesize of output 45 [2018-11-18 21:52:55,006 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:55,713 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:55,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 70 [2018-11-18 21:52:55,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 65 treesize of output 61 [2018-11-18 21:52:55,798 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:55,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 16 [2018-11-18 21:52:55,954 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:56,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 31 treesize of output 25 [2018-11-18 21:52:56,063 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:56,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-18 21:52:56,123 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:56,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 10 [2018-11-18 21:52:56,161 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:56,192 INFO L267 ElimStorePlain]: Start of recursive call 101: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:52:56,200 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:56,202 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:56,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:52:56,205 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:56,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2018-11-18 21:52:56,231 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-18 21:52:56,237 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:52:56,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-11-18 21:52:56,350 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 2 xjuncts. [2018-11-18 21:52:56,391 INFO L267 ElimStorePlain]: Start of recursive call 107: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:56,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 49 [2018-11-18 21:52:56,469 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:56,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-18 21:52:56,476 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:56,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 39 treesize of output 29 [2018-11-18 21:52:56,648 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:56,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 29 treesize of output 23 [2018-11-18 21:52:56,819 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:56,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-11-18 21:52:56,973 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:57,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 36 treesize of output 26 [2018-11-18 21:52:57,105 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:57,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 13 [2018-11-18 21:52:57,235 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:57,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 21:52:57,352 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:57,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-18 21:52:57,452 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:57,516 INFO L267 ElimStorePlain]: Start of recursive call 110: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:52:57,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-11-18 21:52:58,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 4 [2018-11-18 21:52:58,004 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,028 INFO L267 ElimStorePlain]: Start of recursive call 119: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-11-18 21:52:58,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-18 21:52:58,072 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 15 [2018-11-18 21:52:58,134 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-11-18 21:52:58,192 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,226 INFO L267 ElimStorePlain]: Start of recursive call 121: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:52:58,231 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:58,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-11-18 21:52:58,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2018-11-18 21:52:58,246 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:58,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-18 21:52:58,275 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,287 INFO L267 ElimStorePlain]: Start of recursive call 125: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2018-11-18 21:52:58,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-18 21:52:58,325 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,389 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:58,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-18 21:52:58,395 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,447 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:58,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-18 21:52:58,452 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,491 INFO L267 ElimStorePlain]: Start of recursive call 128: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:52:58,498 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:52:58,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-11-18 21:52:58,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2018-11-18 21:52:58,512 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-18 21:52:58,533 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,545 INFO L267 ElimStorePlain]: Start of recursive call 132: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:52:58,830 INFO L267 ElimStorePlain]: Start of recursive call 94: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 21:52:58,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 113 [2018-11-18 21:52:59,406 WARN L180 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2018-11-18 21:52:59,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 37 treesize of output 42 [2018-11-18 21:52:59,423 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:59,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-11-18 21:52:59,437 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:59,785 INFO L477 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 66 treesize of output 65 [2018-11-18 21:52:59,787 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-11-18 21:52:59,792 INFO L477 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 42 treesize of output 41 [2018-11-18 21:52:59,794 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:00,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-11-18 21:53:00,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 35 [2018-11-18 21:53:00,165 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:00,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 24 [2018-11-18 21:53:00,335 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:00,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-18 21:53:00,496 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:00,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-11-18 21:53:00,665 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:00,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 28 [2018-11-18 21:53:00,861 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:01,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-18 21:53:01,026 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:01,184 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:01,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-11-18 21:53:01,202 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:01,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-18 21:53:01,332 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:01,407 INFO L267 ElimStorePlain]: Start of recursive call 140: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:53:01,415 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:01,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 68 [2018-11-18 21:53:01,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-11-18 21:53:01,460 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:01,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 22 [2018-11-18 21:53:01,557 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:01,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-18 21:53:01,630 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:01,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 13 [2018-11-18 21:53:01,690 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:01,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 13 [2018-11-18 21:53:01,742 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:01,781 INFO L267 ElimStorePlain]: Start of recursive call 149: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:53:02,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2018-11-18 21:53:02,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 32 treesize of output 30 [2018-11-18 21:53:02,184 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:02,241 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:02,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-18 21:53:02,247 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:02,296 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:02,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2018-11-18 21:53:02,361 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:02,443 INFO L267 ElimStorePlain]: Start of recursive call 155: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:53:02,449 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:02,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-11-18 21:53:02,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2018-11-18 21:53:02,463 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:02,489 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:02,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-18 21:53:02,493 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:02,503 INFO L267 ElimStorePlain]: Start of recursive call 159: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:53:02,752 INFO L267 ElimStorePlain]: Start of recursive call 135: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 21:53:02,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 100 [2018-11-18 21:53:02,876 INFO L477 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 9 treesize of output 8 [2018-11-18 21:53:02,877 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:02,917 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:02,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 65 [2018-11-18 21:53:02,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 60 treesize of output 58 [2018-11-18 21:53:02,960 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:03,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 13 [2018-11-18 21:53:03,026 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:03,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-18 21:53:03,072 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:03,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-18 21:53:03,125 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:03,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-18 21:53:03,181 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:03,202 INFO L267 ElimStorePlain]: Start of recursive call 164: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:53:03,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44 [2018-11-18 21:53:03,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-11-18 21:53:03,278 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:03,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 19 [2018-11-18 21:53:03,414 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:03,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 10 [2018-11-18 21:53:03,535 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:03,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-11-18 21:53:03,654 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:03,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-18 21:53:03,760 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:03,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 10 [2018-11-18 21:53:03,855 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:03,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-18 21:53:03,958 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:04,050 INFO L267 ElimStorePlain]: Start of recursive call 170: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:53:04,116 INFO L267 ElimStorePlain]: Start of recursive call 162: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 21:53:04,237 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-18 21:53:04,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 13 xjuncts. [2018-11-18 21:53:04,655 INFO L202 ElimStorePlain]: Needed 177 recursive calls to eliminate 6 variables, input treesize:365, output treesize:183 [2018-11-18 21:53:06,670 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:53:07,039 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2018-11-18 21:53:07,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2018-11-18 21:53:07,118 INFO L273 TraceCheckUtils]: 34: Hoare triple {3877#|main_#t~short22|} assume !#t~short22;havoc #t~mem21;havoc #t~short22; {3770#false} is VALID [2018-11-18 21:53:07,120 INFO L273 TraceCheckUtils]: 33: Hoare triple {3890#(bvsgt (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32))) (_ bv0 32))} assume !#t~short22;call #t~mem21 := read~intINTTYPE4(~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);#t~short22 := ~bvsgt32(#t~mem21, 0bv32); {3877#|main_#t~short22|} is VALID [2018-11-18 21:53:07,121 INFO L273 TraceCheckUtils]: 32: Hoare triple {3890#(bvsgt (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32))) (_ bv0 32))} assume true;#t~short22 := 0bv32 == ~status~0; {3890#(bvsgt (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {3890#(bvsgt (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32))) (_ bv0 32))} assume !!((~item~0.base != 0bv32 || ~item~0.offset != 0bv32) && 0bv32 != #t~nondet20);havoc #t~nondet20; {3890#(bvsgt (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,122 INFO L273 TraceCheckUtils]: 30: Hoare triple {3890#(bvsgt (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32))) (_ bv0 32))} assume true; {3890#(bvsgt (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,124 INFO L273 TraceCheckUtils]: 29: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {3890#(bvsgt (select (select |#memory_int| main_~item~0.base) (bvadd main_~item~0.offset (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,124 INFO L273 TraceCheckUtils]: 28: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume !(3bv32 == ~status~0); {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume !(2bv32 == ~status~0); {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume true; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,133 INFO L273 TraceCheckUtils]: 25: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume !!(#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32);havoc #t~mem5.base, #t~mem5.offset; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,134 INFO L273 TraceCheckUtils]: 24: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32); {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,134 INFO L273 TraceCheckUtils]: 23: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume true; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume true; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume 1bv32 == ~status~0; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume true; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,136 INFO L273 TraceCheckUtils]: 18: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,136 INFO L273 TraceCheckUtils]: 17: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume true; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,137 INFO L273 TraceCheckUtils]: 15: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume true; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume true; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume !!(~item~0.base != 0bv32 || ~item~0.offset != 0bv32); {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume true; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume true; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} assume true; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {3967#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~item~0.offset))} assume 0bv32 == ~status~0;call write~intINTTYPE4(1bv32, ~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);~status~0 := 1bv32; {3903#(bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-18 21:53:07,154 INFO L273 TraceCheckUtils]: 7: Hoare triple {3971#(and (or (forall ((v_prenex_98 (_ BitVec 32))) (not (= (select |#valid| v_prenex_98) (_ bv0 1)))) (= main_~head~0.offset main_~item~0.offset) (= (_ bv0 32) main_~item~0.offset) (= (_ bv0 32) main_~head~0.offset)) (or (= (_ bv4 32) main_~head~0.offset) (forall ((v_prenex_104 (_ BitVec 32))) (not (= (select |#valid| v_prenex_104) (_ bv0 1)))) (= main_~head~0.offset main_~item~0.offset) (= (_ bv0 32) main_~head~0.offset)) (or (forall ((v_prenex_100 (_ BitVec 32))) (or (= v_prenex_100 main_~head~0.base) (not (= (select |#valid| v_prenex_100) (_ bv0 1))))) (= main_~head~0.offset main_~item~0.offset)) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (not (= (select |#valid| main_~item~0.base) (_ bv0 1))) (not (= (_ bv4 32) main_~item~0.offset))) (or (= main_~item~0.base main_~head~0.base) (forall ((v_prenex_103 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_103) (_ bv0 1))) (= v_prenex_103 main_~head~0.base)))) (or (= main_~item~0.base main_~head~0.base) (= (_ bv0 32) main_~head~0.offset) (forall ((v_prenex_29 (_ BitVec 32))) (not (= (select |#valid| v_prenex_29) (_ bv0 1))))))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~item~0.base, ~item~0.offset, 4bv32); {3967#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~item~0.offset))} is VALID [2018-11-18 21:53:07,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {3971#(and (or (forall ((v_prenex_98 (_ BitVec 32))) (not (= (select |#valid| v_prenex_98) (_ bv0 1)))) (= main_~head~0.offset main_~item~0.offset) (= (_ bv0 32) main_~item~0.offset) (= (_ bv0 32) main_~head~0.offset)) (or (= (_ bv4 32) main_~head~0.offset) (forall ((v_prenex_104 (_ BitVec 32))) (not (= (select |#valid| v_prenex_104) (_ bv0 1)))) (= main_~head~0.offset main_~item~0.offset) (= (_ bv0 32) main_~head~0.offset)) (or (forall ((v_prenex_100 (_ BitVec 32))) (or (= v_prenex_100 main_~head~0.base) (not (= (select |#valid| v_prenex_100) (_ bv0 1))))) (= main_~head~0.offset main_~item~0.offset)) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (not (= (select |#valid| main_~item~0.base) (_ bv0 1))) (not (= (_ bv4 32) main_~item~0.offset))) (or (= main_~item~0.base main_~head~0.base) (forall ((v_prenex_103 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_103) (_ bv0 1))) (= v_prenex_103 main_~head~0.base)))) (or (= main_~item~0.base main_~head~0.base) (= (_ bv0 32) main_~head~0.offset) (forall ((v_prenex_29 (_ BitVec 32))) (not (= (select |#valid| v_prenex_29) (_ bv0 1))))))} assume true; {3971#(and (or (forall ((v_prenex_98 (_ BitVec 32))) (not (= (select |#valid| v_prenex_98) (_ bv0 1)))) (= main_~head~0.offset main_~item~0.offset) (= (_ bv0 32) main_~item~0.offset) (= (_ bv0 32) main_~head~0.offset)) (or (= (_ bv4 32) main_~head~0.offset) (forall ((v_prenex_104 (_ BitVec 32))) (not (= (select |#valid| v_prenex_104) (_ bv0 1)))) (= main_~head~0.offset main_~item~0.offset) (= (_ bv0 32) main_~head~0.offset)) (or (forall ((v_prenex_100 (_ BitVec 32))) (or (= v_prenex_100 main_~head~0.base) (not (= (select |#valid| v_prenex_100) (_ bv0 1))))) (= main_~head~0.offset main_~item~0.offset)) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (not (= (select |#valid| main_~item~0.base) (_ bv0 1))) (not (= (_ bv4 32) main_~item~0.offset))) (or (= main_~item~0.base main_~head~0.base) (forall ((v_prenex_103 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_103) (_ bv0 1))) (= v_prenex_103 main_~head~0.base)))) (or (= main_~item~0.base main_~head~0.base) (= (_ bv0 32) main_~head~0.offset) (forall ((v_prenex_29 (_ BitVec 32))) (not (= (select |#valid| v_prenex_29) (_ bv0 1))))))} is VALID [2018-11-18 21:53:07,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {3769#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {3971#(and (or (forall ((v_prenex_98 (_ BitVec 32))) (not (= (select |#valid| v_prenex_98) (_ bv0 1)))) (= main_~head~0.offset main_~item~0.offset) (= (_ bv0 32) main_~item~0.offset) (= (_ bv0 32) main_~head~0.offset)) (or (= (_ bv4 32) main_~head~0.offset) (forall ((v_prenex_104 (_ BitVec 32))) (not (= (select |#valid| v_prenex_104) (_ bv0 1)))) (= main_~head~0.offset main_~item~0.offset) (= (_ bv0 32) main_~head~0.offset)) (or (forall ((v_prenex_100 (_ BitVec 32))) (or (= v_prenex_100 main_~head~0.base) (not (= (select |#valid| v_prenex_100) (_ bv0 1))))) (= main_~head~0.offset main_~item~0.offset)) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (not (= (select |#valid| main_~item~0.base) (_ bv0 1))) (not (= (_ bv4 32) main_~item~0.offset))) (or (= main_~item~0.base main_~head~0.base) (forall ((v_prenex_103 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_103) (_ bv0 1))) (= v_prenex_103 main_~head~0.base)))) (or (= main_~item~0.base main_~head~0.base) (= (_ bv0 32) main_~head~0.offset) (forall ((v_prenex_29 (_ BitVec 32))) (not (= (select |#valid| v_prenex_29) (_ bv0 1))))))} is VALID [2018-11-18 21:53:07,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {3769#true} call #t~ret25 := main(); {3769#true} is VALID [2018-11-18 21:53:07,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3769#true} {3769#true} #359#return; {3769#true} is VALID [2018-11-18 21:53:07,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {3769#true} assume true; {3769#true} is VALID [2018-11-18 21:53:07,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {3769#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3769#true} is VALID [2018-11-18 21:53:07,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2018-11-18 21:53:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:53:07,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:53:07,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-18 21:53:07,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-18 21:53:07,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:53:07,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 21:53:07,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:53:07,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 21:53:07,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 21:53:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 21:53:07,420 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 11 states. [2018-11-18 21:53:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:53:12,155 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-11-18 21:53:12,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 21:53:12,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-18 21:53:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:53:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 21:53:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 206 transitions. [2018-11-18 21:53:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 21:53:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 206 transitions. [2018-11-18 21:53:12,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 206 transitions. [2018-11-18 21:53:12,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:53:12,510 INFO L225 Difference]: With dead ends: 209 [2018-11-18 21:53:12,510 INFO L226 Difference]: Without dead ends: 207 [2018-11-18 21:53:12,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-18 21:53:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-18 21:53:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 122. [2018-11-18 21:53:12,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:53:12,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand 122 states. [2018-11-18 21:53:12,632 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 122 states. [2018-11-18 21:53:12,632 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 122 states. [2018-11-18 21:53:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:53:12,640 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-11-18 21:53:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2018-11-18 21:53:12,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:53:12,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:53:12,640 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 207 states. [2018-11-18 21:53:12,641 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 207 states. [2018-11-18 21:53:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:53:12,647 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-11-18 21:53:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2018-11-18 21:53:12,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:53:12,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:53:12,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:53:12,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:53:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 21:53:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-11-18 21:53:12,652 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 36 [2018-11-18 21:53:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:53:12,652 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-11-18 21:53:12,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 21:53:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-11-18 21:53:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 21:53:12,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:53:12,654 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:53:12,654 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:53:12,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:53:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash -918326656, now seen corresponding path program 1 times [2018-11-18 21:53:12,655 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:53:12,655 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:53:12,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:53:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:53:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:53:12,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:53:12,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {4788#true} call ULTIMATE.init(); {4788#true} is VALID [2018-11-18 21:53:12,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {4788#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4788#true} is VALID [2018-11-18 21:53:12,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {4788#true} assume true; {4788#true} is VALID [2018-11-18 21:53:12,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4788#true} {4788#true} #359#return; {4788#true} is VALID [2018-11-18 21:53:12,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {4788#true} call #t~ret25 := main(); {4788#true} is VALID [2018-11-18 21:53:12,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {4788#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {4788#true} is VALID [2018-11-18 21:53:12,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {4788#true} assume true; {4788#true} is VALID [2018-11-18 21:53:12,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {4788#true} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~item~0.base, ~item~0.offset, 4bv32); {4788#true} is VALID [2018-11-18 21:53:12,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {4788#true} assume 0bv32 == ~status~0;call write~intINTTYPE4(1bv32, ~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);~status~0 := 1bv32; {4788#true} is VALID [2018-11-18 21:53:12,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {4788#true} assume true; {4788#true} is VALID [2018-11-18 21:53:12,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {4788#true} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {4788#true} is VALID [2018-11-18 21:53:12,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {4788#true} assume true; {4788#true} is VALID [2018-11-18 21:53:12,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {4788#true} assume true; {4788#true} is VALID [2018-11-18 21:53:12,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {4788#true} assume !!(~item~0.base != 0bv32 || ~item~0.offset != 0bv32); {4788#true} is VALID [2018-11-18 21:53:12,803 INFO L273 TraceCheckUtils]: 14: Hoare triple {4788#true} assume true; {4788#true} is VALID [2018-11-18 21:53:12,804 INFO L273 TraceCheckUtils]: 15: Hoare triple {4788#true} assume true; {4788#true} is VALID [2018-11-18 21:53:12,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {4788#true} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~item~0.base, ~item~0.offset, 4bv32); {4788#true} is VALID [2018-11-18 21:53:12,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {4788#true} assume !(0bv32 == ~status~0); {4788#true} is VALID [2018-11-18 21:53:12,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {4788#true} assume 1bv32 == ~status~0;call write~intINTTYPE4(2bv32, ~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);~status~0 := 2bv32; {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,825 INFO L273 TraceCheckUtils]: 22: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,825 INFO L273 TraceCheckUtils]: 23: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~item~0.base != 0bv32 || ~item~0.offset != 0bv32); {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:53:12,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {4847#(= (bvadd main_~status~0 (_ bv4294967294 32)) (_ bv0 32))} assume 1bv32 == ~status~0; {4789#false} is VALID [2018-11-18 21:53:12,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {4789#false} assume true; {4789#false} is VALID [2018-11-18 21:53:12,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {4789#false} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {4789#false} is VALID [2018-11-18 21:53:12,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {4789#false} assume true; {4789#false} is VALID [2018-11-18 21:53:12,840 INFO L273 TraceCheckUtils]: 34: Hoare triple {4789#false} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32); {4789#false} is VALID [2018-11-18 21:53:12,841 INFO L273 TraceCheckUtils]: 35: Hoare triple {4789#false} assume !(#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32);havoc #t~mem5.base, #t~mem5.offset; {4789#false} is VALID [2018-11-18 21:53:12,841 INFO L273 TraceCheckUtils]: 36: Hoare triple {4789#false} assume !false; {4789#false} is VALID [2018-11-18 21:53:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 21:53:12,842 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:53:12,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:53:12,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:53:12,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 21:53:12,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:53:12,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:53:12,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:53:12,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:53:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:53:12,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:53:12,904 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 3 states. [2018-11-18 21:53:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:53:13,375 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2018-11-18 21:53:13,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:53:13,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 21:53:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:53:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:53:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2018-11-18 21:53:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:53:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2018-11-18 21:53:13,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 199 transitions. [2018-11-18 21:53:13,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:53:13,581 INFO L225 Difference]: With dead ends: 238 [2018-11-18 21:53:13,581 INFO L226 Difference]: Without dead ends: 150 [2018-11-18 21:53:13,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:53:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-18 21:53:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-11-18 21:53:13,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:53:13,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 138 states. [2018-11-18 21:53:13,758 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 138 states. [2018-11-18 21:53:13,758 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 138 states. [2018-11-18 21:53:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:53:13,763 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2018-11-18 21:53:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2018-11-18 21:53:13,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:53:13,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:53:13,764 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 150 states. [2018-11-18 21:53:13,764 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 150 states. [2018-11-18 21:53:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:53:13,769 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2018-11-18 21:53:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2018-11-18 21:53:13,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:53:13,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:53:13,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:53:13,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:53:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 21:53:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2018-11-18 21:53:13,774 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 37 [2018-11-18 21:53:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:53:13,775 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2018-11-18 21:53:13,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:53:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2018-11-18 21:53:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 21:53:13,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:53:13,776 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:53:13,776 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:53:13,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:53:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1102714049, now seen corresponding path program 1 times [2018-11-18 21:53:13,777 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:53:13,777 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:53:13,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:53:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:53:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:53:13,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:53:14,227 INFO L477 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 [2018-11-18 21:53:14,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:14,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:53:14,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-18 21:53:14,262 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:53:14,380 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:53:14,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:53:14,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 21:53:14,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:14,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 57 [2018-11-18 21:53:14,685 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2018-11-18 21:53:14,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 21:53:14,697 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:14,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-18 21:53:14,798 INFO L477 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 10 treesize of output 9 [2018-11-18 21:53:14,799 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:14,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-18 21:53:14,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 21:53:14,964 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:15,024 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:53:15,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:53:15,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:53:15,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:53:15,239 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:120, output treesize:110 [2018-11-18 21:53:17,515 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:53:17,738 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:53:17,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:53:17,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:53:17,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-18 21:53:17,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:17,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 128 [2018-11-18 21:53:18,140 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2018-11-18 21:53:18,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-18 21:53:18,155 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:18,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2018-11-18 21:53:18,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-11-18 21:53:18,275 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:18,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 78 [2018-11-18 21:53:18,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:53:18,477 INFO L477 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 74 [2018-11-18 21:53:18,482 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:18,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:53:18,677 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:53:18,787 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:53:18,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-18 21:53:18,903 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:265, output treesize:150 [2018-11-18 21:53:19,089 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:53:23,243 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-18 21:53:23,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 51 [2018-11-18 21:53:23,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 35 treesize of output 34 [2018-11-18 21:53:23,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:24,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 13 [2018-11-18 21:53:24,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:24,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2018-11-18 21:53:24,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:24,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:53:24,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2018-11-18 21:53:24,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 1 [2018-11-18 21:53:24,199 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:24,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 15 [2018-11-18 21:53:24,227 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:24,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2018-11-18 21:53:24,248 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:24,255 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:53:24,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:53:24,286 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:158, output treesize:4 [2018-11-18 21:53:24,301 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:53:24,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {5620#true} call ULTIMATE.init(); {5620#true} is VALID [2018-11-18 21:53:24,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {5620#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5620#true} is VALID [2018-11-18 21:53:24,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {5620#true} assume true; {5620#true} is VALID [2018-11-18 21:53:24,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5620#true} {5620#true} #359#return; {5620#true} is VALID [2018-11-18 21:53:24,318 INFO L256 TraceCheckUtils]: 4: Hoare triple {5620#true} call #t~ret25 := main(); {5620#true} is VALID [2018-11-18 21:53:24,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {5620#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0bv32; {5640#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:53:24,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {5640#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume true; {5640#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:53:24,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {5640#(and (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset main_~item~0.offset) (= (bvadd (select |#valid| main_~item~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~item~0.base, ~item~0.offset, 4bv32); {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:53:24,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume 0bv32 == ~status~0;call write~intINTTYPE4(1bv32, ~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);~status~0 := 1bv32; {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:53:24,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume true; {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:53:24,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:53:24,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume true; {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:53:24,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume true; {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:53:24,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !!(~item~0.base != 0bv32 || ~item~0.offset != 0bv32); {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:53:24,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume true; {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:53:24,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume true; {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-18 21:53:24,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {5647#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4bv32);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~item~0.base, ~item~0.offset, 4bv32); {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !(0bv32 == ~status~0); {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume 1bv32 == ~status~0;call write~intINTTYPE4(2bv32, ~item~0.base, ~bvadd32(8bv32, ~item~0.offset), 4bv32);~status~0 := 2bv32; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,403 INFO L273 TraceCheckUtils]: 20: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,404 INFO L273 TraceCheckUtils]: 21: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !!(~item~0.base != 0bv32 || ~item~0.offset != 0bv32); {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,406 INFO L273 TraceCheckUtils]: 25: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !(1bv32 == ~status~0); {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume 2bv32 == ~status~0; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,412 INFO L273 TraceCheckUtils]: 33: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume !!(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,412 INFO L273 TraceCheckUtils]: 34: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-18 21:53:24,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {5675#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (exists ((v_prenex_106 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106) main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_prenex_106)) (bvadd v_prenex_105 (_ bv4 32)))))) (= (_ bv0 32) main_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32))) (exists ((main_~item~0.offset (_ BitVec 32)) (|main_#t~malloc2.offset| (_ BitVec 32)) (v_main_~item~0.offset_25 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) main_~item~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25)) (bvadd |main_#t~malloc2.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) v_main_~item~0.offset_25) main_~head~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))} assume true;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32); {5733#(not (= |main_#t~mem6.base| (_ bv0 32)))} is VALID [2018-11-18 21:53:24,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {5733#(not (= |main_#t~mem6.base| (_ bv0 32)))} assume !(#t~mem6.base != 0bv32 || #t~mem6.offset != 0bv32);havoc #t~mem6.base, #t~mem6.offset; {5621#false} is VALID [2018-11-18 21:53:24,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {5621#false} assume !false; {5621#false} is VALID [2018-11-18 21:53:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:53:24,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:53:28,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1204 treesize of output 606 [2018-11-18 21:53:28,961 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2018-11-18 21:53:28,978 INFO L477 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 9 treesize of output 8 [2018-11-18 21:53:28,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:29,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 385 treesize of output 209 [2018-11-18 21:53:29,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 194 treesize of output 151 [2018-11-18 21:53:29,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:30,330 INFO L477 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 239 treesize of output 238 [2018-11-18 21:53:30,350 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:31,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 92 [2018-11-18 21:53:31,550 WARN L180 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2018-11-18 21:53:31,596 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:31,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 42 [2018-11-18 21:53:31,658 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-18 21:53:31,931 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:31,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-11-18 21:53:32,136 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-18 21:53:32,146 INFO L477 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 11 treesize of output 10 [2018-11-18 21:53:32,147 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:32,222 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:32,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-18 21:53:32,244 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:32,244 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:32,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-18 21:53:32,248 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:32,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-11-18 21:53:32,292 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:32,311 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:53:32,326 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:32,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-11-18 21:53:32,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 25 [2018-11-18 21:53:32,441 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:32,679 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:32,680 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:32,684 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:32,685 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:32,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-11-18 21:53:32,705 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:32,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 25 [2018-11-18 21:53:32,937 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:33,140 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:33,141 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:33,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-18 21:53:33,144 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:33,327 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:33,327 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:33,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-18 21:53:33,364 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:33,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 10 [2018-11-18 21:53:33,532 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:33,682 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:33,686 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:33,687 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:33,691 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:33,692 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:33,695 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:33,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2018-11-18 21:53:33,712 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:33,990 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:34,003 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:34,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-18 21:53:34,007 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:34,135 INFO L267 ElimStorePlain]: Start of recursive call 14: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 21:53:34,279 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 21:53:34,289 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:34,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-11-18 21:53:34,522 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-18 21:53:34,535 INFO L477 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 11 treesize of output 10 [2018-11-18 21:53:34,537 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:34,629 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:34,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 48 [2018-11-18 21:53:34,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 38 treesize of output 30 [2018-11-18 21:53:34,729 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:34,942 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:34,942 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:34,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-18 21:53:34,945 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:35,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 27 treesize of output 21 [2018-11-18 21:53:35,131 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:35,351 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:35,352 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:35,357 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:35,357 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:35,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-11-18 21:53:35,380 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:35,630 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:35,631 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:35,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-18 21:53:35,633 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:35,814 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:35,815 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:35,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-18 21:53:35,817 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:36,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 18 [2018-11-18 21:53:36,002 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:36,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 17 [2018-11-18 21:53:36,013 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:36,254 INFO L267 ElimStorePlain]: Start of recursive call 25: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 21:53:36,265 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:36,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-11-18 21:53:36,283 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:36,284 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:36,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-18 21:53:36,303 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:36,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-11-18 21:53:36,345 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:36,369 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:53:36,529 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 21:53:36,554 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:36,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-11-18 21:53:36,787 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-18 21:53:36,796 INFO L477 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 11 treesize of output 10 [2018-11-18 21:53:36,798 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:36,874 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:36,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-18 21:53:36,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 4 [2018-11-18 21:53:36,895 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:36,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-11-18 21:53:36,929 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:36,942 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:53:36,955 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:37,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 40 [2018-11-18 21:53:37,028 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:37,029 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:37,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-18 21:53:37,031 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:37,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 9 [2018-11-18 21:53:37,209 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:37,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 16 [2018-11-18 21:53:37,340 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:37,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 27 treesize of output 21 [2018-11-18 21:53:37,463 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:37,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2018-11-18 21:53:37,594 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:37,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 15 [2018-11-18 21:53:37,694 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:37,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-11-18 21:53:37,854 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:37,921 INFO L267 ElimStorePlain]: Start of recursive call 42: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 21:53:38,007 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 21:53:38,019 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:38,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-11-18 21:53:38,245 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-18 21:53:38,257 INFO L477 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 11 treesize of output 10 [2018-11-18 21:53:38,259 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:38,347 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:38,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 54 [2018-11-18 21:53:38,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 44 treesize of output 36 [2018-11-18 21:53:38,435 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:38,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 27 [2018-11-18 21:53:38,714 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:38,947 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:38,954 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:38,955 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:38,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-18 21:53:38,958 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:39,189 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:39,189 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:39,202 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:39,202 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:39,203 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:39,204 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:39,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2018-11-18 21:53:39,231 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:39,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 31 treesize of output 23 [2018-11-18 21:53:39,537 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:39,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 32 treesize of output 24 [2018-11-18 21:53:39,546 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:39,847 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:39,852 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:39,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:39,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-18 21:53:39,856 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:40,082 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,087 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,093 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,097 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,098 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,102 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,103 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,103 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2018-11-18 21:53:40,144 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:40,462 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,463 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-18 21:53:40,480 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:40,648 INFO L267 ElimStorePlain]: Start of recursive call 52: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 21:53:40,658 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-18 21:53:40,675 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,683 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,683 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:40,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-18 21:53:40,686 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:40,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-11-18 21:53:40,739 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:40,765 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:53:40,953 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 21:53:41,296 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 11 xjuncts. [2018-11-18 21:53:42,598 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-11-18 21:53:42,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 238 treesize of output 120 [2018-11-18 21:53:46,270 WARN L180 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 129 DAG size of output: 90 [2018-11-18 21:53:46,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:53:46,327 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:46,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 80 treesize of output 90 [2018-11-18 21:53:46,415 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 4 xjuncts. [2018-11-18 21:53:47,552 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:47,710 INFO L303 Elim1Store]: Index analysis took 186 ms [2018-11-18 21:53:47,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 90 [2018-11-18 21:53:49,313 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-18 21:53:49,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 68 [2018-11-18 21:53:49,473 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:49,483 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:49,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 74 [2018-11-18 21:53:49,524 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:49,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 58 treesize of output 59 [2018-11-18 21:53:49,902 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:50,129 INFO L267 ElimStorePlain]: Start of recursive call 68: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:53:50,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 64 [2018-11-18 21:53:50,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 57 treesize of output 58 [2018-11-18 21:53:50,253 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:50,499 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:50,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:50,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 70 [2018-11-18 21:53:50,559 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-11-18 21:53:50,786 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:53:52,248 INFO L477 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 58 treesize of output 57 [2018-11-18 21:53:52,251 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:52,260 INFO L477 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 54 treesize of output 53 [2018-11-18 21:53:52,263 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-18 21:53:53,643 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:53:53,709 INFO L303 Elim1Store]: Index analysis took 106 ms [2018-11-18 21:53:53,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 74 [2018-11-18 21:54:00,831 WARN L180 SmtUtils]: Spent 6.88 s on a formula simplification. DAG size of input: 217 DAG size of output: 215 [2018-11-18 21:54:00,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 38 treesize of output 32 [2018-11-18 21:54:00,866 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-18 21:54:04,409 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:54:04,413 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:54:04,414 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:54:04,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-18 21:54:04,417 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-18 21:54:06,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2018-11-18 21:54:06,801 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-18 21:54:08,527 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:54:08,538 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:54:08,742 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:54:08,743 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_152 term size 33 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 21:54:08,749 INFO L168 Benchmark]: Toolchain (without parser) took 153714.10 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -200.2 MB). Peak memory consumption was 986.8 MB. Max. memory is 7.1 GB. [2018-11-18 21:54:08,750 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:54:08,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.3 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2018-11-18 21:54:08,750 INFO L168 Benchmark]: Boogie Preprocessor took 119.40 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:54:08,751 INFO L168 Benchmark]: RCFGBuilder took 1705.42 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 91.9 MB). Peak memory consumption was 91.9 MB. Max. memory is 7.1 GB. [2018-11-18 21:54:08,751 INFO L168 Benchmark]: TraceAbstraction took 151122.26 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 361.8 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 469.2 MB). Peak memory consumption was 940.0 MB. Max. memory is 7.1 GB. [2018-11-18 21:54:08,753 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.3 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.40 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1705.42 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 91.9 MB). Peak memory consumption was 91.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 151122.26 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 361.8 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 469.2 MB). Peak memory consumption was 940.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_152 term size 33 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_152 term size 33: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...