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/list-ext2-properties/list_and_tree_cnstr_true-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:18:25,880 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:18:25,882 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:18:25,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:18:25,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:18:25,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:18:25,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:18:25,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:18:25,906 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:18:25,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:18:25,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:18:25,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:18:25,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:18:25,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:18:25,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:18:25,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:18:25,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:18:25,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:18:25,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:18:25,936 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:18:25,937 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:18:25,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:18:25,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:18:25,945 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:18:25,945 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:18:25,946 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:18:25,947 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:18:25,948 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:18:25,949 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:18:25,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:18:25,951 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:18:25,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:18:25,952 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:18:25,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:18:25,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:18:25,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:18:25,956 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:18:25,986 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:18:25,986 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:18:25,987 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:18:25,987 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:18:25,988 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:18:25,988 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:18:25,988 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:18:25,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:18:25,989 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:18:25,989 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:18:25,989 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:18:25,989 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:18:25,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:18:25,990 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:18:25,990 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:18:25,990 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:18:25,990 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:18:25,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:18:25,991 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:18:25,991 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:18:25,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:18:25,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:18:25,992 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:18:25,992 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:18:25,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:18:25,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:18:25,992 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:18:25,992 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:18:25,993 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:18:25,993 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:18:25,993 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:18:25,993 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:18:25,993 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:18:26,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:18:26,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:18:26,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:18:26,085 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:18:26,086 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:18:26,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_true-unreach-call_false-termination.i [2018-11-14 18:18:26,150 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2028a076/1208c601e00547b38908d8d959667d79/FLAGfe8814d38 [2018-11-14 18:18:26,729 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:18:26,730 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_true-unreach-call_false-termination.i [2018-11-14 18:18:26,745 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2028a076/1208c601e00547b38908d8d959667d79/FLAGfe8814d38 [2018-11-14 18:18:26,761 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2028a076/1208c601e00547b38908d8d959667d79 [2018-11-14 18:18:26,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:18:26,772 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:18:26,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:18:26,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:18:26,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:18:26,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:18:26" (1/1) ... [2018-11-14 18:18:26,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5537dc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:18:26, skipping insertion in model container [2018-11-14 18:18:26,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:18:26" (1/1) ... [2018-11-14 18:18:26,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:18:26,841 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:18:27,344 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:18:27,371 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:18:27,478 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:18:27,639 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:18:27,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:18:27 WrapperNode [2018-11-14 18:18:27,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:18:27,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:18:27,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:18:27,641 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:18:27,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:18:27" (1/1) ... [2018-11-14 18:18:27,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:18:27" (1/1) ... [2018-11-14 18:18:27,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:18:27" (1/1) ... [2018-11-14 18:18:27,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:18:27" (1/1) ... [2018-11-14 18:18:27,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:18:27" (1/1) ... [2018-11-14 18:18:27,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:18:27" (1/1) ... [2018-11-14 18:18:27,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:18:27" (1/1) ... [2018-11-14 18:18:27,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:18:27,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:18:27,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:18:27,790 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:18:27,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:18:27" (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:18:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:18:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:18:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:18:27,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:18:27,865 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 18:18:27,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:18:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:18:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:18:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:18:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:18:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:18:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:18:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:18:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:18:27,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:18:27,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:18:27,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:18:27,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:18:27,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:18:27,870 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:18:27,870 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:18:27,870 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:18:27,870 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:18:27,870 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:18:27,871 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:18:27,871 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:18:27,871 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:18:27,871 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:18:27,871 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:18:27,871 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:18:27,872 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:18:27,872 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:18:27,872 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:18:27,872 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:18:27,872 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:18:27,873 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:18:27,873 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:18:27,873 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:18:27,873 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:18:27,873 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:18:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:18:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:18:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:18:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:18:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:18:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:18:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:18:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:18:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:18:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:18:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:18:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:18:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:18:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:18:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:18:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:18:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:18:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:18:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:18:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:18:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:18:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:18:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:18:27,878 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:18:27,878 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:18:27,878 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:18:27,878 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:18:27,878 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:18:27,879 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:18:27,879 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:18:27,879 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:18:27,879 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:18:27,879 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:18:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:18:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:18:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:18:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:18:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:18:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:18:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:18:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:18:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:18:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:18:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:18:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:18:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:18:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:18:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:18:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:18:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:18:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:18:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:18:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:18:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:18:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:18:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:18:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:18:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:18:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:18:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:18:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:18:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:18:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:18:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:18:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:18:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:18:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:18:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:18:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:18:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:18:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:18:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:18:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:18:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:18:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:18:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:18:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:18:27,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:18:27,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:18:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:18:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:18:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:18:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:18:29,943 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:18:29,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:18:29 BoogieIcfgContainer [2018-11-14 18:18:29,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:18:29,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:18:29,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:18:29,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:18:29,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:18:26" (1/3) ... [2018-11-14 18:18:29,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4769e7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:18:29, skipping insertion in model container [2018-11-14 18:18:29,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:18:27" (2/3) ... [2018-11-14 18:18:29,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4769e7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:18:29, skipping insertion in model container [2018-11-14 18:18:29,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:18:29" (3/3) ... [2018-11-14 18:18:29,956 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr_true-unreach-call_false-termination.i [2018-11-14 18:18:29,968 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:18:29,979 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:18:29,998 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:18:30,033 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:18:30,034 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:18:30,034 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:18:30,034 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:18:30,035 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:18:30,035 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:18:30,035 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:18:30,035 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:18:30,035 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:18:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-14 18:18:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:18:30,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:30,069 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] [2018-11-14 18:18:30,073 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:30,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2092641818, now seen corresponding path program 1 times [2018-11-14 18:18:30,086 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:30,087 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:18:30,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:30,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:30,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {63#true} is VALID [2018-11-14 18:18:30,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {63#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {63#true} is VALID [2018-11-14 18:18:30,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-14 18:18:30,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #217#return; {63#true} is VALID [2018-11-14 18:18:30,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret39 := main(); {63#true} is VALID [2018-11-14 18:18:30,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {63#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {63#true} is VALID [2018-11-14 18:18:30,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {63#true} assume !true; {64#false} is VALID [2018-11-14 18:18:30,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {64#false} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {64#false} is VALID [2018-11-14 18:18:30,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {64#false} assume !true; {64#false} is VALID [2018-11-14 18:18:30,327 INFO L273 TraceCheckUtils]: 9: Hoare triple {64#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {64#false} is VALID [2018-11-14 18:18:30,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {64#false} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {64#false} is VALID [2018-11-14 18:18:30,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {64#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {64#false} is VALID [2018-11-14 18:18:30,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {64#false} assume !true; {64#false} is VALID [2018-11-14 18:18:30,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {64#false} assume !true; {64#false} is VALID [2018-11-14 18:18:30,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {64#false} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {64#false} is VALID [2018-11-14 18:18:30,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {64#false} assume !true; {64#false} is VALID [2018-11-14 18:18:30,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {64#false} assume !true; {64#false} is VALID [2018-11-14 18:18:30,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {64#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {64#false} is VALID [2018-11-14 18:18:30,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {64#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {64#false} is VALID [2018-11-14 18:18:30,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {64#false} assume !false; {64#false} is VALID [2018-11-14 18:18:30,335 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:18:30,335 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:18:30,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:18:30,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:18:30,346 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 18:18:30,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:30,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:18:30,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:30,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:18:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:18:30,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:18:30,458 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-14 18:18:31,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:31,091 INFO L93 Difference]: Finished difference Result 114 states and 166 transitions. [2018-11-14 18:18:31,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:18:31,092 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 18:18:31,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:18:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-14 18:18:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:18:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-14 18:18:31,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 166 transitions. [2018-11-14 18:18:31,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:31,554 INFO L225 Difference]: With dead ends: 114 [2018-11-14 18:18:31,555 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 18:18:31,559 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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:18:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 18:18:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 18:18:31,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:31,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 18:18:31,627 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 18:18:31,627 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 18:18:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:31,634 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-11-14 18:18:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2018-11-14 18:18:31,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:31,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:31,636 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 18:18:31,636 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 18:18:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:31,641 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-11-14 18:18:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2018-11-14 18:18:31,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:31,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:31,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:31,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:18:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2018-11-14 18:18:31,649 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 20 [2018-11-14 18:18:31,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:31,649 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2018-11-14 18:18:31,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:18:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2018-11-14 18:18:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:18:31,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:31,651 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, 1, 1, 1, 1, 1] [2018-11-14 18:18:31,652 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:31,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash -112642849, now seen corresponding path program 1 times [2018-11-14 18:18:31,653 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:31,653 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:18:31,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:31,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:31,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2018-11-14 18:18:31,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {422#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {422#true} is VALID [2018-11-14 18:18:31,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2018-11-14 18:18:31,845 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #217#return; {422#true} is VALID [2018-11-14 18:18:31,846 INFO L256 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret39 := main(); {422#true} is VALID [2018-11-14 18:18:31,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {422#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {442#(not (= main_~root~0.base (_ bv0 32)))} is VALID [2018-11-14 18:18:31,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {442#(not (= main_~root~0.base (_ bv0 32)))} assume true; {442#(not (= main_~root~0.base (_ bv0 32)))} is VALID [2018-11-14 18:18:31,848 INFO L273 TraceCheckUtils]: 7: Hoare triple {442#(not (= main_~root~0.base (_ bv0 32)))} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {442#(not (= main_~root~0.base (_ bv0 32)))} is VALID [2018-11-14 18:18:31,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {442#(not (= main_~root~0.base (_ bv0 32)))} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {442#(not (= main_~root~0.base (_ bv0 32)))} is VALID [2018-11-14 18:18:31,849 INFO L273 TraceCheckUtils]: 9: Hoare triple {442#(not (= main_~root~0.base (_ bv0 32)))} assume true; {442#(not (= main_~root~0.base (_ bv0 32)))} is VALID [2018-11-14 18:18:31,850 INFO L273 TraceCheckUtils]: 10: Hoare triple {442#(not (= main_~root~0.base (_ bv0 32)))} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {423#false} is VALID [2018-11-14 18:18:31,850 INFO L273 TraceCheckUtils]: 11: Hoare triple {423#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {423#false} is VALID [2018-11-14 18:18:31,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {423#false} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {423#false} is VALID [2018-11-14 18:18:31,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {423#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {423#false} is VALID [2018-11-14 18:18:31,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {423#false} assume true; {423#false} is VALID [2018-11-14 18:18:31,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {423#false} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {423#false} is VALID [2018-11-14 18:18:31,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {423#false} assume true; {423#false} is VALID [2018-11-14 18:18:31,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {423#false} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {423#false} is VALID [2018-11-14 18:18:31,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {423#false} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {423#false} is VALID [2018-11-14 18:18:31,853 INFO L273 TraceCheckUtils]: 19: Hoare triple {423#false} assume true; {423#false} is VALID [2018-11-14 18:18:31,853 INFO L273 TraceCheckUtils]: 20: Hoare triple {423#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {423#false} is VALID [2018-11-14 18:18:31,854 INFO L273 TraceCheckUtils]: 21: Hoare triple {423#false} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {423#false} is VALID [2018-11-14 18:18:31,854 INFO L273 TraceCheckUtils]: 22: Hoare triple {423#false} assume true; {423#false} is VALID [2018-11-14 18:18:31,854 INFO L273 TraceCheckUtils]: 23: Hoare triple {423#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {423#false} is VALID [2018-11-14 18:18:31,855 INFO L273 TraceCheckUtils]: 24: Hoare triple {423#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {423#false} is VALID [2018-11-14 18:18:31,855 INFO L273 TraceCheckUtils]: 25: Hoare triple {423#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {423#false} is VALID [2018-11-14 18:18:31,855 INFO L273 TraceCheckUtils]: 26: Hoare triple {423#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {423#false} is VALID [2018-11-14 18:18:31,856 INFO L273 TraceCheckUtils]: 27: Hoare triple {423#false} assume !false; {423#false} is VALID [2018-11-14 18:18:31,859 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:18:31,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:18:31,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:18:31,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:18:31,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:18:31,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:31,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:18:31,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:31,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:18:31,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:18:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:18:31,962 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand 3 states. [2018-11-14 18:18:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:32,267 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2018-11-14 18:18:32,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:18:32,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:18:32,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:18:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-14 18:18:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:18:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-14 18:18:32,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2018-11-14 18:18:32,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:32,656 INFO L225 Difference]: With dead ends: 82 [2018-11-14 18:18:32,656 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 18:18:32,657 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:18:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 18:18:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-14 18:18:32,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:32,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-14 18:18:32,682 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 18:18:32,683 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 18:18:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:32,688 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2018-11-14 18:18:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2018-11-14 18:18:32,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:32,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:32,689 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 18:18:32,689 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 18:18:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:32,694 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2018-11-14 18:18:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2018-11-14 18:18:32,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:32,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:32,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:32,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 18:18:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2018-11-14 18:18:32,700 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 28 [2018-11-14 18:18:32,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:32,700 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2018-11-14 18:18:32,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:18:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2018-11-14 18:18:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:18:32,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:32,702 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:18:32,702 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:32,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:32,703 INFO L82 PathProgramCache]: Analyzing trace with hash -602567857, now seen corresponding path program 1 times [2018-11-14 18:18:32,703 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:32,704 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:18:32,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:32,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:32,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {796#true} call ULTIMATE.init(); {796#true} is VALID [2018-11-14 18:18:32,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {796#true} is VALID [2018-11-14 18:18:32,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-14 18:18:32,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {796#true} {796#true} #217#return; {796#true} is VALID [2018-11-14 18:18:32,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {796#true} call #t~ret39 := main(); {796#true} is VALID [2018-11-14 18:18:32,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {796#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {796#true} is VALID [2018-11-14 18:18:32,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-14 18:18:32,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {796#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {796#true} is VALID [2018-11-14 18:18:32,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {796#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {796#true} is VALID [2018-11-14 18:18:32,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-14 18:18:32,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {796#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {796#true} is VALID [2018-11-14 18:18:32,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-14 18:18:32,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {796#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {796#true} is VALID [2018-11-14 18:18:32,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {796#true} assume #t~short22; {840#|main_#t~short22|} is VALID [2018-11-14 18:18:32,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {840#|main_#t~short22|} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {797#false} is VALID [2018-11-14 18:18:32,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {797#false} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {797#false} is VALID [2018-11-14 18:18:32,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {797#false} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {797#false} is VALID [2018-11-14 18:18:32,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {797#false} assume true; {797#false} is VALID [2018-11-14 18:18:32,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {797#false} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {797#false} is VALID [2018-11-14 18:18:32,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {797#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {797#false} is VALID [2018-11-14 18:18:32,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {797#false} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {797#false} is VALID [2018-11-14 18:18:32,867 INFO L273 TraceCheckUtils]: 21: Hoare triple {797#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {797#false} is VALID [2018-11-14 18:18:32,867 INFO L273 TraceCheckUtils]: 22: Hoare triple {797#false} assume true; {797#false} is VALID [2018-11-14 18:18:32,867 INFO L273 TraceCheckUtils]: 23: Hoare triple {797#false} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {797#false} is VALID [2018-11-14 18:18:32,868 INFO L273 TraceCheckUtils]: 24: Hoare triple {797#false} assume true; {797#false} is VALID [2018-11-14 18:18:32,868 INFO L273 TraceCheckUtils]: 25: Hoare triple {797#false} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {797#false} is VALID [2018-11-14 18:18:32,868 INFO L273 TraceCheckUtils]: 26: Hoare triple {797#false} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {797#false} is VALID [2018-11-14 18:18:32,868 INFO L273 TraceCheckUtils]: 27: Hoare triple {797#false} assume true; {797#false} is VALID [2018-11-14 18:18:32,869 INFO L273 TraceCheckUtils]: 28: Hoare triple {797#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {797#false} is VALID [2018-11-14 18:18:32,869 INFO L273 TraceCheckUtils]: 29: Hoare triple {797#false} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {797#false} is VALID [2018-11-14 18:18:32,869 INFO L273 TraceCheckUtils]: 30: Hoare triple {797#false} assume true; {797#false} is VALID [2018-11-14 18:18:32,869 INFO L273 TraceCheckUtils]: 31: Hoare triple {797#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {797#false} is VALID [2018-11-14 18:18:32,870 INFO L273 TraceCheckUtils]: 32: Hoare triple {797#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {797#false} is VALID [2018-11-14 18:18:32,870 INFO L273 TraceCheckUtils]: 33: Hoare triple {797#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {797#false} is VALID [2018-11-14 18:18:32,870 INFO L273 TraceCheckUtils]: 34: Hoare triple {797#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {797#false} is VALID [2018-11-14 18:18:32,870 INFO L273 TraceCheckUtils]: 35: Hoare triple {797#false} assume !false; {797#false} is VALID [2018-11-14 18:18:32,872 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:18:32,873 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:18:32,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:18:32,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:18:32,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-14 18:18:32,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:32,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:18:32,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:32,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:18:32,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:18:32,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:18:32,924 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 3 states. [2018-11-14 18:18:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:33,236 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2018-11-14 18:18:33,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:18:33,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-14 18:18:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:18:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-14 18:18:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:18:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-14 18:18:33,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 108 transitions. [2018-11-14 18:18:33,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:33,438 INFO L225 Difference]: With dead ends: 104 [2018-11-14 18:18:33,438 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 18:18:33,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:18:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 18:18:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-14 18:18:33,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:33,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-14 18:18:33,468 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 18:18:33,469 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 18:18:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:33,472 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2018-11-14 18:18:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2018-11-14 18:18:33,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:33,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:33,473 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 18:18:33,474 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 18:18:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:33,477 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2018-11-14 18:18:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2018-11-14 18:18:33,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:33,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:33,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:33,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 18:18:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2018-11-14 18:18:33,483 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 36 [2018-11-14 18:18:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:33,483 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2018-11-14 18:18:33,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:18:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2018-11-14 18:18:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:18:33,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:33,485 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:18:33,485 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:33,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:33,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1886961105, now seen corresponding path program 1 times [2018-11-14 18:18:33,486 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:33,487 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:18:33,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:33,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:33,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:18:33,820 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:18:33,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:33,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:33,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:33,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 18:18:34,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 18:18:34,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-14 18:18:34,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:34,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:34,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:34,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-14 18:18:34,029 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:34,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1226#true} is VALID [2018-11-14 18:18:34,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {1226#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1226#true} is VALID [2018-11-14 18:18:34,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-14 18:18:34,090 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #217#return; {1226#true} is VALID [2018-11-14 18:18:34,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret39 := main(); {1226#true} is VALID [2018-11-14 18:18:34,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {1226#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {1226#true} is VALID [2018-11-14 18:18:34,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-14 18:18:34,091 INFO L273 TraceCheckUtils]: 7: Hoare triple {1226#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {1226#true} is VALID [2018-11-14 18:18:34,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {1226#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {1226#true} is VALID [2018-11-14 18:18:34,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-14 18:18:34,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1226#true} is VALID [2018-11-14 18:18:34,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-14 18:18:34,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {1226#true} is VALID [2018-11-14 18:18:34,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {1226#true} is VALID [2018-11-14 18:18:34,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {1226#true} is VALID [2018-11-14 18:18:34,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {1226#true} is VALID [2018-11-14 18:18:34,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1226#true} is VALID [2018-11-14 18:18:34,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-14 18:18:34,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {1226#true} is VALID [2018-11-14 18:18:34,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {1288#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:18:34,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {1288#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1288#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:18:34,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {1288#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1295#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:34,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {1295#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {1295#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:34,103 INFO L273 TraceCheckUtils]: 23: Hoare triple {1295#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {1295#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:34,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {1295#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {1295#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:34,107 INFO L273 TraceCheckUtils]: 25: Hoare triple {1295#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {1295#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:34,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {1295#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:34,109 INFO L273 TraceCheckUtils]: 27: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:34,114 INFO L273 TraceCheckUtils]: 28: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:34,115 INFO L273 TraceCheckUtils]: 29: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:34,115 INFO L273 TraceCheckUtils]: 30: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:34,116 INFO L273 TraceCheckUtils]: 31: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:34,117 INFO L273 TraceCheckUtils]: 32: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:34,118 INFO L273 TraceCheckUtils]: 33: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1333#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:34,119 INFO L273 TraceCheckUtils]: 34: Hoare triple {1333#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} assume #t~mem38 != 3bv32;havoc #t~mem38; {1227#false} is VALID [2018-11-14 18:18:34,119 INFO L273 TraceCheckUtils]: 35: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2018-11-14 18:18:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:18:34,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 18:18:34,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:18:34,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:18:34,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-14 18:18:34,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:34,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:18:34,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:34,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:18:34,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:18:34,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:18:34,198 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand 6 states. [2018-11-14 18:18:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:35,195 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2018-11-14 18:18:35,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:18:35,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-14 18:18:35,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:18:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2018-11-14 18:18:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:18:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2018-11-14 18:18:35,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 98 transitions. [2018-11-14 18:18:35,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:35,396 INFO L225 Difference]: With dead ends: 91 [2018-11-14 18:18:35,396 INFO L226 Difference]: Without dead ends: 87 [2018-11-14 18:18:35,397 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:18:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-14 18:18:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2018-11-14 18:18:35,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:35,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 73 states. [2018-11-14 18:18:35,424 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 73 states. [2018-11-14 18:18:35,425 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 73 states. [2018-11-14 18:18:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:35,429 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2018-11-14 18:18:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2018-11-14 18:18:35,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:35,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:35,430 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 87 states. [2018-11-14 18:18:35,431 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 87 states. [2018-11-14 18:18:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:35,435 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2018-11-14 18:18:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2018-11-14 18:18:35,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:35,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:35,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:35,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-14 18:18:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2018-11-14 18:18:35,440 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 36 [2018-11-14 18:18:35,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:35,441 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2018-11-14 18:18:35,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:18:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2018-11-14 18:18:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 18:18:35,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:35,442 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:18:35,443 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:35,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:35,443 INFO L82 PathProgramCache]: Analyzing trace with hash -900096467, now seen corresponding path program 1 times [2018-11-14 18:18:35,443 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:35,444 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:18:35,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:35,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:35,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:18:35,686 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:18:35,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:35,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:35,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:35,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 18:18:35,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 18:18:35,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-14 18:18:35,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:35,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:35,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:35,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-14 18:18:35,913 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:35,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {1710#true} call ULTIMATE.init(); {1710#true} is VALID [2018-11-14 18:18:35,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {1710#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1710#true} is VALID [2018-11-14 18:18:35,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {1710#true} assume true; {1710#true} is VALID [2018-11-14 18:18:35,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1710#true} {1710#true} #217#return; {1710#true} is VALID [2018-11-14 18:18:35,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {1710#true} call #t~ret39 := main(); {1710#true} is VALID [2018-11-14 18:18:35,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {1710#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {1710#true} is VALID [2018-11-14 18:18:35,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {1710#true} assume true; {1710#true} is VALID [2018-11-14 18:18:35,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {1710#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {1710#true} is VALID [2018-11-14 18:18:35,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {1710#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {1710#true} is VALID [2018-11-14 18:18:35,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {1710#true} assume true; {1710#true} is VALID [2018-11-14 18:18:35,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {1710#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1710#true} is VALID [2018-11-14 18:18:35,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {1710#true} assume true; {1710#true} is VALID [2018-11-14 18:18:35,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {1710#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {1710#true} is VALID [2018-11-14 18:18:35,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {1710#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {1710#true} is VALID [2018-11-14 18:18:35,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {1710#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {1710#true} is VALID [2018-11-14 18:18:35,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {1710#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {1710#true} is VALID [2018-11-14 18:18:35,937 INFO L273 TraceCheckUtils]: 16: Hoare triple {1710#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1710#true} is VALID [2018-11-14 18:18:35,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {1710#true} assume true; {1710#true} is VALID [2018-11-14 18:18:35,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {1710#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {1710#true} is VALID [2018-11-14 18:18:35,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {1710#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {1772#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:18:35,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {1772#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1772#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:18:35,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {1772#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1779#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:35,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {1779#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {1779#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:35,957 INFO L273 TraceCheckUtils]: 23: Hoare triple {1779#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {1779#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:35,957 INFO L273 TraceCheckUtils]: 24: Hoare triple {1779#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {1779#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:35,959 INFO L273 TraceCheckUtils]: 25: Hoare triple {1779#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {1779#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:35,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {1779#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1795#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:35,964 INFO L273 TraceCheckUtils]: 27: Hoare triple {1795#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1795#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:35,965 INFO L273 TraceCheckUtils]: 28: Hoare triple {1795#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1802#(= (bvadd |main_#t~mem34| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:35,965 INFO L273 TraceCheckUtils]: 29: Hoare triple {1802#(= (bvadd |main_#t~mem34| (_ bv4294967293 32)) (_ bv0 32))} assume !!(#t~mem34 == 1bv32);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {1711#false} is VALID [2018-11-14 18:18:35,966 INFO L273 TraceCheckUtils]: 30: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 18:18:35,966 INFO L273 TraceCheckUtils]: 31: Hoare triple {1711#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1711#false} is VALID [2018-11-14 18:18:35,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {1711#false} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {1711#false} is VALID [2018-11-14 18:18:35,966 INFO L273 TraceCheckUtils]: 33: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 18:18:35,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {1711#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1711#false} is VALID [2018-11-14 18:18:35,967 INFO L273 TraceCheckUtils]: 35: Hoare triple {1711#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {1711#false} is VALID [2018-11-14 18:18:35,967 INFO L273 TraceCheckUtils]: 36: Hoare triple {1711#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1711#false} is VALID [2018-11-14 18:18:35,967 INFO L273 TraceCheckUtils]: 37: Hoare triple {1711#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {1711#false} is VALID [2018-11-14 18:18:35,967 INFO L273 TraceCheckUtils]: 38: Hoare triple {1711#false} assume !false; {1711#false} is VALID [2018-11-14 18:18:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:18:35,971 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:18:35,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:18:35,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:18:35,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-14 18:18:35,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:35,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:18:36,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:36,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:18:36,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:18:36,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:18:36,087 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand 6 states. [2018-11-14 18:18:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:37,130 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2018-11-14 18:18:37,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:18:37,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-14 18:18:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:18:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2018-11-14 18:18:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:18:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2018-11-14 18:18:37,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2018-11-14 18:18:37,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:37,307 INFO L225 Difference]: With dead ends: 97 [2018-11-14 18:18:37,308 INFO L226 Difference]: Without dead ends: 87 [2018-11-14 18:18:37,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:18:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-14 18:18:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2018-11-14 18:18:37,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:37,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 73 states. [2018-11-14 18:18:37,352 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 73 states. [2018-11-14 18:18:37,353 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 73 states. [2018-11-14 18:18:37,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:37,358 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2018-11-14 18:18:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2018-11-14 18:18:37,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:37,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:37,359 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 87 states. [2018-11-14 18:18:37,360 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 87 states. [2018-11-14 18:18:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:37,364 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2018-11-14 18:18:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2018-11-14 18:18:37,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:37,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:37,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:37,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-14 18:18:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2018-11-14 18:18:37,368 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 39 [2018-11-14 18:18:37,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:37,369 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2018-11-14 18:18:37,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:18:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2018-11-14 18:18:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 18:18:37,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:37,370 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:18:37,371 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:37,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:37,371 INFO L82 PathProgramCache]: Analyzing trace with hash -919789794, now seen corresponding path program 1 times [2018-11-14 18:18:37,371 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:37,372 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:18:37,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:37,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:37,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:18:37,640 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:18:37,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:37,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:37,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:37,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 18:18:37,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 18:18:37,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-14 18:18:37,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:37,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:37,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:37,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-14 18:18:37,741 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:37,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {2210#true} call ULTIMATE.init(); {2210#true} is VALID [2018-11-14 18:18:37,761 INFO L273 TraceCheckUtils]: 1: Hoare triple {2210#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2210#true} is VALID [2018-11-14 18:18:37,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {2210#true} assume true; {2210#true} is VALID [2018-11-14 18:18:37,762 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2210#true} {2210#true} #217#return; {2210#true} is VALID [2018-11-14 18:18:37,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {2210#true} call #t~ret39 := main(); {2210#true} is VALID [2018-11-14 18:18:37,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {2210#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {2210#true} is VALID [2018-11-14 18:18:37,762 INFO L273 TraceCheckUtils]: 6: Hoare triple {2210#true} assume true; {2210#true} is VALID [2018-11-14 18:18:37,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {2210#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {2210#true} is VALID [2018-11-14 18:18:37,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {2210#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {2210#true} is VALID [2018-11-14 18:18:37,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {2210#true} assume true; {2210#true} is VALID [2018-11-14 18:18:37,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2210#true} is VALID [2018-11-14 18:18:37,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {2210#true} assume true; {2210#true} is VALID [2018-11-14 18:18:37,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {2210#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {2210#true} is VALID [2018-11-14 18:18:37,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {2210#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {2210#true} is VALID [2018-11-14 18:18:37,764 INFO L273 TraceCheckUtils]: 14: Hoare triple {2210#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {2210#true} is VALID [2018-11-14 18:18:37,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {2210#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {2210#true} is VALID [2018-11-14 18:18:37,764 INFO L273 TraceCheckUtils]: 16: Hoare triple {2210#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2210#true} is VALID [2018-11-14 18:18:37,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {2210#true} assume true; {2210#true} is VALID [2018-11-14 18:18:37,765 INFO L273 TraceCheckUtils]: 18: Hoare triple {2210#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {2210#true} is VALID [2018-11-14 18:18:37,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {2210#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {2272#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:18:37,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {2272#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2272#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:18:37,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {2272#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2279#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:37,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {2279#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {2279#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:37,771 INFO L273 TraceCheckUtils]: 23: Hoare triple {2279#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {2279#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:37,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {2279#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {2279#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:37,774 INFO L273 TraceCheckUtils]: 25: Hoare triple {2279#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {2279#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:37,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {2279#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2295#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:37,776 INFO L273 TraceCheckUtils]: 27: Hoare triple {2295#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {2295#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:37,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {2295#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2295#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:37,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {2295#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {2295#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:37,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {2295#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {2295#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:37,781 INFO L273 TraceCheckUtils]: 31: Hoare triple {2295#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2311#(= (_ bv3 32) |main_#t~mem36|)} is VALID [2018-11-14 18:18:37,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {2311#(= (_ bv3 32) |main_#t~mem36|)} assume !!(#t~mem36 == 2bv32);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {2211#false} is VALID [2018-11-14 18:18:37,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {2211#false} assume true; {2211#false} is VALID [2018-11-14 18:18:37,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {2211#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2211#false} is VALID [2018-11-14 18:18:37,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {2211#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {2211#false} is VALID [2018-11-14 18:18:37,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {2211#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2211#false} is VALID [2018-11-14 18:18:37,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {2211#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {2211#false} is VALID [2018-11-14 18:18:37,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {2211#false} assume !false; {2211#false} is VALID [2018-11-14 18:18:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:18:37,787 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:18:37,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:18:37,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:18:37,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-14 18:18:37,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:37,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:18:37,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:37,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:18:37,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:18:37,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:18:37,860 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand 6 states. [2018-11-14 18:18:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:39,036 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2018-11-14 18:18:39,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:18:39,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-14 18:18:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:18:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2018-11-14 18:18:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:18:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2018-11-14 18:18:39,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 100 transitions. [2018-11-14 18:18:39,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:39,168 INFO L225 Difference]: With dead ends: 94 [2018-11-14 18:18:39,169 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 18:18:39,169 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:18:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 18:18:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2018-11-14 18:18:39,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:39,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 66 states. [2018-11-14 18:18:39,194 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 66 states. [2018-11-14 18:18:39,194 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 66 states. [2018-11-14 18:18:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:39,198 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-14 18:18:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2018-11-14 18:18:39,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:39,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:39,199 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 80 states. [2018-11-14 18:18:39,199 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 80 states. [2018-11-14 18:18:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:39,203 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-14 18:18:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2018-11-14 18:18:39,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:39,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:39,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:39,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 18:18:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2018-11-14 18:18:39,207 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 39 [2018-11-14 18:18:39,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:39,207 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2018-11-14 18:18:39,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:18:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2018-11-14 18:18:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 18:18:39,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:39,209 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, 1] [2018-11-14 18:18:39,209 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:39,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:39,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1445877913, now seen corresponding path program 1 times [2018-11-14 18:18:39,210 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:39,210 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:18:39,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:39,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:39,383 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:18:39,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:39,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:39,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:18:39,396 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:39,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:39,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:39,473 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 13 treesize of output 4 [2018-11-14 18:18:39,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:39,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:18:39,506 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:18:39,508 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:39,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:39,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:39,530 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-14 18:18:39,538 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:39,691 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 18:18:39,697 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:18:39,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:39,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:39,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:18:39,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-14 18:18:39,857 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:40,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {2684#true} call ULTIMATE.init(); {2684#true} is VALID [2018-11-14 18:18:40,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {2684#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2684#true} is VALID [2018-11-14 18:18:40,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {2684#true} assume true; {2684#true} is VALID [2018-11-14 18:18:40,090 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2684#true} {2684#true} #217#return; {2684#true} is VALID [2018-11-14 18:18:40,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {2684#true} call #t~ret39 := main(); {2684#true} is VALID [2018-11-14 18:18:40,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {2684#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {2684#true} is VALID [2018-11-14 18:18:40,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {2684#true} assume true; {2684#true} is VALID [2018-11-14 18:18:40,091 INFO L273 TraceCheckUtils]: 7: Hoare triple {2684#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {2684#true} is VALID [2018-11-14 18:18:40,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {2684#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {2684#true} is VALID [2018-11-14 18:18:40,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {2684#true} assume true; {2684#true} is VALID [2018-11-14 18:18:40,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {2684#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2684#true} is VALID [2018-11-14 18:18:40,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {2684#true} assume true; {2684#true} is VALID [2018-11-14 18:18:40,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {2684#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {2684#true} is VALID [2018-11-14 18:18:40,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {2684#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {2684#true} is VALID [2018-11-14 18:18:40,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {2684#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {2684#true} is VALID [2018-11-14 18:18:40,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {2684#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {2684#true} is VALID [2018-11-14 18:18:40,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {2684#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2684#true} is VALID [2018-11-14 18:18:40,093 INFO L273 TraceCheckUtils]: 17: Hoare triple {2684#true} assume true; {2684#true} is VALID [2018-11-14 18:18:40,093 INFO L273 TraceCheckUtils]: 18: Hoare triple {2684#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {2684#true} is VALID [2018-11-14 18:18:40,097 INFO L273 TraceCheckUtils]: 19: Hoare triple {2684#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {2746#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:18:40,099 INFO L273 TraceCheckUtils]: 20: Hoare triple {2746#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2746#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:18:40,099 INFO L273 TraceCheckUtils]: 21: Hoare triple {2746#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2753#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:40,100 INFO L273 TraceCheckUtils]: 22: Hoare triple {2753#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {2753#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:40,101 INFO L273 TraceCheckUtils]: 23: Hoare triple {2753#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {2753#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:40,102 INFO L273 TraceCheckUtils]: 24: Hoare triple {2753#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {2753#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:40,104 INFO L273 TraceCheckUtils]: 25: Hoare triple {2753#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {2766#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:40,105 INFO L273 TraceCheckUtils]: 26: Hoare triple {2766#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2766#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:40,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {2766#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {2773#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:40,108 INFO L273 TraceCheckUtils]: 28: Hoare triple {2773#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {2773#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:40,109 INFO L273 TraceCheckUtils]: 29: Hoare triple {2773#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {2773#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:40,111 INFO L273 TraceCheckUtils]: 30: Hoare triple {2773#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2783#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:40,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {2783#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} assume true; {2783#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:40,114 INFO L273 TraceCheckUtils]: 32: Hoare triple {2783#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2783#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:40,115 INFO L273 TraceCheckUtils]: 33: Hoare triple {2783#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {2783#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:40,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {2783#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} assume true; {2783#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:40,118 INFO L273 TraceCheckUtils]: 35: Hoare triple {2783#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2799#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem36|))} is VALID [2018-11-14 18:18:40,119 INFO L273 TraceCheckUtils]: 36: Hoare triple {2799#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem36|))} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {2685#false} is VALID [2018-11-14 18:18:40,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {2685#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2685#false} is VALID [2018-11-14 18:18:40,119 INFO L273 TraceCheckUtils]: 38: Hoare triple {2685#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {2685#false} is VALID [2018-11-14 18:18:40,120 INFO L273 TraceCheckUtils]: 39: Hoare triple {2685#false} assume !false; {2685#false} is VALID [2018-11-14 18:18:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:18:40,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:18:40,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-14 18:18:40,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:18:40,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:40,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-14 18:18:40,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-14 18:18:40,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:40,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:40,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2018-11-14 18:18:40,559 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 17 treesize of output 15 [2018-11-14 18:18:40,561 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:40,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-14 18:18:40,585 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:40,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-14 18:18:40,613 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:40,621 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:40,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:18:40,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 18:18:40,661 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:40, output treesize:27 [2018-11-14 18:18:40,669 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:40,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {2685#false} assume !false; {2685#false} is VALID [2018-11-14 18:18:40,878 INFO L273 TraceCheckUtils]: 38: Hoare triple {2685#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {2685#false} is VALID [2018-11-14 18:18:40,879 INFO L273 TraceCheckUtils]: 37: Hoare triple {2685#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2685#false} is VALID [2018-11-14 18:18:40,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {2821#(= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32))} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {2685#false} is VALID [2018-11-14 18:18:40,882 INFO L273 TraceCheckUtils]: 35: Hoare triple {2825#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2821#(= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:40,882 INFO L273 TraceCheckUtils]: 34: Hoare triple {2825#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {2825#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:40,882 INFO L273 TraceCheckUtils]: 33: Hoare triple {2825#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {2825#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:40,883 INFO L273 TraceCheckUtils]: 32: Hoare triple {2825#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2825#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:40,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {2825#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {2825#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:40,885 INFO L273 TraceCheckUtils]: 30: Hoare triple {2841#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2825#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:40,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {2841#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {2841#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:40,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {2841#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} assume true; {2841#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:40,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {2851#(forall ((v_subst_1 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_1 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {2841#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:40,892 INFO L273 TraceCheckUtils]: 26: Hoare triple {2851#(forall ((v_subst_1 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_1 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2851#(forall ((v_subst_1 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_1 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:40,894 INFO L273 TraceCheckUtils]: 25: Hoare triple {2858#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {2851#(forall ((v_subst_1 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_1 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:40,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {2858#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume true; {2858#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-14 18:18:40,898 INFO L273 TraceCheckUtils]: 23: Hoare triple {2858#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {2858#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-14 18:18:40,902 INFO L273 TraceCheckUtils]: 22: Hoare triple {2858#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume true; {2858#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-14 18:18:40,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {2871#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2858#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-14 18:18:40,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {2871#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2871#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-14 18:18:40,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {2684#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {2871#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-14 18:18:40,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {2684#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {2684#true} is VALID [2018-11-14 18:18:40,911 INFO L273 TraceCheckUtils]: 17: Hoare triple {2684#true} assume true; {2684#true} is VALID [2018-11-14 18:18:40,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {2684#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2684#true} is VALID [2018-11-14 18:18:40,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {2684#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {2684#true} is VALID [2018-11-14 18:18:40,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {2684#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {2684#true} is VALID [2018-11-14 18:18:40,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {2684#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {2684#true} is VALID [2018-11-14 18:18:40,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {2684#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {2684#true} is VALID [2018-11-14 18:18:40,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {2684#true} assume true; {2684#true} is VALID [2018-11-14 18:18:40,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {2684#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2684#true} is VALID [2018-11-14 18:18:40,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {2684#true} assume true; {2684#true} is VALID [2018-11-14 18:18:40,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {2684#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {2684#true} is VALID [2018-11-14 18:18:40,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {2684#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {2684#true} is VALID [2018-11-14 18:18:40,914 INFO L273 TraceCheckUtils]: 6: Hoare triple {2684#true} assume true; {2684#true} is VALID [2018-11-14 18:18:40,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {2684#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {2684#true} is VALID [2018-11-14 18:18:40,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {2684#true} call #t~ret39 := main(); {2684#true} is VALID [2018-11-14 18:18:40,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2684#true} {2684#true} #217#return; {2684#true} is VALID [2018-11-14 18:18:40,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {2684#true} assume true; {2684#true} is VALID [2018-11-14 18:18:40,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {2684#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2684#true} is VALID [2018-11-14 18:18:40,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {2684#true} call ULTIMATE.init(); {2684#true} is VALID [2018-11-14 18:18:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:18:40,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:18:40,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 18:18:40,920 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-14 18:18:40,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:40,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:18:41,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:41,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:18:41,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:18:41,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:18:41,013 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 14 states. [2018-11-14 18:18:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:44,463 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2018-11-14 18:18:44,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:18:44,463 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-14 18:18:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:18:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2018-11-14 18:18:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:18:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2018-11-14 18:18:44,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 113 transitions. [2018-11-14 18:18:44,738 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:18:44,740 INFO L225 Difference]: With dead ends: 105 [2018-11-14 18:18:44,740 INFO L226 Difference]: Without dead ends: 101 [2018-11-14 18:18:44,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:18:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-14 18:18:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 77. [2018-11-14 18:18:44,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:44,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 77 states. [2018-11-14 18:18:44,803 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 77 states. [2018-11-14 18:18:44,803 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 77 states. [2018-11-14 18:18:44,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:44,807 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2018-11-14 18:18:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2018-11-14 18:18:44,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:44,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:44,808 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 101 states. [2018-11-14 18:18:44,808 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 101 states. [2018-11-14 18:18:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:44,812 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2018-11-14 18:18:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2018-11-14 18:18:44,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:44,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:44,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:44,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 18:18:44,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2018-11-14 18:18:44,816 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 40 [2018-11-14 18:18:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:44,817 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2018-11-14 18:18:44,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:18:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2018-11-14 18:18:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 18:18:44,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:44,818 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, 1] [2018-11-14 18:18:44,818 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:44,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:44,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2053753959, now seen corresponding path program 1 times [2018-11-14 18:18:44,819 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:44,819 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:18:44,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:44,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:44,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 18:18:45,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:45,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:45,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:18:45,013 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:45,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:45,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:45,106 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 13 treesize of output 4 [2018-11-14 18:18:45,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:45,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:18:45,149 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:18:45,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:45,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:45,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:45,173 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-14 18:18:45,182 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:45,292 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 18:18:45,343 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:18:45,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:45,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:45,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:18:45,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-14 18:18:45,592 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:45,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {3365#true} call ULTIMATE.init(); {3365#true} is VALID [2018-11-14 18:18:45,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {3365#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3365#true} is VALID [2018-11-14 18:18:45,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {3365#true} assume true; {3365#true} is VALID [2018-11-14 18:18:45,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3365#true} {3365#true} #217#return; {3365#true} is VALID [2018-11-14 18:18:45,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {3365#true} call #t~ret39 := main(); {3365#true} is VALID [2018-11-14 18:18:45,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {3365#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {3365#true} is VALID [2018-11-14 18:18:45,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {3365#true} assume true; {3365#true} is VALID [2018-11-14 18:18:45,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {3365#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {3365#true} is VALID [2018-11-14 18:18:45,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {3365#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {3365#true} is VALID [2018-11-14 18:18:45,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {3365#true} assume true; {3365#true} is VALID [2018-11-14 18:18:45,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {3365#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {3365#true} is VALID [2018-11-14 18:18:45,716 INFO L273 TraceCheckUtils]: 11: Hoare triple {3365#true} assume true; {3365#true} is VALID [2018-11-14 18:18:45,716 INFO L273 TraceCheckUtils]: 12: Hoare triple {3365#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {3365#true} is VALID [2018-11-14 18:18:45,716 INFO L273 TraceCheckUtils]: 13: Hoare triple {3365#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {3365#true} is VALID [2018-11-14 18:18:45,716 INFO L273 TraceCheckUtils]: 14: Hoare triple {3365#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {3365#true} is VALID [2018-11-14 18:18:45,717 INFO L273 TraceCheckUtils]: 15: Hoare triple {3365#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {3365#true} is VALID [2018-11-14 18:18:45,717 INFO L273 TraceCheckUtils]: 16: Hoare triple {3365#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {3365#true} is VALID [2018-11-14 18:18:45,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {3365#true} assume true; {3365#true} is VALID [2018-11-14 18:18:45,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {3365#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {3365#true} is VALID [2018-11-14 18:18:45,718 INFO L273 TraceCheckUtils]: 19: Hoare triple {3365#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {3427#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:18:45,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {3427#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {3427#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:18:45,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {3427#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3434#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:45,720 INFO L273 TraceCheckUtils]: 22: Hoare triple {3434#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {3434#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:45,721 INFO L273 TraceCheckUtils]: 23: Hoare triple {3434#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet28 != 0bv32);havoc #t~nondet28;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc29.base, #t~malloc29.offset; {3441#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:45,722 INFO L273 TraceCheckUtils]: 24: Hoare triple {3441#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {3441#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:45,724 INFO L273 TraceCheckUtils]: 25: Hoare triple {3441#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset; {3448#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:45,725 INFO L273 TraceCheckUtils]: 26: Hoare triple {3448#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {3448#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:45,726 INFO L273 TraceCheckUtils]: 27: Hoare triple {3448#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {3448#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:45,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {3448#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {3448#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:45,728 INFO L273 TraceCheckUtils]: 29: Hoare triple {3448#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {3448#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:18:45,730 INFO L273 TraceCheckUtils]: 30: Hoare triple {3448#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3464#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:45,732 INFO L273 TraceCheckUtils]: 31: Hoare triple {3464#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3464#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:45,733 INFO L273 TraceCheckUtils]: 32: Hoare triple {3464#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3471#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem34|))} is VALID [2018-11-14 18:18:45,734 INFO L273 TraceCheckUtils]: 33: Hoare triple {3471#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem34|))} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {3366#false} is VALID [2018-11-14 18:18:45,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {3366#false} assume true; {3366#false} is VALID [2018-11-14 18:18:45,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {3366#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3366#false} is VALID [2018-11-14 18:18:45,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {3366#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {3366#false} is VALID [2018-11-14 18:18:45,735 INFO L273 TraceCheckUtils]: 37: Hoare triple {3366#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3366#false} is VALID [2018-11-14 18:18:45,735 INFO L273 TraceCheckUtils]: 38: Hoare triple {3366#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {3366#false} is VALID [2018-11-14 18:18:45,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {3366#false} assume !false; {3366#false} is VALID [2018-11-14 18:18:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:18:45,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:18:46,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-14 18:18:46,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:18:46,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:46,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-11-14 18:18:46,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-14 18:18:46,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:46,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-14 18:18:46,137 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:46,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-14 18:18:46,155 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:46,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:46,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-14 18:18:46,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-14 18:18:46,175 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:46,182 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:46,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:18:46,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 18:18:46,225 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:40, output treesize:27 [2018-11-14 18:18:46,233 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:46,388 INFO L273 TraceCheckUtils]: 39: Hoare triple {3366#false} assume !false; {3366#false} is VALID [2018-11-14 18:18:46,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {3366#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {3366#false} is VALID [2018-11-14 18:18:46,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {3366#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3366#false} is VALID [2018-11-14 18:18:46,388 INFO L273 TraceCheckUtils]: 36: Hoare triple {3366#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {3366#false} is VALID [2018-11-14 18:18:46,388 INFO L273 TraceCheckUtils]: 35: Hoare triple {3366#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3366#false} is VALID [2018-11-14 18:18:46,389 INFO L273 TraceCheckUtils]: 34: Hoare triple {3366#false} assume true; {3366#false} is VALID [2018-11-14 18:18:46,389 INFO L273 TraceCheckUtils]: 33: Hoare triple {3511#(= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32))} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {3366#false} is VALID [2018-11-14 18:18:46,390 INFO L273 TraceCheckUtils]: 32: Hoare triple {3515#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3511#(= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:46,390 INFO L273 TraceCheckUtils]: 31: Hoare triple {3515#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} assume true; {3515#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:46,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {3522#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3515#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:46,392 INFO L273 TraceCheckUtils]: 29: Hoare triple {3522#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {3522#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:46,393 INFO L273 TraceCheckUtils]: 28: Hoare triple {3522#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3522#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:46,393 INFO L273 TraceCheckUtils]: 27: Hoare triple {3522#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {3522#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:46,394 INFO L273 TraceCheckUtils]: 26: Hoare triple {3522#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3522#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:46,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {3538#(forall ((v_subst_2 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_2 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset; {3522#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:46,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {3538#(forall ((v_subst_2 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_2 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {3538#(forall ((v_subst_2 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_2 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:46,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {3545#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_4 (_ BitVec 32))) (not (= (select |#valid| v_prenex_4) (_ bv0 1))))) (or (forall ((v_main_~t~0.base_12 (_ BitVec 32))) (not (= (select |#valid| v_main_~t~0.base_12) (_ bv0 1)))) (= main_~a~0.offset main_~p~0.offset)))} assume !!(#t~nondet28 != 0bv32);havoc #t~nondet28;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc29.base, #t~malloc29.offset; {3538#(forall ((v_subst_2 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) v_subst_2 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:46,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {3545#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_4 (_ BitVec 32))) (not (= (select |#valid| v_prenex_4) (_ bv0 1))))) (or (forall ((v_main_~t~0.base_12 (_ BitVec 32))) (not (= (select |#valid| v_main_~t~0.base_12) (_ bv0 1)))) (= main_~a~0.offset main_~p~0.offset)))} assume true; {3545#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_4 (_ BitVec 32))) (not (= (select |#valid| v_prenex_4) (_ bv0 1))))) (or (forall ((v_main_~t~0.base_12 (_ BitVec 32))) (not (= (select |#valid| v_main_~t~0.base_12) (_ bv0 1)))) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2018-11-14 18:18:46,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {3552#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3545#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_4 (_ BitVec 32))) (not (= (select |#valid| v_prenex_4) (_ bv0 1))))) (or (forall ((v_main_~t~0.base_12 (_ BitVec 32))) (not (= (select |#valid| v_main_~t~0.base_12) (_ bv0 1)))) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2018-11-14 18:18:46,403 INFO L273 TraceCheckUtils]: 20: Hoare triple {3552#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {3552#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-14 18:18:46,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {3365#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {3552#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-14 18:18:46,404 INFO L273 TraceCheckUtils]: 18: Hoare triple {3365#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {3365#true} is VALID [2018-11-14 18:18:46,404 INFO L273 TraceCheckUtils]: 17: Hoare triple {3365#true} assume true; {3365#true} is VALID [2018-11-14 18:18:46,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {3365#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {3365#true} is VALID [2018-11-14 18:18:46,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {3365#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {3365#true} is VALID [2018-11-14 18:18:46,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {3365#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {3365#true} is VALID [2018-11-14 18:18:46,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {3365#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {3365#true} is VALID [2018-11-14 18:18:46,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {3365#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {3365#true} is VALID [2018-11-14 18:18:46,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {3365#true} assume true; {3365#true} is VALID [2018-11-14 18:18:46,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {3365#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {3365#true} is VALID [2018-11-14 18:18:46,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {3365#true} assume true; {3365#true} is VALID [2018-11-14 18:18:46,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {3365#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {3365#true} is VALID [2018-11-14 18:18:46,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {3365#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {3365#true} is VALID [2018-11-14 18:18:46,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {3365#true} assume true; {3365#true} is VALID [2018-11-14 18:18:46,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {3365#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {3365#true} is VALID [2018-11-14 18:18:46,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {3365#true} call #t~ret39 := main(); {3365#true} is VALID [2018-11-14 18:18:46,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3365#true} {3365#true} #217#return; {3365#true} is VALID [2018-11-14 18:18:46,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {3365#true} assume true; {3365#true} is VALID [2018-11-14 18:18:46,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {3365#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3365#true} is VALID [2018-11-14 18:18:46,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {3365#true} call ULTIMATE.init(); {3365#true} is VALID [2018-11-14 18:18:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:18:46,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:18:46,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 18:18:46,415 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-14 18:18:46,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:46,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:18:46,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:46,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:18:46,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:18:46,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:18:46,558 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand 14 states. [2018-11-14 18:18:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:50,592 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2018-11-14 18:18:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:18:50,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-14 18:18:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:18:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2018-11-14 18:18:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:18:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2018-11-14 18:18:50,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 109 transitions. [2018-11-14 18:18:50,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:50,822 INFO L225 Difference]: With dead ends: 101 [2018-11-14 18:18:50,822 INFO L226 Difference]: Without dead ends: 94 [2018-11-14 18:18:50,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:18:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-14 18:18:50,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2018-11-14 18:18:50,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:50,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 80 states. [2018-11-14 18:18:50,877 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 80 states. [2018-11-14 18:18:50,877 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 80 states. [2018-11-14 18:18:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:50,881 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-11-14 18:18:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2018-11-14 18:18:50,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:50,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:50,882 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 94 states. [2018-11-14 18:18:50,882 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 94 states. [2018-11-14 18:18:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:50,886 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-11-14 18:18:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2018-11-14 18:18:50,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:50,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:50,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:50,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:18:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2018-11-14 18:18:50,889 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 40 [2018-11-14 18:18:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:50,890 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2018-11-14 18:18:50,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:18:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2018-11-14 18:18:50,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 18:18:50,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:50,891 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:18:50,891 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:50,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:50,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1390456421, now seen corresponding path program 1 times [2018-11-14 18:18:50,891 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:50,892 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:18:50,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:50,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:51,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 18:18:51,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:18:51,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 18:18:51,200 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 10 treesize of output 9 [2018-11-14 18:18:51,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2018-11-14 18:18:51,259 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:51,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-14 18:18:51,309 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 16 treesize of output 15 [2018-11-14 18:18:51,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2018-11-14 18:18:51,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-14 18:18:51,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-14 18:18:51,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-14 18:18:51,489 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 17 treesize of output 9 [2018-11-14 18:18:51,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,503 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-11-14 18:18:51,506 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:51,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:18:51,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:18:51,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-14 18:18:51,546 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:51,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {4030#true} call ULTIMATE.init(); {4030#true} is VALID [2018-11-14 18:18:51,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {4030#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4030#true} is VALID [2018-11-14 18:18:51,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {4030#true} assume true; {4030#true} is VALID [2018-11-14 18:18:51,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4030#true} {4030#true} #217#return; {4030#true} is VALID [2018-11-14 18:18:51,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {4030#true} call #t~ret39 := main(); {4030#true} is VALID [2018-11-14 18:18:51,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {4030#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {4030#true} is VALID [2018-11-14 18:18:51,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {4030#true} assume true; {4030#true} is VALID [2018-11-14 18:18:51,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {4030#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {4030#true} is VALID [2018-11-14 18:18:51,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {4030#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {4030#true} is VALID [2018-11-14 18:18:51,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {4030#true} assume true; {4030#true} is VALID [2018-11-14 18:18:51,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {4030#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4030#true} is VALID [2018-11-14 18:18:51,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {4030#true} assume true; {4030#true} is VALID [2018-11-14 18:18:51,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {4030#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {4030#true} is VALID [2018-11-14 18:18:51,562 INFO L273 TraceCheckUtils]: 13: Hoare triple {4030#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {4030#true} is VALID [2018-11-14 18:18:51,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {4030#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {4030#true} is VALID [2018-11-14 18:18:51,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {4030#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {4030#true} is VALID [2018-11-14 18:18:51,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {4030#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4030#true} is VALID [2018-11-14 18:18:51,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {4030#true} assume true; {4030#true} is VALID [2018-11-14 18:18:51,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {4030#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {4030#true} is VALID [2018-11-14 18:18:51,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {4030#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {4092#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:18:51,563 INFO L273 TraceCheckUtils]: 20: Hoare triple {4092#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {4092#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:18:51,564 INFO L273 TraceCheckUtils]: 21: Hoare triple {4092#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:51,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:51,564 INFO L273 TraceCheckUtils]: 23: Hoare triple {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:51,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:51,565 INFO L273 TraceCheckUtils]: 25: Hoare triple {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:51,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:51,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {4099#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {4118#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:51,571 INFO L273 TraceCheckUtils]: 28: Hoare triple {4118#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {4118#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:51,571 INFO L273 TraceCheckUtils]: 29: Hoare triple {4118#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {4118#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:51,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {4118#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4128#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:51,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {4128#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {4128#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:51,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {4128#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4128#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:51,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {4128#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume !!(#t~mem34 == 1bv32);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:51,576 INFO L273 TraceCheckUtils]: 34: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:51,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:51,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:51,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:51,578 INFO L273 TraceCheckUtils]: 38: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:51,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:51,579 INFO L273 TraceCheckUtils]: 40: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4160#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:51,579 INFO L273 TraceCheckUtils]: 41: Hoare triple {4160#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} assume #t~mem38 != 3bv32;havoc #t~mem38; {4031#false} is VALID [2018-11-14 18:18:51,579 INFO L273 TraceCheckUtils]: 42: Hoare triple {4031#false} assume !false; {4031#false} is VALID [2018-11-14 18:18:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:18:51,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:18:51,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-14 18:18:51,722 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 13 treesize of output 5 [2018-11-14 18:18:51,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:51,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-11-14 18:18:51,747 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:51,934 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 13 treesize of output 11 [2018-11-14 18:18:51,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-14 18:18:51,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-11-14 18:18:51,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-14 18:18:51,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:51,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:51,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-11-14 18:18:51,995 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:52,045 INFO L273 TraceCheckUtils]: 42: Hoare triple {4031#false} assume !false; {4031#false} is VALID [2018-11-14 18:18:52,045 INFO L273 TraceCheckUtils]: 41: Hoare triple {4160#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} assume #t~mem38 != 3bv32;havoc #t~mem38; {4031#false} is VALID [2018-11-14 18:18:52,046 INFO L273 TraceCheckUtils]: 40: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4160#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:52,046 INFO L273 TraceCheckUtils]: 39: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:52,047 INFO L273 TraceCheckUtils]: 38: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:52,047 INFO L273 TraceCheckUtils]: 37: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:52,048 INFO L273 TraceCheckUtils]: 36: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:52,048 INFO L273 TraceCheckUtils]: 35: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:52,049 INFO L273 TraceCheckUtils]: 34: Hoare triple {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:52,051 INFO L273 TraceCheckUtils]: 33: Hoare triple {4194#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume !!(#t~mem34 == 1bv32);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4138#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:52,051 INFO L273 TraceCheckUtils]: 32: Hoare triple {4194#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4194#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:52,052 INFO L273 TraceCheckUtils]: 31: Hoare triple {4194#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume true; {4194#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:52,053 INFO L273 TraceCheckUtils]: 30: Hoare triple {4204#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4194#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:52,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {4204#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {4204#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:52,054 INFO L273 TraceCheckUtils]: 28: Hoare triple {4204#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {4204#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:52,056 INFO L273 TraceCheckUtils]: 27: Hoare triple {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {4204#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:52,056 INFO L273 TraceCheckUtils]: 26: Hoare triple {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:52,057 INFO L273 TraceCheckUtils]: 25: Hoare triple {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:52,058 INFO L273 TraceCheckUtils]: 24: Hoare triple {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:52,059 INFO L273 TraceCheckUtils]: 23: Hoare triple {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:52,059 INFO L273 TraceCheckUtils]: 22: Hoare triple {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:52,060 INFO L273 TraceCheckUtils]: 21: Hoare triple {4030#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4214#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:52,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {4030#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {4030#true} is VALID [2018-11-14 18:18:52,061 INFO L273 TraceCheckUtils]: 19: Hoare triple {4030#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {4030#true} is VALID [2018-11-14 18:18:52,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {4030#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {4030#true} is VALID [2018-11-14 18:18:52,061 INFO L273 TraceCheckUtils]: 17: Hoare triple {4030#true} assume true; {4030#true} is VALID [2018-11-14 18:18:52,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {4030#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4030#true} is VALID [2018-11-14 18:18:52,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {4030#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {4030#true} is VALID [2018-11-14 18:18:52,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {4030#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {4030#true} is VALID [2018-11-14 18:18:52,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {4030#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {4030#true} is VALID [2018-11-14 18:18:52,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {4030#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {4030#true} is VALID [2018-11-14 18:18:52,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {4030#true} assume true; {4030#true} is VALID [2018-11-14 18:18:52,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {4030#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4030#true} is VALID [2018-11-14 18:18:52,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {4030#true} assume true; {4030#true} is VALID [2018-11-14 18:18:52,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {4030#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {4030#true} is VALID [2018-11-14 18:18:52,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {4030#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {4030#true} is VALID [2018-11-14 18:18:52,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {4030#true} assume true; {4030#true} is VALID [2018-11-14 18:18:52,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {4030#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {4030#true} is VALID [2018-11-14 18:18:52,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {4030#true} call #t~ret39 := main(); {4030#true} is VALID [2018-11-14 18:18:52,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4030#true} {4030#true} #217#return; {4030#true} is VALID [2018-11-14 18:18:52,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {4030#true} assume true; {4030#true} is VALID [2018-11-14 18:18:52,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {4030#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4030#true} is VALID [2018-11-14 18:18:52,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {4030#true} call ULTIMATE.init(); {4030#true} is VALID [2018-11-14 18:18:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:18:52,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:18:52,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-14 18:18:52,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-14 18:18:52,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:52,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:18:52,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:52,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:18:52,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:18:52,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:18:52,153 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand 11 states. [2018-11-14 18:18:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:55,749 INFO L93 Difference]: Finished difference Result 127 states and 156 transitions. [2018-11-14 18:18:55,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:18:55,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-14 18:18:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:18:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2018-11-14 18:18:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:18:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2018-11-14 18:18:55,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 121 transitions. [2018-11-14 18:18:56,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:56,352 INFO L225 Difference]: With dead ends: 127 [2018-11-14 18:18:56,352 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 18:18:56,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:18:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 18:18:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2018-11-14 18:18:56,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:56,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 101 states. [2018-11-14 18:18:56,431 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 101 states. [2018-11-14 18:18:56,431 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 101 states. [2018-11-14 18:18:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:56,436 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2018-11-14 18:18:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 152 transitions. [2018-11-14 18:18:56,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:56,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:56,437 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 123 states. [2018-11-14 18:18:56,437 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 123 states. [2018-11-14 18:18:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:56,442 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2018-11-14 18:18:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 152 transitions. [2018-11-14 18:18:56,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:56,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:56,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:56,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 18:18:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2018-11-14 18:18:56,446 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 43 [2018-11-14 18:18:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:56,447 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2018-11-14 18:18:56,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:18:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2018-11-14 18:18:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 18:18:56,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:56,448 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:18:56,448 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:56,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:56,448 INFO L82 PathProgramCache]: Analyzing trace with hash -403770087, now seen corresponding path program 2 times [2018-11-14 18:18:56,449 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:56,449 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:18:56,470 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:18:56,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:18:56,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:18:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:56,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:56,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 18:18:56,675 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 10 treesize of output 9 [2018-11-14 18:18:56,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-11-14 18:18:56,743 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:56,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-14 18:18:56,804 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 16 treesize of output 15 [2018-11-14 18:18:56,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2018-11-14 18:18:56,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-14 18:18:56,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-14 18:18:56,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-14 18:18:56,905 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 17 treesize of output 9 [2018-11-14 18:18:56,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-11-14 18:18:56,918 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:56,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:18:56,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:18:56,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:56,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-14 18:18:56,959 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:56,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {4816#true} call ULTIMATE.init(); {4816#true} is VALID [2018-11-14 18:18:56,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {4816#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4816#true} is VALID [2018-11-14 18:18:56,976 INFO L273 TraceCheckUtils]: 2: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-14 18:18:56,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4816#true} {4816#true} #217#return; {4816#true} is VALID [2018-11-14 18:18:56,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {4816#true} call #t~ret39 := main(); {4816#true} is VALID [2018-11-14 18:18:56,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {4816#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {4816#true} is VALID [2018-11-14 18:18:56,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-14 18:18:56,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {4816#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {4816#true} is VALID [2018-11-14 18:18:56,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {4816#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {4816#true} is VALID [2018-11-14 18:18:56,977 INFO L273 TraceCheckUtils]: 9: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-14 18:18:56,977 INFO L273 TraceCheckUtils]: 10: Hoare triple {4816#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4816#true} is VALID [2018-11-14 18:18:56,978 INFO L273 TraceCheckUtils]: 11: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-14 18:18:56,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {4816#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {4816#true} is VALID [2018-11-14 18:18:56,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {4816#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {4816#true} is VALID [2018-11-14 18:18:56,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {4816#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {4816#true} is VALID [2018-11-14 18:18:56,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {4816#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {4816#true} is VALID [2018-11-14 18:18:56,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {4816#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4816#true} is VALID [2018-11-14 18:18:56,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-14 18:18:56,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {4816#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {4816#true} is VALID [2018-11-14 18:18:56,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {4816#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {4878#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:18:56,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {4878#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {4878#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:18:56,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {4878#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:56,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:56,981 INFO L273 TraceCheckUtils]: 23: Hoare triple {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:56,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:56,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:56,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:18:56,984 INFO L273 TraceCheckUtils]: 27: Hoare triple {4885#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {4904#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:56,985 INFO L273 TraceCheckUtils]: 28: Hoare triple {4904#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {4904#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:56,985 INFO L273 TraceCheckUtils]: 29: Hoare triple {4904#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {4904#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:56,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {4904#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4914#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:56,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {4914#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {4914#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:56,989 INFO L273 TraceCheckUtils]: 32: Hoare triple {4914#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4914#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:56,991 INFO L273 TraceCheckUtils]: 33: Hoare triple {4914#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume !!(#t~mem34 == 1bv32);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4924#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:56,992 INFO L273 TraceCheckUtils]: 34: Hoare triple {4924#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {4924#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:18:56,993 INFO L273 TraceCheckUtils]: 35: Hoare triple {4924#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4931#(= (bvadd |main_#t~mem34| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:18:56,993 INFO L273 TraceCheckUtils]: 36: Hoare triple {4931#(= (bvadd |main_#t~mem34| (_ bv4294967293 32)) (_ bv0 32))} assume !!(#t~mem34 == 1bv32);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4817#false} is VALID [2018-11-14 18:18:56,994 INFO L273 TraceCheckUtils]: 37: Hoare triple {4817#false} assume true; {4817#false} is VALID [2018-11-14 18:18:56,994 INFO L273 TraceCheckUtils]: 38: Hoare triple {4817#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4817#false} is VALID [2018-11-14 18:18:56,994 INFO L273 TraceCheckUtils]: 39: Hoare triple {4817#false} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {4817#false} is VALID [2018-11-14 18:18:56,994 INFO L273 TraceCheckUtils]: 40: Hoare triple {4817#false} assume true; {4817#false} is VALID [2018-11-14 18:18:56,995 INFO L273 TraceCheckUtils]: 41: Hoare triple {4817#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4817#false} is VALID [2018-11-14 18:18:56,995 INFO L273 TraceCheckUtils]: 42: Hoare triple {4817#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {4817#false} is VALID [2018-11-14 18:18:56,995 INFO L273 TraceCheckUtils]: 43: Hoare triple {4817#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4817#false} is VALID [2018-11-14 18:18:56,995 INFO L273 TraceCheckUtils]: 44: Hoare triple {4817#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {4817#false} is VALID [2018-11-14 18:18:56,995 INFO L273 TraceCheckUtils]: 45: Hoare triple {4817#false} assume !false; {4817#false} is VALID [2018-11-14 18:18:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:18:56,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:18:57,122 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 30 treesize of output 22 [2018-11-14 18:18:57,129 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 12 treesize of output 1 [2018-11-14 18:18:57,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:57,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:57,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-14 18:18:57,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-14 18:18:57,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:57,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:57,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:57,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-11-14 18:18:57,179 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:57,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2018-11-14 18:18:57,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:18:57,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:57,640 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 11 [2018-11-14 18:18:57,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:57,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:57,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:57,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:11 [2018-11-14 18:18:57,889 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:57,946 INFO L273 TraceCheckUtils]: 45: Hoare triple {4817#false} assume !false; {4817#false} is VALID [2018-11-14 18:18:57,946 INFO L273 TraceCheckUtils]: 44: Hoare triple {4817#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {4817#false} is VALID [2018-11-14 18:18:57,947 INFO L273 TraceCheckUtils]: 43: Hoare triple {4817#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4817#false} is VALID [2018-11-14 18:18:57,947 INFO L273 TraceCheckUtils]: 42: Hoare triple {4817#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {4817#false} is VALID [2018-11-14 18:18:57,947 INFO L273 TraceCheckUtils]: 41: Hoare triple {4817#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4817#false} is VALID [2018-11-14 18:18:57,947 INFO L273 TraceCheckUtils]: 40: Hoare triple {4817#false} assume true; {4817#false} is VALID [2018-11-14 18:18:57,948 INFO L273 TraceCheckUtils]: 39: Hoare triple {4817#false} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {4817#false} is VALID [2018-11-14 18:18:57,948 INFO L273 TraceCheckUtils]: 38: Hoare triple {4817#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4817#false} is VALID [2018-11-14 18:18:57,948 INFO L273 TraceCheckUtils]: 37: Hoare triple {4817#false} assume true; {4817#false} is VALID [2018-11-14 18:18:57,949 INFO L273 TraceCheckUtils]: 36: Hoare triple {4989#(not (= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32)))} assume !!(#t~mem34 == 1bv32);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4817#false} is VALID [2018-11-14 18:18:57,949 INFO L273 TraceCheckUtils]: 35: Hoare triple {4993#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4989#(not (= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:57,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {4993#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {4993#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:57,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {5000#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(#t~mem34 == 1bv32);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4993#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:57,950 INFO L273 TraceCheckUtils]: 32: Hoare triple {5000#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5000#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:57,951 INFO L273 TraceCheckUtils]: 31: Hoare triple {5000#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {5000#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:57,952 INFO L273 TraceCheckUtils]: 30: Hoare triple {5010#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5000#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:57,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {5010#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {5010#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:57,954 INFO L273 TraceCheckUtils]: 28: Hoare triple {5010#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {5010#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:57,955 INFO L273 TraceCheckUtils]: 27: Hoare triple {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {5010#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:18:57,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:57,957 INFO L273 TraceCheckUtils]: 25: Hoare triple {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:57,957 INFO L273 TraceCheckUtils]: 24: Hoare triple {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:57,973 INFO L273 TraceCheckUtils]: 23: Hoare triple {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:57,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:57,974 INFO L273 TraceCheckUtils]: 21: Hoare triple {4816#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5020#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:18:57,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {4816#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {4816#true} is VALID [2018-11-14 18:18:57,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {4816#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {4816#true} is VALID [2018-11-14 18:18:57,975 INFO L273 TraceCheckUtils]: 18: Hoare triple {4816#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {4816#true} is VALID [2018-11-14 18:18:57,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-14 18:18:57,975 INFO L273 TraceCheckUtils]: 16: Hoare triple {4816#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4816#true} is VALID [2018-11-14 18:18:57,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {4816#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {4816#true} is VALID [2018-11-14 18:18:57,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {4816#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {4816#true} is VALID [2018-11-14 18:18:57,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {4816#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {4816#true} is VALID [2018-11-14 18:18:57,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {4816#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {4816#true} is VALID [2018-11-14 18:18:57,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-14 18:18:57,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {4816#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4816#true} is VALID [2018-11-14 18:18:57,976 INFO L273 TraceCheckUtils]: 9: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-14 18:18:57,976 INFO L273 TraceCheckUtils]: 8: Hoare triple {4816#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {4816#true} is VALID [2018-11-14 18:18:57,976 INFO L273 TraceCheckUtils]: 7: Hoare triple {4816#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {4816#true} is VALID [2018-11-14 18:18:57,976 INFO L273 TraceCheckUtils]: 6: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-14 18:18:57,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {4816#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {4816#true} is VALID [2018-11-14 18:18:57,977 INFO L256 TraceCheckUtils]: 4: Hoare triple {4816#true} call #t~ret39 := main(); {4816#true} is VALID [2018-11-14 18:18:57,977 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4816#true} {4816#true} #217#return; {4816#true} is VALID [2018-11-14 18:18:57,977 INFO L273 TraceCheckUtils]: 2: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-14 18:18:57,977 INFO L273 TraceCheckUtils]: 1: Hoare triple {4816#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4816#true} is VALID [2018-11-14 18:18:57,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {4816#true} call ULTIMATE.init(); {4816#true} is VALID [2018-11-14 18:18:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:18:57,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:18:57,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-14 18:18:57,982 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-11-14 18:18:57,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:57,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:18:58,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:58,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:18:58,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:18:58,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:18:58,074 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 13 states. [2018-11-14 18:19:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:01,699 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2018-11-14 18:19:01,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:19:01,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-11-14 18:19:01,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:19:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:19:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2018-11-14 18:19:01,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:19:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2018-11-14 18:19:01,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 128 transitions. [2018-11-14 18:19:02,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:19:02,317 INFO L225 Difference]: With dead ends: 133 [2018-11-14 18:19:02,318 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 18:19:02,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:19:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 18:19:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2018-11-14 18:19:02,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:19:02,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 104 states. [2018-11-14 18:19:02,507 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 104 states. [2018-11-14 18:19:02,508 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 104 states. [2018-11-14 18:19:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:02,511 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2018-11-14 18:19:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2018-11-14 18:19:02,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:19:02,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:19:02,512 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 123 states. [2018-11-14 18:19:02,512 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 123 states. [2018-11-14 18:19:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:02,515 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2018-11-14 18:19:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2018-11-14 18:19:02,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:19:02,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:19:02,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:19:02,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:19:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 18:19:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2018-11-14 18:19:02,518 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 46 [2018-11-14 18:19:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:19:02,519 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2018-11-14 18:19:02,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:19:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2018-11-14 18:19:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 18:19:02,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:19:02,520 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:19:02,520 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:19:02,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:19:02,521 INFO L82 PathProgramCache]: Analyzing trace with hash -423463414, now seen corresponding path program 1 times [2018-11-14 18:19:02,521 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:19:02,521 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:19:02,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:19:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:19:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:19:02,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:19:02,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 18:19:02,746 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 10 treesize of output 9 [2018-11-14 18:19:02,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 18:19:02,821 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 10 treesize of output 9 [2018-11-14 18:19:02,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2018-11-14 18:19:02,890 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:02,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-14 18:19:02,939 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 16 treesize of output 15 [2018-11-14 18:19:02,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:02,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2018-11-14 18:19:02,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-14 18:19:02,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-14 18:19:02,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-14 18:19:03,028 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 17 treesize of output 9 [2018-11-14 18:19:03,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-11-14 18:19:03,040 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:03,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:19:03,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:19:03,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-14 18:19:03,073 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:03,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {5639#true} call ULTIMATE.init(); {5639#true} is VALID [2018-11-14 18:19:03,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {5639#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5639#true} is VALID [2018-11-14 18:19:03,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {5639#true} assume true; {5639#true} is VALID [2018-11-14 18:19:03,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5639#true} {5639#true} #217#return; {5639#true} is VALID [2018-11-14 18:19:03,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {5639#true} call #t~ret39 := main(); {5639#true} is VALID [2018-11-14 18:19:03,089 INFO L273 TraceCheckUtils]: 5: Hoare triple {5639#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {5639#true} is VALID [2018-11-14 18:19:03,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {5639#true} assume true; {5639#true} is VALID [2018-11-14 18:19:03,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {5639#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {5639#true} is VALID [2018-11-14 18:19:03,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {5639#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {5639#true} is VALID [2018-11-14 18:19:03,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {5639#true} assume true; {5639#true} is VALID [2018-11-14 18:19:03,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {5639#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {5639#true} is VALID [2018-11-14 18:19:03,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {5639#true} assume true; {5639#true} is VALID [2018-11-14 18:19:03,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {5639#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {5639#true} is VALID [2018-11-14 18:19:03,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {5639#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {5639#true} is VALID [2018-11-14 18:19:03,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {5639#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {5639#true} is VALID [2018-11-14 18:19:03,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {5639#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {5639#true} is VALID [2018-11-14 18:19:03,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {5639#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {5639#true} is VALID [2018-11-14 18:19:03,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {5639#true} assume true; {5639#true} is VALID [2018-11-14 18:19:03,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {5639#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {5639#true} is VALID [2018-11-14 18:19:03,103 INFO L273 TraceCheckUtils]: 19: Hoare triple {5639#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {5701#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:19:03,104 INFO L273 TraceCheckUtils]: 20: Hoare triple {5701#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {5701#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-14 18:19:03,104 INFO L273 TraceCheckUtils]: 21: Hoare triple {5701#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:03,104 INFO L273 TraceCheckUtils]: 22: Hoare triple {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:03,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:03,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume true; {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:03,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:03,149 INFO L273 TraceCheckUtils]: 26: Hoare triple {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:03,161 INFO L273 TraceCheckUtils]: 27: Hoare triple {5708#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {5727#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:19:03,161 INFO L273 TraceCheckUtils]: 28: Hoare triple {5727#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {5727#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:19:03,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {5727#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {5727#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:19:03,163 INFO L273 TraceCheckUtils]: 30: Hoare triple {5727#(and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5737#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:03,164 INFO L273 TraceCheckUtils]: 31: Hoare triple {5737#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume true; {5737#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:03,164 INFO L273 TraceCheckUtils]: 32: Hoare triple {5737#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5737#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:03,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {5737#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))} assume !!(#t~mem34 == 1bv32);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {5747#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:19:03,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {5747#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {5747#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:19:03,167 INFO L273 TraceCheckUtils]: 35: Hoare triple {5747#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5747#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:19:03,168 INFO L273 TraceCheckUtils]: 36: Hoare triple {5747#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {5747#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:19:03,168 INFO L273 TraceCheckUtils]: 37: Hoare triple {5747#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {5747#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 18:19:03,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {5747#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5763#(= (bvadd |main_#t~mem36| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:19:03,169 INFO L273 TraceCheckUtils]: 39: Hoare triple {5763#(= (bvadd |main_#t~mem36| (_ bv4294967293 32)) (_ bv0 32))} assume !!(#t~mem36 == 2bv32);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {5640#false} is VALID [2018-11-14 18:19:03,169 INFO L273 TraceCheckUtils]: 40: Hoare triple {5640#false} assume true; {5640#false} is VALID [2018-11-14 18:19:03,170 INFO L273 TraceCheckUtils]: 41: Hoare triple {5640#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5640#false} is VALID [2018-11-14 18:19:03,170 INFO L273 TraceCheckUtils]: 42: Hoare triple {5640#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {5640#false} is VALID [2018-11-14 18:19:03,170 INFO L273 TraceCheckUtils]: 43: Hoare triple {5640#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5640#false} is VALID [2018-11-14 18:19:03,170 INFO L273 TraceCheckUtils]: 44: Hoare triple {5640#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {5640#false} is VALID [2018-11-14 18:19:03,170 INFO L273 TraceCheckUtils]: 45: Hoare triple {5640#false} assume !false; {5640#false} is VALID [2018-11-14 18:19:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:19:03,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:19:03,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-14 18:19:03,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-11-14 18:19:03,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,314 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 32 treesize of output 24 [2018-11-14 18:19:03,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-11-14 18:19:03,321 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:03,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-11-14 18:19:03,344 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:03,553 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 13 treesize of output 11 [2018-11-14 18:19:03,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-14 18:19:03,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-11-14 18:19:03,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-14 18:19:03,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:03,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-11-14 18:19:03,612 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:03,663 INFO L273 TraceCheckUtils]: 45: Hoare triple {5640#false} assume !false; {5640#false} is VALID [2018-11-14 18:19:03,663 INFO L273 TraceCheckUtils]: 44: Hoare triple {5640#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {5640#false} is VALID [2018-11-14 18:19:03,664 INFO L273 TraceCheckUtils]: 43: Hoare triple {5640#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5640#false} is VALID [2018-11-14 18:19:03,664 INFO L273 TraceCheckUtils]: 42: Hoare triple {5640#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {5640#false} is VALID [2018-11-14 18:19:03,664 INFO L273 TraceCheckUtils]: 41: Hoare triple {5640#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5640#false} is VALID [2018-11-14 18:19:03,664 INFO L273 TraceCheckUtils]: 40: Hoare triple {5640#false} assume true; {5640#false} is VALID [2018-11-14 18:19:03,665 INFO L273 TraceCheckUtils]: 39: Hoare triple {5803#(not (= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32)))} assume !!(#t~mem36 == 2bv32);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {5640#false} is VALID [2018-11-14 18:19:03,666 INFO L273 TraceCheckUtils]: 38: Hoare triple {5807#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5803#(not (= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:03,666 INFO L273 TraceCheckUtils]: 37: Hoare triple {5807#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume true; {5807#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 18:19:03,667 INFO L273 TraceCheckUtils]: 36: Hoare triple {5807#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {5807#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 18:19:03,667 INFO L273 TraceCheckUtils]: 35: Hoare triple {5807#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5807#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 18:19:03,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {5807#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume true; {5807#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 18:19:03,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {5823#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} assume !!(#t~mem34 == 1bv32);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {5807#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 18:19:03,669 INFO L273 TraceCheckUtils]: 32: Hoare triple {5823#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5823#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:03,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {5823#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} assume true; {5823#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:03,672 INFO L273 TraceCheckUtils]: 30: Hoare triple {5833#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5823#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:03,672 INFO L273 TraceCheckUtils]: 29: Hoare triple {5833#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {5833#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:19:03,673 INFO L273 TraceCheckUtils]: 28: Hoare triple {5833#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume true; {5833#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:19:03,675 INFO L273 TraceCheckUtils]: 27: Hoare triple {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {5833#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:19:03,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:19:03,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:19:03,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:19:03,678 INFO L273 TraceCheckUtils]: 23: Hoare triple {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:19:03,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume true; {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:19:03,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {5639#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5843#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-14 18:19:03,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {5639#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {5639#true} is VALID [2018-11-14 18:19:03,680 INFO L273 TraceCheckUtils]: 19: Hoare triple {5639#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {5639#true} is VALID [2018-11-14 18:19:03,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {5639#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {5639#true} is VALID [2018-11-14 18:19:03,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {5639#true} assume true; {5639#true} is VALID [2018-11-14 18:19:03,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {5639#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {5639#true} is VALID [2018-11-14 18:19:03,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {5639#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {5639#true} is VALID [2018-11-14 18:19:03,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {5639#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {5639#true} is VALID [2018-11-14 18:19:03,681 INFO L273 TraceCheckUtils]: 13: Hoare triple {5639#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {5639#true} is VALID [2018-11-14 18:19:03,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {5639#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {5639#true} is VALID [2018-11-14 18:19:03,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {5639#true} assume true; {5639#true} is VALID [2018-11-14 18:19:03,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {5639#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {5639#true} is VALID [2018-11-14 18:19:03,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {5639#true} assume true; {5639#true} is VALID [2018-11-14 18:19:03,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {5639#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {5639#true} is VALID [2018-11-14 18:19:03,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {5639#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {5639#true} is VALID [2018-11-14 18:19:03,682 INFO L273 TraceCheckUtils]: 6: Hoare triple {5639#true} assume true; {5639#true} is VALID [2018-11-14 18:19:03,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {5639#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {5639#true} is VALID [2018-11-14 18:19:03,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {5639#true} call #t~ret39 := main(); {5639#true} is VALID [2018-11-14 18:19:03,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5639#true} {5639#true} #217#return; {5639#true} is VALID [2018-11-14 18:19:03,683 INFO L273 TraceCheckUtils]: 2: Hoare triple {5639#true} assume true; {5639#true} is VALID [2018-11-14 18:19:03,683 INFO L273 TraceCheckUtils]: 1: Hoare triple {5639#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5639#true} is VALID [2018-11-14 18:19:03,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {5639#true} call ULTIMATE.init(); {5639#true} is VALID [2018-11-14 18:19:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:19:03,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:19:03,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-14 18:19:03,688 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-11-14 18:19:03,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:19:03,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:19:03,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:19:03,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:19:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:19:03,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:19:03,781 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand 13 states. [2018-11-14 18:19:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:06,931 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2018-11-14 18:19:06,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:19:06,931 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-11-14 18:19:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:19:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:19:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2018-11-14 18:19:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:19:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2018-11-14 18:19:06,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 123 transitions. [2018-11-14 18:19:07,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:19:07,173 INFO L225 Difference]: With dead ends: 130 [2018-11-14 18:19:07,174 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 18:19:07,174 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:19:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 18:19:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2018-11-14 18:19:07,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:19:07,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 90 states. [2018-11-14 18:19:07,239 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 90 states. [2018-11-14 18:19:07,239 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 90 states. [2018-11-14 18:19:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:07,242 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2018-11-14 18:19:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2018-11-14 18:19:07,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:19:07,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:19:07,243 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 106 states. [2018-11-14 18:19:07,243 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 106 states. [2018-11-14 18:19:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:07,245 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2018-11-14 18:19:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2018-11-14 18:19:07,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:19:07,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:19:07,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:19:07,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:19:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 18:19:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2018-11-14 18:19:07,248 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 46 [2018-11-14 18:19:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:19:07,248 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2018-11-14 18:19:07,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:19:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2018-11-14 18:19:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 18:19:07,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:19:07,249 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:19:07,249 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:19:07,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:19:07,250 INFO L82 PathProgramCache]: Analyzing trace with hash 611639965, now seen corresponding path program 3 times [2018-11-14 18:19:07,250 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:19:07,250 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:19:07,280 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 18:19:07,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 18:19:07,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:19:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:19:07,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:19:07,789 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:19:07,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:07,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:07,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:19:07,800 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:07,871 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:07,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:07,874 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 13 treesize of output 4 [2018-11-14 18:19:07,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:07,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:19:07,927 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:19:07,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:07,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:07,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:07,951 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-14 18:19:07,960 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:08,013 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 13 treesize of output 10 [2018-11-14 18:19:08,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:19:08,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:08,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:08,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:08,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-14 18:19:08,065 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:08,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:08,138 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-11-14 18:19:08,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-14 18:19:08,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:08,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:08,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:08,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:46 [2018-11-14 18:19:08,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-14 18:19:08,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-14 18:19:08,271 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:19:08,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:19:08,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:19:08,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:27 [2018-11-14 18:19:08,308 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:08,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:08,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-14 18:19:08,506 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 38 treesize of output 26 [2018-11-14 18:19:08,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:08,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:08,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 31 [2018-11-14 18:19:08,836 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-14 18:19:08,993 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 25 treesize of output 24 [2018-11-14 18:19:08,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:09,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:19:09,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-14 18:19:09,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:80 [2018-11-14 18:19:09,213 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:09,472 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 28 treesize of output 22 [2018-11-14 18:19:09,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-14 18:19:09,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:09,490 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 5 treesize of output 1 [2018-11-14 18:19:09,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:09,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:09,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:09,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:09,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-11-14 18:19:09,551 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 15 [2018-11-14 18:19:09,556 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:09,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-14 18:19:09,568 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:09,574 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:09,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:09,593 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:59, output treesize:11 [2018-11-14 18:19:09,598 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:09,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {6407#true} call ULTIMATE.init(); {6407#true} is VALID [2018-11-14 18:19:09,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {6407#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6407#true} is VALID [2018-11-14 18:19:09,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-14 18:19:09,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6407#true} {6407#true} #217#return; {6407#true} is VALID [2018-11-14 18:19:09,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {6407#true} call #t~ret39 := main(); {6407#true} is VALID [2018-11-14 18:19:09,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {6407#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {6407#true} is VALID [2018-11-14 18:19:09,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-14 18:19:09,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {6407#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {6407#true} is VALID [2018-11-14 18:19:09,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {6407#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {6407#true} is VALID [2018-11-14 18:19:09,629 INFO L273 TraceCheckUtils]: 9: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-14 18:19:09,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {6407#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {6407#true} is VALID [2018-11-14 18:19:09,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-14 18:19:09,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {6407#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {6407#true} is VALID [2018-11-14 18:19:09,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {6407#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {6407#true} is VALID [2018-11-14 18:19:09,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {6407#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {6407#true} is VALID [2018-11-14 18:19:09,630 INFO L273 TraceCheckUtils]: 15: Hoare triple {6407#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {6407#true} is VALID [2018-11-14 18:19:09,630 INFO L273 TraceCheckUtils]: 16: Hoare triple {6407#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {6407#true} is VALID [2018-11-14 18:19:09,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-14 18:19:09,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {6407#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {6407#true} is VALID [2018-11-14 18:19:09,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {6407#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {6469#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:19:09,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {6469#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {6469#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:19:09,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {6469#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {6476#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:09,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {6476#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {6476#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:09,633 INFO L273 TraceCheckUtils]: 23: Hoare triple {6476#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {6476#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:09,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {6476#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {6476#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:09,636 INFO L273 TraceCheckUtils]: 25: Hoare triple {6476#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {6489#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:19:09,637 INFO L273 TraceCheckUtils]: 26: Hoare triple {6489#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {6489#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:19:09,639 INFO L273 TraceCheckUtils]: 27: Hoare triple {6489#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {6496#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:19:09,640 INFO L273 TraceCheckUtils]: 28: Hoare triple {6496#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {6496#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:19:09,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {6496#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {6503#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:19:09,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {6503#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {6503#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:19:09,647 INFO L273 TraceCheckUtils]: 31: Hoare triple {6503#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {6510#(and (= main_~a~0.offset (_ bv0 32)) (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_54 (_ BitVec 32)) (v_arrayElimCell_63 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_arrayElimCell_63) v_main_~p~0.offset_54)) (not (= main_~a~0.base v_arrayElimCell_63)))) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:19:09,648 INFO L273 TraceCheckUtils]: 32: Hoare triple {6510#(and (= main_~a~0.offset (_ bv0 32)) (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_54 (_ BitVec 32)) (v_arrayElimCell_63 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_arrayElimCell_63) v_main_~p~0.offset_54)) (not (= main_~a~0.base v_arrayElimCell_63)))) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {6510#(and (= main_~a~0.offset (_ bv0 32)) (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_54 (_ BitVec 32)) (v_arrayElimCell_63 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_arrayElimCell_63) v_main_~p~0.offset_54)) (not (= main_~a~0.base v_arrayElimCell_63)))) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:19:09,648 INFO L273 TraceCheckUtils]: 33: Hoare triple {6510#(and (= main_~a~0.offset (_ bv0 32)) (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_54 (_ BitVec 32)) (v_arrayElimCell_63 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_arrayElimCell_63) v_main_~p~0.offset_54)) (not (= main_~a~0.base v_arrayElimCell_63)))) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {6510#(and (= main_~a~0.offset (_ bv0 32)) (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_54 (_ BitVec 32)) (v_arrayElimCell_63 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_arrayElimCell_63) v_main_~p~0.offset_54)) (not (= main_~a~0.base v_arrayElimCell_63)))) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:19:09,655 INFO L273 TraceCheckUtils]: 34: Hoare triple {6510#(and (= main_~a~0.offset (_ bv0 32)) (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_54 (_ BitVec 32)) (v_arrayElimCell_63 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_arrayElimCell_63) v_main_~p~0.offset_54)) (not (= main_~a~0.base v_arrayElimCell_63)))) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {6520#(or (and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_9 main_~p~0.base)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32))))) (and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)) (exists ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_prenex_11) v_prenex_10)) (not (= main_~p~0.base v_prenex_11))))))} is VALID [2018-11-14 18:19:09,674 INFO L273 TraceCheckUtils]: 35: Hoare triple {6520#(or (and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_9 main_~p~0.base)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32))))) (and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)) (exists ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_prenex_11) v_prenex_10)) (not (= main_~p~0.base v_prenex_11))))))} assume true; {6520#(or (and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_9 main_~p~0.base)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32))))) (and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)) (exists ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_prenex_11) v_prenex_10)) (not (= main_~p~0.base v_prenex_11))))))} is VALID [2018-11-14 18:19:09,679 INFO L273 TraceCheckUtils]: 36: Hoare triple {6520#(or (and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_9 main_~p~0.base)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32))))) (and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)) (exists ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_prenex_11) v_prenex_10)) (not (= main_~p~0.base v_prenex_11))))))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {6527#(or (= (_ bv2 32) |main_#t~mem34|) (= (bvadd |main_#t~mem34| (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:09,680 INFO L273 TraceCheckUtils]: 37: Hoare triple {6527#(or (= (_ bv2 32) |main_#t~mem34|) (= (bvadd |main_#t~mem34| (_ bv4294967293 32)) (_ bv0 32)))} assume !!(#t~mem34 == 1bv32);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {6408#false} is VALID [2018-11-14 18:19:09,680 INFO L273 TraceCheckUtils]: 38: Hoare triple {6408#false} assume true; {6408#false} is VALID [2018-11-14 18:19:09,680 INFO L273 TraceCheckUtils]: 39: Hoare triple {6408#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {6408#false} is VALID [2018-11-14 18:19:09,680 INFO L273 TraceCheckUtils]: 40: Hoare triple {6408#false} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {6408#false} is VALID [2018-11-14 18:19:09,680 INFO L273 TraceCheckUtils]: 41: Hoare triple {6408#false} assume true; {6408#false} is VALID [2018-11-14 18:19:09,680 INFO L273 TraceCheckUtils]: 42: Hoare triple {6408#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {6408#false} is VALID [2018-11-14 18:19:09,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {6408#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {6408#false} is VALID [2018-11-14 18:19:09,681 INFO L273 TraceCheckUtils]: 44: Hoare triple {6408#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {6408#false} is VALID [2018-11-14 18:19:09,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {6408#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {6408#false} is VALID [2018-11-14 18:19:09,681 INFO L273 TraceCheckUtils]: 46: Hoare triple {6408#false} assume !false; {6408#false} is VALID [2018-11-14 18:19:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:19:09,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:19:10,904 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 33 treesize of output 34 [2018-11-14 18:19:10,954 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 12 treesize of output 16 [2018-11-14 18:19:10,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-11-14 18:19:10,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:10,979 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:11,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2018-11-14 18:19:11,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-14 18:19:11,045 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:11,095 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:11,096 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:11,098 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:11,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2018-11-14 18:19:11,101 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:11,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-14 18:19:11,143 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:11,171 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:11,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2018-11-14 18:19:11,203 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 19 [2018-11-14 18:19:11,206 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:11,254 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:11,255 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:11,258 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:11,259 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 22 treesize of output 10 [2018-11-14 18:19:11,260 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:11,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-14 18:19:11,303 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:11,329 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:11,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:19:11,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-11-14 18:19:11,495 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 32 treesize of output 32 [2018-11-14 18:19:11,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2018-11-14 18:19:11,512 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:11,533 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:11,553 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 24 treesize of output 27 [2018-11-14 18:19:11,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-11-14 18:19:11,660 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:11,797 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-14 18:19:12,181 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:12,181 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:12,184 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:19:12,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-11-14 18:19:12,187 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,203 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,212 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 28 treesize of output 22 [2018-11-14 18:19:12,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-14 18:19:12,220 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-14 18:19:12,241 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,244 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:12,276 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:19:12,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-14 18:19:12,354 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 4 variables, input treesize:45, output treesize:47 [2018-11-14 18:19:12,375 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:14,528 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2018-11-14 18:19:14,599 INFO L273 TraceCheckUtils]: 46: Hoare triple {6408#false} assume !false; {6408#false} is VALID [2018-11-14 18:19:14,599 INFO L273 TraceCheckUtils]: 45: Hoare triple {6408#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {6408#false} is VALID [2018-11-14 18:19:14,600 INFO L273 TraceCheckUtils]: 44: Hoare triple {6408#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {6408#false} is VALID [2018-11-14 18:19:14,600 INFO L273 TraceCheckUtils]: 43: Hoare triple {6408#false} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {6408#false} is VALID [2018-11-14 18:19:14,600 INFO L273 TraceCheckUtils]: 42: Hoare triple {6408#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {6408#false} is VALID [2018-11-14 18:19:14,600 INFO L273 TraceCheckUtils]: 41: Hoare triple {6408#false} assume true; {6408#false} is VALID [2018-11-14 18:19:14,600 INFO L273 TraceCheckUtils]: 40: Hoare triple {6408#false} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {6408#false} is VALID [2018-11-14 18:19:14,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {6408#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {6408#false} is VALID [2018-11-14 18:19:14,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {6408#false} assume true; {6408#false} is VALID [2018-11-14 18:19:14,602 INFO L273 TraceCheckUtils]: 37: Hoare triple {6585#(not (= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32)))} assume !!(#t~mem34 == 1bv32);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {6408#false} is VALID [2018-11-14 18:19:14,602 INFO L273 TraceCheckUtils]: 36: Hoare triple {6589#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {6585#(not (= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:14,602 INFO L273 TraceCheckUtils]: 35: Hoare triple {6589#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {6589#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:14,604 INFO L273 TraceCheckUtils]: 34: Hoare triple {6596#(not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {6589#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:14,604 INFO L273 TraceCheckUtils]: 33: Hoare triple {6596#(not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {6596#(not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:14,604 INFO L273 TraceCheckUtils]: 32: Hoare triple {6596#(not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {6596#(not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:14,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {6606#(not (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {6596#(not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:19:14,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {6606#(not (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {6606#(not (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:19:14,614 INFO L273 TraceCheckUtils]: 29: Hoare triple {6613#(forall ((v_main_~t~0.base_20 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (not (= (_ bv1 32) (select (select (store (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20 (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20) (_ bv0 32) (_ bv3 32))) main_~a~0.base) main_~a~0.offset))))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {6606#(not (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 18:19:14,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {6613#(forall ((v_main_~t~0.base_20 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (not (= (_ bv1 32) (select (select (store (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20 (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20) (_ bv0 32) (_ bv3 32))) main_~a~0.base) main_~a~0.offset))))} assume true; {6613#(forall ((v_main_~t~0.base_20 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (not (= (_ bv1 32) (select (select (store (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20 (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20) (_ bv0 32) (_ bv3 32))) main_~a~0.base) main_~a~0.offset))))} is VALID [2018-11-14 18:19:14,649 INFO L273 TraceCheckUtils]: 27: Hoare triple {6613#(forall ((v_main_~t~0.base_20 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (not (= (_ bv1 32) (select (select (store (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20 (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20) (_ bv0 32) (_ bv3 32))) main_~a~0.base) main_~a~0.offset))))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {6613#(forall ((v_main_~t~0.base_20 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (not (= (_ bv1 32) (select (select (store (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20 (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20) (_ bv0 32) (_ bv3 32))) main_~a~0.base) main_~a~0.offset))))} is VALID [2018-11-14 18:19:14,650 INFO L273 TraceCheckUtils]: 26: Hoare triple {6613#(forall ((v_main_~t~0.base_20 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (not (= (_ bv1 32) (select (select (store (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20 (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20) (_ bv0 32) (_ bv3 32))) main_~a~0.base) main_~a~0.offset))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {6613#(forall ((v_main_~t~0.base_20 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (not (= (_ bv1 32) (select (select (store (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20 (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20) (_ bv0 32) (_ bv3 32))) main_~a~0.base) main_~a~0.offset))))} is VALID [2018-11-14 18:19:14,657 INFO L273 TraceCheckUtils]: 25: Hoare triple {6626#(and (or (forall ((v_prenex_16 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_16)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_18))))))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {6613#(forall ((v_main_~t~0.base_20 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (not (= (_ bv1 32) (select (select (store (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20 (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32))) v_main_~t~0.base_20) (_ bv0 32) (_ bv3 32))) main_~a~0.base) main_~a~0.offset))))} is VALID [2018-11-14 18:19:14,658 INFO L273 TraceCheckUtils]: 24: Hoare triple {6626#(and (or (forall ((v_prenex_16 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_16)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_18))))))} assume true; {6626#(and (or (forall ((v_prenex_16 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_16)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_18))))))} is VALID [2018-11-14 18:19:14,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {6626#(and (or (forall ((v_prenex_16 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_16)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_18))))))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {6626#(and (or (forall ((v_prenex_16 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_16)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_18))))))} is VALID [2018-11-14 18:19:14,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {6626#(and (or (forall ((v_prenex_16 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_16)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_18))))))} assume true; {6626#(and (or (forall ((v_prenex_16 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_16)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_18))))))} is VALID [2018-11-14 18:19:14,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {6407#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {6626#(and (or (forall ((v_prenex_16 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_16)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_18))))))} is VALID [2018-11-14 18:19:14,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {6407#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {6407#true} is VALID [2018-11-14 18:19:14,660 INFO L273 TraceCheckUtils]: 19: Hoare triple {6407#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {6407#true} is VALID [2018-11-14 18:19:14,660 INFO L273 TraceCheckUtils]: 18: Hoare triple {6407#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {6407#true} is VALID [2018-11-14 18:19:14,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-14 18:19:14,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {6407#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {6407#true} is VALID [2018-11-14 18:19:14,660 INFO L273 TraceCheckUtils]: 15: Hoare triple {6407#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {6407#true} is VALID [2018-11-14 18:19:14,660 INFO L273 TraceCheckUtils]: 14: Hoare triple {6407#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {6407#true} is VALID [2018-11-14 18:19:14,661 INFO L273 TraceCheckUtils]: 13: Hoare triple {6407#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {6407#true} is VALID [2018-11-14 18:19:14,661 INFO L273 TraceCheckUtils]: 12: Hoare triple {6407#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {6407#true} is VALID [2018-11-14 18:19:14,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-14 18:19:14,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {6407#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {6407#true} is VALID [2018-11-14 18:19:14,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-14 18:19:14,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {6407#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {6407#true} is VALID [2018-11-14 18:19:14,661 INFO L273 TraceCheckUtils]: 7: Hoare triple {6407#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {6407#true} is VALID [2018-11-14 18:19:14,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-14 18:19:14,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {6407#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {6407#true} is VALID [2018-11-14 18:19:14,662 INFO L256 TraceCheckUtils]: 4: Hoare triple {6407#true} call #t~ret39 := main(); {6407#true} is VALID [2018-11-14 18:19:14,662 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6407#true} {6407#true} #217#return; {6407#true} is VALID [2018-11-14 18:19:14,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-14 18:19:14,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {6407#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6407#true} is VALID [2018-11-14 18:19:14,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {6407#true} call ULTIMATE.init(); {6407#true} is VALID [2018-11-14 18:19:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:19:14,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:19:14,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-11-14 18:19:14,676 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-11-14 18:19:14,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:19:14,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:19:14,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:19:14,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:19:14,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:19:14,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=187, Unknown=1, NotChecked=0, Total=240 [2018-11-14 18:19:14,818 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand 16 states. [2018-11-14 18:19:17,830 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2018-11-14 18:19:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:19,653 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2018-11-14 18:19:19,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:19:19,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-11-14 18:19:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:19:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:19:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 125 transitions. [2018-11-14 18:19:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:19:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 125 transitions. [2018-11-14 18:19:19,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 125 transitions. [2018-11-14 18:19:19,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:19:19,929 INFO L225 Difference]: With dead ends: 120 [2018-11-14 18:19:19,929 INFO L226 Difference]: Without dead ends: 110 [2018-11-14 18:19:19,930 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=184, Invalid=571, Unknown=1, NotChecked=0, Total=756 [2018-11-14 18:19:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-14 18:19:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2018-11-14 18:19:19,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:19:19,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 90 states. [2018-11-14 18:19:19,980 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 90 states. [2018-11-14 18:19:19,980 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 90 states. [2018-11-14 18:19:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:19,983 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2018-11-14 18:19:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-14 18:19:19,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:19:19,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:19:19,984 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 110 states. [2018-11-14 18:19:19,984 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 110 states. [2018-11-14 18:19:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:19,987 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2018-11-14 18:19:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-14 18:19:19,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:19:19,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:19:19,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:19:19,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:19:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 18:19:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2018-11-14 18:19:19,990 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 47 [2018-11-14 18:19:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:19:19,990 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2018-11-14 18:19:19,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:19:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2018-11-14 18:19:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 18:19:19,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:19:19,991 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:19:19,991 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:19:19,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:19:19,992 INFO L82 PathProgramCache]: Analyzing trace with hash 591946638, now seen corresponding path program 1 times [2018-11-14 18:19:19,992 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:19:19,992 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:19:20,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:19:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:19:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:19:20,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:19:20,576 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:19:20,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:19:20,590 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:20,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:20,734 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:20,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-14 18:19:20,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:26 [2018-11-14 18:19:20,768 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:20,865 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 13 treesize of output 10 [2018-11-14 18:19:20,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:19:20,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,944 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 13 treesize of output 10 [2018-11-14 18:19:20,950 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 10 treesize of output 9 [2018-11-14 18:19:20,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:52 [2018-11-14 18:19:21,018 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:21,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:21,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:21,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:21,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-14 18:19:21,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-14 18:19:21,174 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 14 treesize of output 19 [2018-11-14 18:19:21,175 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,219 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:68, output treesize:65 [2018-11-14 18:19:21,230 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:21,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 117 [2018-11-14 18:19:21,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-14 18:19:21,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 94 [2018-11-14 18:19:21,515 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 22 treesize of output 21 [2018-11-14 18:19:21,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,602 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:130, output treesize:104 [2018-11-14 18:19:21,632 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:21,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2018-11-14 18:19:21,770 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 22 treesize of output 21 [2018-11-14 18:19:21,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:21,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:19:21,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:88 [2018-11-14 18:19:21,834 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:22,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 76 [2018-11-14 18:19:22,158 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 76 treesize of output 63 [2018-11-14 18:19:22,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:22,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:22,283 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 78 treesize of output 52 [2018-11-14 18:19:22,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-14 18:19:22,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:22,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-11-14 18:19:22,330 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:19:22,351 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:19:22,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-14 18:19:22,380 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:108, output treesize:36 [2018-11-14 18:19:22,392 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:22,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-11-14 18:19:22,504 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 5 treesize of output 1 [2018-11-14 18:19:22,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:22,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:19:22,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:22,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:22,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:22,543 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2018-11-14 18:19:22,547 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:22,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {7192#true} call ULTIMATE.init(); {7192#true} is VALID [2018-11-14 18:19:22,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {7192#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {7192#true} is VALID [2018-11-14 18:19:22,593 INFO L273 TraceCheckUtils]: 2: Hoare triple {7192#true} assume true; {7192#true} is VALID [2018-11-14 18:19:22,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7192#true} {7192#true} #217#return; {7192#true} is VALID [2018-11-14 18:19:22,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {7192#true} call #t~ret39 := main(); {7192#true} is VALID [2018-11-14 18:19:22,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {7192#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {7192#true} is VALID [2018-11-14 18:19:22,593 INFO L273 TraceCheckUtils]: 6: Hoare triple {7192#true} assume true; {7192#true} is VALID [2018-11-14 18:19:22,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {7192#true} assume !(#t~nondet3 != 0bv32);havoc #t~nondet3; {7192#true} is VALID [2018-11-14 18:19:22,594 INFO L273 TraceCheckUtils]: 8: Hoare triple {7192#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {7192#true} is VALID [2018-11-14 18:19:22,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {7192#true} assume true; {7192#true} is VALID [2018-11-14 18:19:22,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {7192#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {7192#true} is VALID [2018-11-14 18:19:22,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {7192#true} assume true; {7192#true} is VALID [2018-11-14 18:19:22,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {7192#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {7192#true} is VALID [2018-11-14 18:19:22,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {7192#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {7192#true} is VALID [2018-11-14 18:19:22,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {7192#true} assume !#t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~short22; {7192#true} is VALID [2018-11-14 18:19:22,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {7192#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {7192#true} is VALID [2018-11-14 18:19:22,595 INFO L273 TraceCheckUtils]: 16: Hoare triple {7192#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {7192#true} is VALID [2018-11-14 18:19:22,595 INFO L273 TraceCheckUtils]: 17: Hoare triple {7192#true} assume true; {7192#true} is VALID [2018-11-14 18:19:22,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {7192#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {7192#true} is VALID [2018-11-14 18:19:22,596 INFO L273 TraceCheckUtils]: 19: Hoare triple {7192#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {7254#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:19:22,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {7254#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {7254#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:19:22,597 INFO L273 TraceCheckUtils]: 21: Hoare triple {7254#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {7261#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:22,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {7261#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {7261#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:22,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {7261#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(#t~nondet28 != 0bv32);havoc #t~nondet28; {7261#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:22,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {7261#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume true; {7261#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-14 18:19:22,601 INFO L273 TraceCheckUtils]: 25: Hoare triple {7261#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {7274#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:19:22,602 INFO L273 TraceCheckUtils]: 26: Hoare triple {7274#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {7274#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:19:22,603 INFO L273 TraceCheckUtils]: 27: Hoare triple {7274#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {7281#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:19:22,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume true; {7281#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 18:19:22,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {7281#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !!(#t~nondet31 != 0bv32);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {7288#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:19:22,610 INFO L273 TraceCheckUtils]: 30: Hoare triple {7288#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {7288#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:19:22,628 INFO L273 TraceCheckUtils]: 31: Hoare triple {7288#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {7295#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-14 18:19:22,629 INFO L273 TraceCheckUtils]: 32: Hoare triple {7295#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} assume true; {7295#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-14 18:19:22,631 INFO L273 TraceCheckUtils]: 33: Hoare triple {7295#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} assume !(#t~nondet31 != 0bv32);havoc #t~nondet31; {7295#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-14 18:19:23,317 INFO L273 TraceCheckUtils]: 34: Hoare triple {7295#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {7305#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:19:23,318 INFO L273 TraceCheckUtils]: 35: Hoare triple {7305#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume true; {7305#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:19:23,319 INFO L273 TraceCheckUtils]: 36: Hoare triple {7305#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {7305#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:19:23,320 INFO L273 TraceCheckUtils]: 37: Hoare triple {7305#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !(#t~mem34 == 1bv32);havoc #t~mem34; {7305#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:19:23,320 INFO L273 TraceCheckUtils]: 38: Hoare triple {7305#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume true; {7305#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:19:23,323 INFO L273 TraceCheckUtils]: 39: Hoare triple {7305#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {7321#(and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem36|) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-14 18:19:23,327 INFO L273 TraceCheckUtils]: 40: Hoare triple {7321#(and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem36|) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.offset_63 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) v_main_~p~0.offset_63))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(#t~mem36 == 2bv32);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {7325#(and (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_64 (_ BitVec 32)) (v_main_~p~0.offset_63 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (and (not (= v_main_~p~0.base_64 main_~p~0.base)) (not (= main_~p~0.base v_arrayElimCell_90)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_64) (_ bv0 32))) (not (= v_main_~p~0.base_64 v_arrayElimCell_90)) (= (_ bv3 32) (select (select |#memory_int| v_arrayElimCell_90) v_main_~p~0.offset_63)))))} is VALID [2018-11-14 18:19:23,327 INFO L273 TraceCheckUtils]: 41: Hoare triple {7325#(and (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_64 (_ BitVec 32)) (v_main_~p~0.offset_63 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (and (not (= v_main_~p~0.base_64 main_~p~0.base)) (not (= main_~p~0.base v_arrayElimCell_90)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_64) (_ bv0 32))) (not (= v_main_~p~0.base_64 v_arrayElimCell_90)) (= (_ bv3 32) (select (select |#memory_int| v_arrayElimCell_90) v_main_~p~0.offset_63)))))} assume true; {7325#(and (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_64 (_ BitVec 32)) (v_main_~p~0.offset_63 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (and (not (= v_main_~p~0.base_64 main_~p~0.base)) (not (= main_~p~0.base v_arrayElimCell_90)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_64) (_ bv0 32))) (not (= v_main_~p~0.base_64 v_arrayElimCell_90)) (= (_ bv3 32) (select (select |#memory_int| v_arrayElimCell_90) v_main_~p~0.offset_63)))))} is VALID [2018-11-14 18:19:23,328 INFO L273 TraceCheckUtils]: 42: Hoare triple {7325#(and (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_64 (_ BitVec 32)) (v_main_~p~0.offset_63 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (and (not (= v_main_~p~0.base_64 main_~p~0.base)) (not (= main_~p~0.base v_arrayElimCell_90)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_64) (_ bv0 32))) (not (= v_main_~p~0.base_64 v_arrayElimCell_90)) (= (_ bv3 32) (select (select |#memory_int| v_arrayElimCell_90) v_main_~p~0.offset_63)))))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {7332#(= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:19:23,328 INFO L273 TraceCheckUtils]: 43: Hoare triple {7332#(= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32))} assume !(#t~mem36 == 2bv32);havoc #t~mem36; {7193#false} is VALID [2018-11-14 18:19:23,328 INFO L273 TraceCheckUtils]: 44: Hoare triple {7193#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {7193#false} is VALID [2018-11-14 18:19:23,329 INFO L273 TraceCheckUtils]: 45: Hoare triple {7193#false} assume #t~mem38 != 3bv32;havoc #t~mem38; {7193#false} is VALID [2018-11-14 18:19:23,329 INFO L273 TraceCheckUtils]: 46: Hoare triple {7193#false} assume !false; {7193#false} is VALID [2018-11-14 18:19:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:19:23,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:19:26,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 75 [2018-11-14 18:19:26,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:19:26,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:26,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 95 [2018-11-14 18:19:26,437 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2018-11-14 18:19:26,441 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:26,900 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2018-11-14 18:19:26,903 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2018-11-14 18:19:27,305 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,661 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2018-11-14 18:19:27,665 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:27,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2018-11-14 18:19:27,938 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:28,437 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 51 treesize of output 45 [2018-11-14 18:19:28,440 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:28,692 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 80 treesize of output 74 [2018-11-14 18:19:28,695 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:28,931 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 74 treesize of output 68 [2018-11-14 18:19:28,934 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:29,164 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 68 treesize of output 50 [2018-11-14 18:19:29,167 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:29,394 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 51 treesize of output 45 [2018-11-14 18:19:29,397 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:29,616 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 77 treesize of output 59 [2018-11-14 18:19:29,619 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:29,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2018-11-14 18:19:29,817 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:29,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:19:29,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2018-11-14 18:19:30,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-11-14 18:19:30,029 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:30,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-11-14 18:19:30,151 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:30,240 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:30,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2018-11-14 18:19:30,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-11-14 18:19:30,342 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:30,494 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:30,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 95 [2018-11-14 18:19:30,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2018-11-14 18:19:30,673 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:30,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2018-11-14 18:19:31,003 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,257 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 65 treesize of output 47 [2018-11-14 18:19:31,260 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,590 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 58 treesize of output 52 [2018-11-14 18:19:31,594 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:31,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-11-14 18:19:31,752 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-11-14 18:19:32,022 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-11-14 18:19:32,166 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:32,796 INFO L267 ElimStorePlain]: Start of recursive call 22: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:19:33,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-14 18:19:33,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 17 dim-0 vars, and 10 xjuncts. [2018-11-14 18:19:33,413 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 4 variables, input treesize:104, output treesize:449 [2018-11-14 18:19:33,477 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN.