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-Const.epf -i ../../../trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:11:02,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:11:02,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:11:02,929 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:11:02,929 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:11:02,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:11:02,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:11:02,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:11:02,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:11:02,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:11:02,941 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:11:02,941 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:11:02,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:11:02,945 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:11:02,952 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:11:02,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:11:02,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:11:02,962 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:11:02,963 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:11:02,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:11:02,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:11:02,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:11:02,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:11:02,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:11:02,972 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:11:02,973 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:11:02,974 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:11:02,975 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:11:02,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:11:02,977 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:11:02,977 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:11:02,978 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:11:02,978 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:11:02,978 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:11:02,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:11:02,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:11:02,980 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:11:02,995 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:11:02,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:11:02,996 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:11:02,996 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:11:02,997 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:11:02,997 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:11:02,997 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:11:02,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:11:02,998 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:11:02,998 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:11:02,998 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:11:02,998 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:11:02,999 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:11:02,999 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:11:02,999 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:11:02,999 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:11:02,999 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:11:03,000 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:11:03,000 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:11:03,000 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:11:03,000 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:11:03,000 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:11:03,001 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:11:03,001 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:11:03,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:11:03,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:11:03,001 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:11:03,002 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:11:03,002 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:11:03,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:11:03,002 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:11:03,002 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:11:03,003 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:11:03,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:11:03,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:11:03,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:11:03,066 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:11:03,067 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:11:03,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2018-11-14 18:11:03,140 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c85a434/c2ab37bfb8984767a3d1ba4d9ca76225/FLAG6e2d790fe [2018-11-14 18:11:03,738 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:11:03,738 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2018-11-14 18:11:03,761 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c85a434/c2ab37bfb8984767a3d1ba4d9ca76225/FLAG6e2d790fe [2018-11-14 18:11:03,775 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c85a434/c2ab37bfb8984767a3d1ba4d9ca76225 [2018-11-14 18:11:03,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:11:03,789 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:11:03,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:11:03,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:11:03,794 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:11:03,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:11:03" (1/1) ... [2018-11-14 18:11:03,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1160d26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:03, skipping insertion in model container [2018-11-14 18:11:03,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:11:03" (1/1) ... [2018-11-14 18:11:03,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:11:03,859 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:11:04,350 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:11:04,370 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:11:04,445 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:11:04,604 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:11:04,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:04 WrapperNode [2018-11-14 18:11:04,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:11:04,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:11:04,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:11:04,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:11:04,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:04" (1/1) ... [2018-11-14 18:11:04,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:04" (1/1) ... [2018-11-14 18:11:04,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:04" (1/1) ... [2018-11-14 18:11:04,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:04" (1/1) ... [2018-11-14 18:11:04,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:04" (1/1) ... [2018-11-14 18:11:04,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:04" (1/1) ... [2018-11-14 18:11:04,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:04" (1/1) ... [2018-11-14 18:11:04,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:11:04,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:11:04,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:11:04,716 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:11:04,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:04" (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-14 18:11:04,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:11:04,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:11:04,779 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:11:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:11:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-14 18:11:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-14 18:11:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-11-14 18:11:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-11-14 18:11:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:11:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:11:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:11:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:11:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:11:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:11:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:11:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:11:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:11:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:11:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:11:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:11:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:11:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:11:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:11:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:11:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:11:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:11:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:11:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:11:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:11:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:11:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:11:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:11:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:11:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:11:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:11:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:11:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:11:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:11:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:11:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:11:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:11:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:11:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:11:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:11:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:11:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:11:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:11:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:11:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:11:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:11:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:11:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:11:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:11:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:11:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:11:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:11:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:11:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:11:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:11:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:11:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:11:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:11:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:11:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:11:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:11:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:11:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:11:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:11:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:11:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:11:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:11:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:11:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:11:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:11:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:11:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:11:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:11:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:11:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:11:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:11:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:11:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:11:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:11:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:11:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:11:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:11:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:11:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:11:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:11:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:11:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:11:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:11:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:11:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:11:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:11:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:11:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:11:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:11:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:11:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:11:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:11:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:11:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:11:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:11:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:11:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:11:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:11:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:11:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:11:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:11:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:11:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:11:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:11:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-14 18:11:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-14 18:11:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:11:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:11:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-11-14 18:11:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:11:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:11:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:11:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-11-14 18:11:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:11:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:11:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:11:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:11:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:11:06,475 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:11:06,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:11:06 BoogieIcfgContainer [2018-11-14 18:11:06,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:11:06,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:11:06,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:11:06,482 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:11:06,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:11:03" (1/3) ... [2018-11-14 18:11:06,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284e5399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:11:06, skipping insertion in model container [2018-11-14 18:11:06,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:04" (2/3) ... [2018-11-14 18:11:06,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284e5399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:11:06, skipping insertion in model container [2018-11-14 18:11:06,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:11:06" (3/3) ... [2018-11-14 18:11:06,486 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-memcleanup.i [2018-11-14 18:11:06,498 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:11:06,509 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:11:06,530 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:11:06,566 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:11:06,567 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:11:06,567 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:11:06,567 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:11:06,568 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:11:06,568 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:11:06,568 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:11:06,569 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:11:06,569 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:11:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-11-14 18:11:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:11:06,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:11:06,611 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-14 18:11:06,614 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:11:06,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:11:06,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1385598080, now seen corresponding path program 1 times [2018-11-14 18:11:06,629 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:11:06,631 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-14 18:11:06,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:11:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:06,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:11:06,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {69#true} call ULTIMATE.init(); {69#true} is VALID [2018-11-14 18:11:06,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {69#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {69#true} is VALID [2018-11-14 18:11:06,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {69#true} assume true; {69#true} is VALID [2018-11-14 18:11:06,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {69#true} {69#true} #214#return; {69#true} is VALID [2018-11-14 18:11:06,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {69#true} call #t~ret24 := main(); {69#true} is VALID [2018-11-14 18:11:06,873 INFO L256 TraceCheckUtils]: 5: Hoare triple {69#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {69#true} is VALID [2018-11-14 18:11:06,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {69#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {69#true} is VALID [2018-11-14 18:11:06,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {69#true} assume !true; {70#false} is VALID [2018-11-14 18:11:06,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {70#false} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {70#false} is VALID [2018-11-14 18:11:06,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {70#false} assume !true; {70#false} is VALID [2018-11-14 18:11:06,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {70#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {70#false} is VALID [2018-11-14 18:11:06,877 INFO L273 TraceCheckUtils]: 11: Hoare triple {70#false} assume true; {70#false} is VALID [2018-11-14 18:11:06,878 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {70#false} {69#true} #202#return; {70#false} is VALID [2018-11-14 18:11:06,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {70#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {70#false} is VALID [2018-11-14 18:11:06,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {70#false} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {70#false} is VALID [2018-11-14 18:11:06,880 INFO L256 TraceCheckUtils]: 15: Hoare triple {70#false} call inspect(~data~0.base, ~data~0.offset); {70#false} is VALID [2018-11-14 18:11:06,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {70#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {70#false} is VALID [2018-11-14 18:11:06,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {70#false} assume true; {70#false} is VALID [2018-11-14 18:11:06,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {70#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {70#false} is VALID [2018-11-14 18:11:06,881 INFO L256 TraceCheckUtils]: 19: Hoare triple {70#false} call fail(); {70#false} is VALID [2018-11-14 18:11:06,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {70#false} assume !false; {70#false} is VALID [2018-11-14 18:11:06,887 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-14 18:11:06,887 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:11:06,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:11:06,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:11:06,900 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-14 18:11:06,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:11:06,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:11:06,996 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-14 18:11:06,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:11:07,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:11:07,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:11:07,007 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-11-14 18:11:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:07,599 INFO L93 Difference]: Finished difference Result 123 states and 184 transitions. [2018-11-14 18:11:07,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:11:07,599 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-14 18:11:07,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:11:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:11:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2018-11-14 18:11:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:11:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2018-11-14 18:11:07,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 184 transitions. [2018-11-14 18:11:08,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:08,226 INFO L225 Difference]: With dead ends: 123 [2018-11-14 18:11:08,227 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 18:11:08,236 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-14 18:11:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 18:11:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-14 18:11:08,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:11:08,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-14 18:11:08,296 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 18:11:08,296 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 18:11:08,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:08,302 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-14 18:11:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-14 18:11:08,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:08,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:08,304 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 18:11:08,304 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 18:11:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:08,309 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-14 18:11:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-14 18:11:08,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:08,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:08,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:11:08,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:11:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 18:11:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-14 18:11:08,316 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 21 [2018-11-14 18:11:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:11:08,317 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-14 18:11:08,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:11:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-14 18:11:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:11:08,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:11:08,319 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, 1, 1] [2018-11-14 18:11:08,319 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:11:08,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:11:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash -663775155, now seen corresponding path program 1 times [2018-11-14 18:11:08,320 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:11:08,320 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-14 18:11:08,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:11:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:08,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:11:08,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2018-11-14 18:11:08,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {428#true} is VALID [2018-11-14 18:11:08,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2018-11-14 18:11:08,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #214#return; {428#true} is VALID [2018-11-14 18:11:08,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret24 := main(); {428#true} is VALID [2018-11-14 18:11:08,621 INFO L256 TraceCheckUtils]: 5: Hoare triple {428#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {428#true} is VALID [2018-11-14 18:11:08,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {428#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-14 18:11:08,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume true; {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-14 18:11:08,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume !(#t~nondet7 != 0bv32);havoc #t~nondet7; {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-14 18:11:08,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-14 18:11:08,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume true; {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-14 18:11:08,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-14 18:11:08,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {470#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:11:08,631 INFO L273 TraceCheckUtils]: 13: Hoare triple {470#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} assume true; {470#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:11:08,632 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {470#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} {428#true} #202#return; {477#(and (= (_ bv0 32) |main_#t~ret23.offset|) (= |main_#t~ret23.base| (_ bv0 32)))} is VALID [2018-11-14 18:11:08,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {477#(and (= (_ bv0 32) |main_#t~ret23.offset|) (= |main_#t~ret23.base| (_ bv0 32)))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {481#(and (= main_~data~0.base (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset))} is VALID [2018-11-14 18:11:08,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {481#(and (= main_~data~0.base (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset))} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {429#false} is VALID [2018-11-14 18:11:08,634 INFO L256 TraceCheckUtils]: 17: Hoare triple {429#false} call inspect(~data~0.base, ~data~0.offset); {429#false} is VALID [2018-11-14 18:11:08,635 INFO L273 TraceCheckUtils]: 18: Hoare triple {429#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {429#false} is VALID [2018-11-14 18:11:08,635 INFO L273 TraceCheckUtils]: 19: Hoare triple {429#false} assume true; {429#false} is VALID [2018-11-14 18:11:08,636 INFO L273 TraceCheckUtils]: 20: Hoare triple {429#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {429#false} is VALID [2018-11-14 18:11:08,636 INFO L256 TraceCheckUtils]: 21: Hoare triple {429#false} call fail(); {429#false} is VALID [2018-11-14 18:11:08,637 INFO L273 TraceCheckUtils]: 22: Hoare triple {429#false} assume !false; {429#false} is VALID [2018-11-14 18:11:08,642 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-14 18:11:08,642 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:11:08,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:11:08,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:11:08,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 18:11:08,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:11:08,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:11:08,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:08,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:11:08,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:11:08,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:11:08,692 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 6 states. [2018-11-14 18:11:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:10,105 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-11-14 18:11:10,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:11:10,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 18:11:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:11:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:11:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2018-11-14 18:11:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:11:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2018-11-14 18:11:10,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 113 transitions. [2018-11-14 18:11:10,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:10,299 INFO L225 Difference]: With dead ends: 95 [2018-11-14 18:11:10,299 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:11:10,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:11:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:11:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-14 18:11:10,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:11:10,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2018-11-14 18:11:10,329 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2018-11-14 18:11:10,329 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2018-11-14 18:11:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:10,333 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-14 18:11:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-14 18:11:10,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:10,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:10,334 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2018-11-14 18:11:10,335 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2018-11-14 18:11:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:10,338 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-14 18:11:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-14 18:11:10,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:10,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:10,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:11:10,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:11:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 18:11:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-11-14 18:11:10,343 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 23 [2018-11-14 18:11:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:11:10,343 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-11-14 18:11:10,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:11:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-14 18:11:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:11:10,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:11:10,345 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] [2018-11-14 18:11:10,345 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:11:10,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:11:10,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1846107607, now seen corresponding path program 1 times [2018-11-14 18:11:10,346 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:11:10,346 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-14 18:11:10,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:11:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:10,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:11:10,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2018-11-14 18:11:10,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {784#true} is VALID [2018-11-14 18:11:10,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-14 18:11:10,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #214#return; {784#true} is VALID [2018-11-14 18:11:10,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret24 := main(); {784#true} is VALID [2018-11-14 18:11:10,505 INFO L256 TraceCheckUtils]: 5: Hoare triple {784#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {784#true} is VALID [2018-11-14 18:11:10,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {784#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {784#true} is VALID [2018-11-14 18:11:10,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-14 18:11:10,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {784#true} assume !!(#t~nondet7 != 0bv32);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16bv32);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {784#true} is VALID [2018-11-14 18:11:10,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {784#true} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:10,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, ~bvadd32(4bv32, ~node~0.offset), 4bv32); {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:10,512 INFO L273 TraceCheckUtils]: 11: Hoare triple {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} assume !(~nodelast~0.base != 0bv32 || ~nodelast~0.offset != 0bv32); {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:10,512 INFO L273 TraceCheckUtils]: 12: Hoare triple {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} ~value~0 := #t~nondet9;havoc #t~nondet9;call write~intINTTYPE4(~value~0, ~node~0.base, ~bvadd32(12bv32, ~node~0.offset), 4bv32);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:10,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} assume true; {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:10,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} assume !(#t~nondet7 != 0bv32);havoc #t~nondet7; {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:10,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {785#false} is VALID [2018-11-14 18:11:10,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {785#false} assume true; {785#false} is VALID [2018-11-14 18:11:10,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {785#false} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {785#false} is VALID [2018-11-14 18:11:10,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {785#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {785#false} is VALID [2018-11-14 18:11:10,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {785#false} assume true; {785#false} is VALID [2018-11-14 18:11:10,517 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {785#false} {784#true} #202#return; {785#false} is VALID [2018-11-14 18:11:10,517 INFO L273 TraceCheckUtils]: 21: Hoare triple {785#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {785#false} is VALID [2018-11-14 18:11:10,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {785#false} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {785#false} is VALID [2018-11-14 18:11:10,518 INFO L256 TraceCheckUtils]: 23: Hoare triple {785#false} call inspect(~data~0.base, ~data~0.offset); {785#false} is VALID [2018-11-14 18:11:10,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {785#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {785#false} is VALID [2018-11-14 18:11:10,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {785#false} assume true; {785#false} is VALID [2018-11-14 18:11:10,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {785#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {785#false} is VALID [2018-11-14 18:11:10,519 INFO L256 TraceCheckUtils]: 27: Hoare triple {785#false} call fail(); {785#false} is VALID [2018-11-14 18:11:10,519 INFO L273 TraceCheckUtils]: 28: Hoare triple {785#false} assume !false; {785#false} is VALID [2018-11-14 18:11:10,521 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-14 18:11:10,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:11:10,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:11:10,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:11:10,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:11:10,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:11:10,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:11:10,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:10,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:11:10,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:11:10,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:11:10,591 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 3 states. [2018-11-14 18:11:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:11,142 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-14 18:11:11,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:11:11,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:11:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:11:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:11:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-14 18:11:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:11:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-14 18:11:11,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-14 18:11:11,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:11,361 INFO L225 Difference]: With dead ends: 79 [2018-11-14 18:11:11,362 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 18:11:11,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-14 18:11:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 18:11:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 18:11:11,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:11:11,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 18:11:11,398 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 18:11:11,398 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 18:11:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:11,402 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 18:11:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 18:11:11,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:11,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:11,404 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 18:11:11,404 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 18:11:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:11,408 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 18:11:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 18:11:11,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:11,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:11,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:11:11,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:11:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:11:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-14 18:11:11,413 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 29 [2018-11-14 18:11:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:11:11,413 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-14 18:11:11,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:11:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 18:11:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 18:11:11,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:11:11,415 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:11:11,415 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:11:11,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:11:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1710815217, now seen corresponding path program 1 times [2018-11-14 18:11:11,416 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:11:11,416 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-14 18:11:11,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:11:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:11,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:11:11,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {1140#true} call ULTIMATE.init(); {1140#true} is VALID [2018-11-14 18:11:11,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {1140#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1140#true} is VALID [2018-11-14 18:11:11,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2018-11-14 18:11:11,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1140#true} #214#return; {1140#true} is VALID [2018-11-14 18:11:11,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {1140#true} call #t~ret24 := main(); {1140#true} is VALID [2018-11-14 18:11:11,715 INFO L256 TraceCheckUtils]: 5: Hoare triple {1140#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {1140#true} is VALID [2018-11-14 18:11:11,716 INFO L273 TraceCheckUtils]: 6: Hoare triple {1140#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {1140#true} is VALID [2018-11-14 18:11:11,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {1140#true} assume true; {1140#true} is VALID [2018-11-14 18:11:11,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {1140#true} assume !!(#t~nondet7 != 0bv32);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16bv32);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-14 18:11:11,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-14 18:11:11,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} call write~$Pointer$(0bv32, 0bv32, ~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, ~bvadd32(4bv32, ~node~0.offset), 4bv32); {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-14 18:11:11,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} assume !(~nodelast~0.base != 0bv32 || ~nodelast~0.offset != 0bv32); {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-14 18:11:11,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} ~value~0 := #t~nondet9;havoc #t~nondet9;call write~intINTTYPE4(~value~0, ~node~0.base, ~bvadd32(12bv32, ~node~0.offset), 4bv32);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,719 INFO L273 TraceCheckUtils]: 13: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume true; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !(#t~nondet7 != 0bv32);havoc #t~nondet7; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume ~node~0.base != 0bv32 || ~node~0.offset != 0bv32;call write~$Pointer$(0bv32, 0bv32, ~node~0.base, ~bvadd32(8bv32, ~node~0.offset), 4bv32); {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume true; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !!(~node~0.base != 0bv32 || ~node~0.offset != 0bv32);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16bv32);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset, 4bv32); {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,729 INFO L273 TraceCheckUtils]: 19: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, #t~mem11.base, #t~mem11.offset, 4bv32);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, #t~mem12.base, ~bvadd32(4bv32, #t~mem12.offset), 4bv32);havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~intINTTYPE4(42bv32, #t~mem13.base, ~bvadd32(12bv32, #t~mem13.offset), 4bv32);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, ~bvadd32(8bv32, #t~mem14.offset), 4bv32);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, ~bvadd32(4bv32, ~node~0.offset), 4bv32);~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume true; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,730 INFO L273 TraceCheckUtils]: 22: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {1213#(not (= |create_tree_#res.base| (_ bv0 32)))} is VALID [2018-11-14 18:11:11,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {1213#(not (= |create_tree_#res.base| (_ bv0 32)))} assume true; {1213#(not (= |create_tree_#res.base| (_ bv0 32)))} is VALID [2018-11-14 18:11:11,732 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1213#(not (= |create_tree_#res.base| (_ bv0 32)))} {1140#true} #202#return; {1220#(not (= |main_#t~ret23.base| (_ bv0 32)))} is VALID [2018-11-14 18:11:11,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {1220#(not (= |main_#t~ret23.base| (_ bv0 32)))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {1224#(not (= main_~data~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {1224#(not (= main_~data~0.base (_ bv0 32)))} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {1224#(not (= main_~data~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:11,734 INFO L256 TraceCheckUtils]: 27: Hoare triple {1224#(not (= main_~data~0.base (_ bv0 32)))} call inspect(~data~0.base, ~data~0.offset); {1231#(not (= |inspect_#in~node.base| (_ bv0 32)))} is VALID [2018-11-14 18:11:11,735 INFO L273 TraceCheckUtils]: 28: Hoare triple {1231#(not (= |inspect_#in~node.base| (_ bv0 32)))} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {1235#(not (= (_ bv0 32) inspect_~node.base))} is VALID [2018-11-14 18:11:11,736 INFO L273 TraceCheckUtils]: 29: Hoare triple {1235#(not (= (_ bv0 32) inspect_~node.base))} assume true; {1235#(not (= (_ bv0 32) inspect_~node.base))} is VALID [2018-11-14 18:11:11,737 INFO L273 TraceCheckUtils]: 30: Hoare triple {1235#(not (= (_ bv0 32) inspect_~node.base))} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {1141#false} is VALID [2018-11-14 18:11:11,737 INFO L256 TraceCheckUtils]: 31: Hoare triple {1141#false} call fail(); {1141#false} is VALID [2018-11-14 18:11:11,738 INFO L273 TraceCheckUtils]: 32: Hoare triple {1141#false} assume !false; {1141#false} is VALID [2018-11-14 18:11:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:11:11,742 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:11:11,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:11:11,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 18:11:11,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-14 18:11:11,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:11:11,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:11:11,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:11,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:11:11,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:11:11,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:11:11,799 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-11-14 18:11:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:15,291 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2018-11-14 18:11:15,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:11:15,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-14 18:11:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:11:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:11:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2018-11-14 18:11:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:11:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2018-11-14 18:11:15,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 115 transitions. [2018-11-14 18:11:15,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:15,548 INFO L225 Difference]: With dead ends: 102 [2018-11-14 18:11:15,549 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 18:11:15,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:11:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 18:11:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2018-11-14 18:11:15,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:11:15,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 49 states. [2018-11-14 18:11:15,569 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 49 states. [2018-11-14 18:11:15,569 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 49 states. [2018-11-14 18:11:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:15,573 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-14 18:11:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-11-14 18:11:15,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:15,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:15,574 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 64 states. [2018-11-14 18:11:15,574 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 64 states. [2018-11-14 18:11:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:15,578 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-14 18:11:15,578 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-11-14 18:11:15,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:15,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:15,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:11:15,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:11:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 18:11:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-14 18:11:15,582 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 33 [2018-11-14 18:11:15,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:11:15,583 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-14 18:11:15,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:11:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 18:11:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 18:11:15,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:11:15,585 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:11:15,585 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:11:15,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:11:15,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1384140576, now seen corresponding path program 1 times [2018-11-14 18:11:15,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:11:15,586 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-14 18:11:15,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:11:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:15,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:11:15,828 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-14 18:11:15,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:15,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:15,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:11:15,869 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:11:16,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:16,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:16,140 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-14 18:11:16,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:16,195 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 11 treesize of output 8 [2018-11-14 18:11:16,201 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-14 18:11:16,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:16,215 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:16,258 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 11 treesize of output 8 [2018-11-14 18:11:16,274 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-14 18:11:16,277 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:16,281 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:16,307 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-14 18:11:16,307 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:42, output treesize:25 [2018-11-14 18:11:16,329 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:11:36,360 WARN L179 SmtUtils]: Spent 14.75 s on a formula simplification. DAG size of input: 149 DAG size of output: 49 [2018-11-14 18:11:36,808 INFO L303 Elim1Store]: Index analysis took 429 ms [2018-11-14 18:11:36,810 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 460 treesize of output 348 [2018-11-14 18:11:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-14 18:11:36,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:36,933 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 28 treesize of output 47 [2018-11-14 18:11:36,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:37,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:37,626 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:37,627 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:11:38,001 INFO L303 Elim1Store]: Index analysis took 448 ms [2018-11-14 18:11:38,003 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 347 treesize of output 347 [2018-11-14 18:11:38,044 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:38,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:38,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:38,078 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 39 treesize of output 94 [2018-11-14 18:11:38,110 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:38,408 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:38,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:38,858 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 0 case distinctions, treesize of input 282 treesize of output 136 [2018-11-14 18:11:38,893 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-14 18:11:38,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:38,913 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 28 treesize of output 47 [2018-11-14 18:11:38,923 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:38,963 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:39,137 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 140 treesize of output 124 [2018-11-14 18:11:39,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:39,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:39,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:39,181 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 39 treesize of output 94 [2018-11-14 18:11:39,184 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:39,253 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:39,339 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:39,409 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-14 18:11:39,414 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-14 18:11:39,416 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:39,421 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:39,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:39,468 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:1680, output treesize:134 [2018-11-14 18:11:40,239 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:11:41,141 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-14 18:11:41,544 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 37 treesize of output 25 [2018-11-14 18:11:41,558 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 5 [2018-11-14 18:11:41,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:41,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:41,629 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 106 treesize of output 82 [2018-11-14 18:11:41,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:41,648 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:41,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:41,677 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 26 treesize of output 38 [2018-11-14 18:11:41,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:41,718 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 49 treesize of output 34 [2018-11-14 18:11:41,720 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:41,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:41,757 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-11-14 18:11:41,764 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 6 treesize of output 4 [2018-11-14 18:11:41,765 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:41,781 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 16 treesize of output 1 [2018-11-14 18:11:41,784 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:41,785 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:41,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:41,787 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:150, output treesize:5 [2018-11-14 18:11:41,797 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:11:41,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {1573#true} call ULTIMATE.init(); {1573#true} is VALID [2018-11-14 18:11:41,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {1573#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1573#true} is VALID [2018-11-14 18:11:41,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {1573#true} assume true; {1573#true} is VALID [2018-11-14 18:11:41,845 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1573#true} {1573#true} #214#return; {1573#true} is VALID [2018-11-14 18:11:41,845 INFO L256 TraceCheckUtils]: 4: Hoare triple {1573#true} call #t~ret24 := main(); {1573#true} is VALID [2018-11-14 18:11:41,846 INFO L256 TraceCheckUtils]: 5: Hoare triple {1573#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {1573#true} is VALID [2018-11-14 18:11:41,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {1573#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {1573#true} is VALID [2018-11-14 18:11:41,846 INFO L273 TraceCheckUtils]: 7: Hoare triple {1573#true} assume true; {1573#true} is VALID [2018-11-14 18:11:41,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {1573#true} assume !!(#t~nondet7 != 0bv32);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16bv32);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:41,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:41,849 INFO L273 TraceCheckUtils]: 10: Hoare triple {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, ~bvadd32(4bv32, ~node~0.offset), 4bv32); {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:41,850 INFO L273 TraceCheckUtils]: 11: Hoare triple {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} assume !(~nodelast~0.base != 0bv32 || ~nodelast~0.offset != 0bv32); {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:41,851 INFO L273 TraceCheckUtils]: 12: Hoare triple {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} ~value~0 := #t~nondet9;havoc #t~nondet9;call write~intINTTYPE4(~value~0, ~node~0.base, ~bvadd32(12bv32, ~node~0.offset), 4bv32);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {1615#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} is VALID [2018-11-14 18:11:41,851 INFO L273 TraceCheckUtils]: 13: Hoare triple {1615#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} assume true; {1615#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} is VALID [2018-11-14 18:11:41,852 INFO L273 TraceCheckUtils]: 14: Hoare triple {1615#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} assume !(#t~nondet7 != 0bv32);havoc #t~nondet7; {1615#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} is VALID [2018-11-14 18:11:41,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {1615#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} assume ~node~0.base != 0bv32 || ~node~0.offset != 0bv32;call write~$Pointer$(0bv32, 0bv32, ~node~0.base, ~bvadd32(8bv32, ~node~0.offset), 4bv32); {1615#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} is VALID [2018-11-14 18:11:41,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {1615#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} assume true; {1615#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} is VALID [2018-11-14 18:11:41,870 INFO L273 TraceCheckUtils]: 17: Hoare triple {1615#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} assume !!(~node~0.base != 0bv32 || ~node~0.offset != 0bv32);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16bv32);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset, 4bv32); {1631#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= create_tree_~nodelast~0.base create_tree_~node~0.base) (not (= (select (select |#memory_$Pointer$.base| create_tree_~node~0.base) create_tree_~node~0.offset) create_tree_~node~0.base)) (= (select (select |#memory_$Pointer$.offset| create_tree_~node~0.base) create_tree_~node~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {1631#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= create_tree_~nodelast~0.base create_tree_~node~0.base) (not (= (select (select |#memory_$Pointer$.base| create_tree_~node~0.base) create_tree_~node~0.offset) create_tree_~node~0.base)) (= (select (select |#memory_$Pointer$.offset| create_tree_~node~0.base) create_tree_~node~0.offset) (_ bv0 32)))} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {1631#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= create_tree_~nodelast~0.base create_tree_~node~0.base) (not (= (select (select |#memory_$Pointer$.base| create_tree_~node~0.base) create_tree_~node~0.offset) create_tree_~node~0.base)) (= (select (select |#memory_$Pointer$.offset| create_tree_~node~0.base) create_tree_~node~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {1631#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= create_tree_~nodelast~0.base create_tree_~node~0.base) (not (= (select (select |#memory_$Pointer$.base| create_tree_~node~0.base) create_tree_~node~0.offset) create_tree_~node~0.base)) (= (select (select |#memory_$Pointer$.offset| create_tree_~node~0.base) create_tree_~node~0.offset) (_ bv0 32)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, #t~mem11.base, #t~mem11.offset, 4bv32);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, #t~mem12.base, ~bvadd32(4bv32, #t~mem12.offset), 4bv32);havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~intINTTYPE4(42bv32, #t~mem13.base, ~bvadd32(12bv32, #t~mem13.offset), 4bv32);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, ~bvadd32(8bv32, #t~mem14.offset), 4bv32);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, ~bvadd32(4bv32, ~node~0.offset), 4bv32);~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} assume true; {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {1648#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32))) |create_tree_#res.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (_ bv0 32)) (= |create_tree_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32))) (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32)))))} is VALID [2018-11-14 18:11:41,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {1648#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32))) |create_tree_#res.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (_ bv0 32)) (= |create_tree_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32))) (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32)))))} assume true; {1648#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32))) |create_tree_#res.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (_ bv0 32)) (= |create_tree_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32))) (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32)))))} is VALID [2018-11-14 18:11:41,901 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1648#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32))) |create_tree_#res.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (_ bv0 32)) (= |create_tree_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32))) (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32)))))} {1573#true} #202#return; {1655#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv4 32)))) (= |main_#t~ret23.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) |main_#t~ret23.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv0 32)) (not (= |main_#t~ret23.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv12 32)))))} is VALID [2018-11-14 18:11:41,905 INFO L273 TraceCheckUtils]: 25: Hoare triple {1655#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv4 32)))) (= |main_#t~ret23.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) |main_#t~ret23.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv0 32)) (not (= |main_#t~ret23.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv12 32)))))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {1659#(and (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))))} is VALID [2018-11-14 18:11:41,907 INFO L273 TraceCheckUtils]: 26: Hoare triple {1659#(and (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))))} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {1659#(and (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))))} is VALID [2018-11-14 18:11:41,911 INFO L256 TraceCheckUtils]: 27: Hoare triple {1659#(and (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))))} call inspect(~data~0.base, ~data~0.offset); {1666#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= |inspect_#in~node.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv0 32)) (not (= |inspect_#in~node.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= |inspect_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)))))} is VALID [2018-11-14 18:11:41,914 INFO L273 TraceCheckUtils]: 28: Hoare triple {1666#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= |inspect_#in~node.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv0 32)) (not (= |inspect_#in~node.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= |inspect_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)))))} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume true; {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume !(~node.base == 0bv32 && ~node.offset == 0bv32); {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,921 INFO L273 TraceCheckUtils]: 31: Hoare triple {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume true; {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume true; {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,926 INFO L273 TraceCheckUtils]: 33: Hoare triple {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume !!(~node.base != 0bv32 || ~node.offset != 0bv32);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~node.base, ~node.offset, 4bv32); {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume #t~mem2.base != 0bv32 || #t~mem2.offset != 0bv32;havoc #t~mem2.base, #t~mem2.offset; {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:41,931 INFO L273 TraceCheckUtils]: 35: Hoare triple {1670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume true;call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~node.base, ~node.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(#t~mem3.base, ~bvadd32(12bv32, #t~mem3.offset), 4bv32); {1692#(= (_ bv42 32) |inspect_#t~mem4|)} is VALID [2018-11-14 18:11:41,932 INFO L273 TraceCheckUtils]: 36: Hoare triple {1692#(= (_ bv42 32) |inspect_#t~mem4|)} assume !(#t~mem4 == 42bv32);havoc #t~mem4;havoc #t~mem3.base, #t~mem3.offset; {1574#false} is VALID [2018-11-14 18:11:41,932 INFO L256 TraceCheckUtils]: 37: Hoare triple {1574#false} call fail(); {1574#false} is VALID [2018-11-14 18:11:41,932 INFO L273 TraceCheckUtils]: 38: Hoare triple {1574#false} assume !false; {1574#false} is VALID [2018-11-14 18:11:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:11:41,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:12:01,761 WARN L179 SmtUtils]: Spent 16.64 s on a formula simplification that was a NOOP. DAG size: 87 [2018-11-14 18:12:17,629 WARN L179 SmtUtils]: Spent 15.86 s on a formula simplification that was a NOOP. DAG size: 73 [2018-11-14 18:12:32,388 WARN L179 SmtUtils]: Spent 14.75 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-14 18:12:44,748 WARN L179 SmtUtils]: Spent 12.36 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-14 18:12:48,805 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked.