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/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:17:22,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:17:22,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:17:22,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:17:22,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:17:22,210 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:17:22,211 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:17:22,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:17:22,215 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:17:22,216 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:17:22,217 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:17:22,217 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:17:22,218 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:17:22,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:17:22,226 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:17:22,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:17:22,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:17:22,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:17:22,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:17:22,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:17:22,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:17:22,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:17:22,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:17:22,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:17:22,248 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:17:22,249 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:17:22,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:17:22,251 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:17:22,252 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:17:22,253 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:17:22,253 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:17:22,254 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:17:22,254 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:17:22,254 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:17:22,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:17:22,256 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:17:22,256 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:17:22,271 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:17:22,272 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:17:22,272 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:17:22,273 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:17:22,273 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:17:22,273 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:17:22,274 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:17:22,274 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:17:22,274 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:17:22,274 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:17:22,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:17:22,275 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:17:22,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:17:22,275 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:17:22,275 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:17:22,275 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:17:22,276 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:17:22,276 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:17:22,276 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:17:22,276 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:17:22,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:17:22,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:17:22,277 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:17:22,277 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:17:22,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:17:22,277 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:17:22,278 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:17:22,278 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:17:22,278 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:17:22,278 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:17:22,278 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:17:22,278 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:17:22,279 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:17:22,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:17:22,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:17:22,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:17:22,353 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:17:22,353 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:17:22,354 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:17:22,411 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bdadcf94/cfe0521f38a546b9a2701a3389b0c79e/FLAG86b9261a3 [2018-11-14 18:17:22,874 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:17:22,877 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:17:22,899 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bdadcf94/cfe0521f38a546b9a2701a3389b0c79e/FLAG86b9261a3 [2018-11-14 18:17:22,920 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bdadcf94/cfe0521f38a546b9a2701a3389b0c79e [2018-11-14 18:17:22,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:17:22,933 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:17:22,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:17:22,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:17:22,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:17:22,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:17:22" (1/1) ... [2018-11-14 18:17:22,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb20300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:22, skipping insertion in model container [2018-11-14 18:17:22,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:17:22" (1/1) ... [2018-11-14 18:17:22,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:17:23,009 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:17:23,496 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:17:23,514 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:17:23,675 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:17:23,754 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:17:23,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:23 WrapperNode [2018-11-14 18:17:23,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:17:23,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:17:23,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:17:23,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:17:23,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:23" (1/1) ... [2018-11-14 18:17:23,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:23" (1/1) ... [2018-11-14 18:17:23,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:23" (1/1) ... [2018-11-14 18:17:23,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:23" (1/1) ... [2018-11-14 18:17:23,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:23" (1/1) ... [2018-11-14 18:17:23,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:23" (1/1) ... [2018-11-14 18:17:23,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:23" (1/1) ... [2018-11-14 18:17:23,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:17:23,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:17:23,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:17:23,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:17:23,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:23" (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:17:23,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:17:23,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:17:23,907 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:17:23,907 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:17:23,907 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:17:23,908 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:17:23,908 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:17:23,908 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:17:23,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:17:23,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:17:23,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:17:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:17:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:17:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:17:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:17:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:17:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:17:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:17:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:17:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:17:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:17:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:17:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:17:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:17:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:17:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:17:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:17:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:17:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:17:23,912 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:17:23,912 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:17:23,912 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:17:23,912 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:17:23,912 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:17:23,912 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:17:23,912 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:17:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:17:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:17:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:17:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:17:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:17:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:17:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:17:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:17:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:17:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:17:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:17:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:17:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:17:23,915 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:17:23,915 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:17:23,915 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:17:23,915 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:17:23,915 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:17:23,915 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:17:23,915 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:17:23,916 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:17:23,916 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:17:23,916 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:17:23,916 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:17:23,916 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:17:23,916 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:17:23,916 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:17:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:17:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:17:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:17:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:17:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:17:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:17:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:17:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:17:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:17:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:17:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:17:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:17:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:17:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:17:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:17:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:17:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:17:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:17:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:17:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:17:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:17:23,920 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:17:23,920 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:17:23,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:17:23,920 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:17:23,920 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:17:23,920 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:17:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:17:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:17:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:17:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:17:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:17:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:17:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:17:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:17:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:17:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:17:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:17:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:17:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:17:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:17:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:17:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:17:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:17:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:17:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:17:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:17:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:17:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:17:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:17:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:17:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:17:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:17:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:17:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:17:25,142 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:17:25,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:17:25 BoogieIcfgContainer [2018-11-14 18:17:25,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:17:25,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:17:25,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:17:25,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:17:25,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:17:22" (1/3) ... [2018-11-14 18:17:25,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2923c197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:17:25, skipping insertion in model container [2018-11-14 18:17:25,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:17:23" (2/3) ... [2018-11-14 18:17:25,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2923c197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:17:25, skipping insertion in model container [2018-11-14 18:17:25,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:17:25" (3/3) ... [2018-11-14 18:17:25,153 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:17:25,164 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:17:25,172 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-14 18:17:25,190 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-14 18:17:25,220 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:17:25,221 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:17:25,221 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:17:25,221 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:17:25,221 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:17:25,222 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:17:25,222 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:17:25,222 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:17:25,222 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:17:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 18:17:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 18:17:25,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:25,251 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:25,254 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:25,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash 827631655, now seen corresponding path program 1 times [2018-11-14 18:17:25,263 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:25,264 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:17:25,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:25,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:25,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 18:17:25,466 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-14 18:17:25,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 18:17:25,467 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #144#return; {45#true} is VALID [2018-11-14 18:17:25,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret17 := main(); {45#true} is VALID [2018-11-14 18:17:25,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {45#true} is VALID [2018-11-14 18:17:25,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-14 18:17:25,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {46#false} is VALID [2018-11-14 18:17:25,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 18:17:25,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {46#false} is VALID [2018-11-14 18:17:25,471 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 18:17:25,474 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:17:25,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:17:25,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:25,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:17:25,482 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:17:25,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:25,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:17:25,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:25,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:17:25,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:17:25,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:17:25,560 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-14 18:17:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:26,101 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2018-11-14 18:17:26,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:17:26,101 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:17:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:17:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-14 18:17:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:17:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-14 18:17:26,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2018-11-14 18:17:26,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:26,958 INFO L225 Difference]: With dead ends: 75 [2018-11-14 18:17:26,959 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:17:26,962 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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:17:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:17:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-14 18:17:27,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:27,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-14 18:17:27,015 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 18:17:27,016 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 18:17:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:27,021 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:17:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:17:27,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:27,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:27,022 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 18:17:27,022 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 18:17:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:27,027 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:17:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:17:27,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:27,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:27,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:27,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:17:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-14 18:17:27,033 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2018-11-14 18:17:27,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:27,034 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-14 18:17:27,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:17:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:17:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 18:17:27,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:27,035 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:27,036 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:27,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:27,036 INFO L82 PathProgramCache]: Analyzing trace with hash -525234885, now seen corresponding path program 1 times [2018-11-14 18:17:27,037 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:27,037 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:17:27,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:27,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:27,214 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 5 treesize of output 1 [2018-11-14 18:17:27,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:27,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:27,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-14 18:17:27,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2018-11-14 18:17:27,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {272#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {272#true} is VALID [2018-11-14 18:17:27,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-14 18:17:27,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {272#true} {272#true} #144#return; {272#true} is VALID [2018-11-14 18:17:27,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {272#true} call #t~ret17 := main(); {272#true} is VALID [2018-11-14 18:17:27,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {272#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {292#(not (= main_~list~0.base main_~null~0.base))} is VALID [2018-11-14 18:17:27,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {292#(not (= main_~list~0.base main_~null~0.base))} assume true; {292#(not (= main_~list~0.base main_~null~0.base))} is VALID [2018-11-14 18:17:27,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#(not (= main_~list~0.base main_~null~0.base))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {292#(not (= main_~list~0.base main_~null~0.base))} is VALID [2018-11-14 18:17:27,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#(not (= main_~list~0.base main_~null~0.base))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {302#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 18:17:27,410 INFO L273 TraceCheckUtils]: 9: Hoare triple {302#(not (= main_~end~0.base main_~null~0.base))} assume true; {302#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 18:17:27,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {302#(not (= main_~end~0.base main_~null~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {273#false} is VALID [2018-11-14 18:17:27,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {273#false} assume !false; {273#false} is VALID [2018-11-14 18:17:27,415 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:17:27,415 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:17:27,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:27,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:17:27,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 18:17:27,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:27,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:17:27,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:27,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:17:27,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:17:27,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:17:27,483 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2018-11-14 18:17:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:27,971 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-14 18:17:27,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:17:27,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 18:17:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:17:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-14 18:17:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:17:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-14 18:17:27,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2018-11-14 18:17:28,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:28,142 INFO L225 Difference]: With dead ends: 41 [2018-11-14 18:17:28,142 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 18:17:28,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:17:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 18:17:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-14 18:17:28,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:28,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states. [2018-11-14 18:17:28,169 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states. [2018-11-14 18:17:28,169 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states. [2018-11-14 18:17:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:28,172 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-14 18:17:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 18:17:28,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:28,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:28,173 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states. [2018-11-14 18:17:28,173 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states. [2018-11-14 18:17:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:28,177 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-14 18:17:28,177 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 18:17:28,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:28,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:28,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:28,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:17:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-14 18:17:28,181 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2018-11-14 18:17:28,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:28,181 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-14 18:17:28,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:17:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 18:17:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:17:28,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:28,182 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:28,183 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:28,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:28,183 INFO L82 PathProgramCache]: Analyzing trace with hash -702652304, now seen corresponding path program 1 times [2018-11-14 18:17:28,184 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:28,184 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:17:28,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:28,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:28,298 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 24 [2018-11-14 18:17:28,306 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:17:28,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:28,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-14 18:17:28,422 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 24 treesize of output 23 [2018-11-14 18:17:28,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:28,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:28,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:28,516 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:17:28,517 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-11-14 18:17:30,551 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:30,816 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:17:30,825 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:17:30,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:30,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:30,830 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:17:30,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 18:17:30,834 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:30,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {479#true} call ULTIMATE.init(); {479#true} is VALID [2018-11-14 18:17:30,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {479#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {479#true} is VALID [2018-11-14 18:17:30,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {479#true} assume true; {479#true} is VALID [2018-11-14 18:17:30,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {479#true} {479#true} #144#return; {479#true} is VALID [2018-11-14 18:17:30,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {479#true} call #t~ret17 := main(); {479#true} is VALID [2018-11-14 18:17:30,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {479#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:17:30,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:17:30,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:17:30,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:17:30,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume true; {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:17:30,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:17:30,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume true; {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:17:30,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {522#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2018-11-14 18:17:30,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {522#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {480#false} is VALID [2018-11-14 18:17:30,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {480#false} assume !false; {480#false} is VALID [2018-11-14 18:17:30,863 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:17:30,863 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:17:30,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:30,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:17:30,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 18:17:30,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:30,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:17:30,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:30,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:17:30,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:17:30,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:17:30,894 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2018-11-14 18:17:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:32,021 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2018-11-14 18:17:32,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:17:32,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 18:17:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:17:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 18:17:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:17:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 18:17:32,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-14 18:17:32,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:32,165 INFO L225 Difference]: With dead ends: 68 [2018-11-14 18:17:32,165 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 18:17:32,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:17:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 18:17:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2018-11-14 18:17:32,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:32,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 41 states. [2018-11-14 18:17:32,222 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 41 states. [2018-11-14 18:17:32,222 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 41 states. [2018-11-14 18:17:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:32,228 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-14 18:17:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-14 18:17:32,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:32,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:32,230 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 66 states. [2018-11-14 18:17:32,230 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 66 states. [2018-11-14 18:17:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:32,236 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-14 18:17:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-14 18:17:32,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:32,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:32,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:32,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:17:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-14 18:17:32,243 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-11-14 18:17:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:32,244 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-14 18:17:32,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:17:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 18:17:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:17:32,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:32,246 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:32,247 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:32,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:32,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2013090473, now seen corresponding path program 1 times [2018-11-14 18:17:32,250 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:32,251 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:17:32,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:32,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:32,484 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 9 treesize of output 12 [2018-11-14 18:17:32,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, 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 11 [2018-11-14 18:17:32,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:32,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:32,616 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 24 [2018-11-14 18:17:32,624 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:17:32,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:32,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-14 18:17:32,714 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 24 treesize of output 23 [2018-11-14 18:17:32,717 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:32,774 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:32,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:32,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-14 18:17:32,814 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:46, output treesize:32 [2018-11-14 18:17:33,183 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:33,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:17:33,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:17:33,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 18:17:33,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:33,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:33,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-14 18:17:33,334 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:33,430 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 41 treesize of output 35 [2018-11-14 18:17:33,445 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:17:33,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:33,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 61 [2018-11-14 18:17:33,685 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:17:33,688 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 36 treesize of output 35 [2018-11-14 18:17:33,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:34,118 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 27 treesize of output 26 [2018-11-14 18:17:34,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:34,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:17:34,266 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 39 [2018-11-14 18:17:34,271 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-14 18:17:34,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:17:34,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:17:34,421 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 2 xjuncts. [2018-11-14 18:17:34,421 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:48, output treesize:58 [2018-11-14 18:17:34,487 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:34,626 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-14 18:17:34,972 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:17:34,979 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:17:34,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:34,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-14 18:17:34,999 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:35,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:35,038 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 26 treesize of output 24 [2018-11-14 18:17:35,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:17:35,045 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:35,060 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:17:35,060 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:35,068 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:35,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:35,092 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:55, output treesize:3 [2018-11-14 18:17:35,100 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:35,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {794#true} call ULTIMATE.init(); {794#true} is VALID [2018-11-14 18:17:35,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {794#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {794#true} is VALID [2018-11-14 18:17:35,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {794#true} assume true; {794#true} is VALID [2018-11-14 18:17:35,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {794#true} {794#true} #144#return; {794#true} is VALID [2018-11-14 18:17:35,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {794#true} call #t~ret17 := main(); {794#true} is VALID [2018-11-14 18:17:35,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {794#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {814#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:17:35,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {814#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {814#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:17:35,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {814#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32); {821#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:17:35,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {821#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet5 != 0bv32);havoc #t~nondet5;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 18:17:35,135 INFO L273 TraceCheckUtils]: 9: Hoare triple {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} assume true; {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 18:17:35,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 18:17:35,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:17:35,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} assume true; {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:17:35,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:17:35,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} assume true; {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:17:35,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {848#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2018-11-14 18:17:35,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {848#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {795#false} is VALID [2018-11-14 18:17:35,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {795#false} assume !false; {795#false} is VALID [2018-11-14 18:17:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:17:35,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:17:43,773 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 18:17:43,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:43,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:43,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:160, output treesize:1 [2018-11-14 18:17:43,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {795#false} assume !false; {795#false} is VALID [2018-11-14 18:17:43,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {848#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {795#false} is VALID [2018-11-14 18:17:43,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {848#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2018-11-14 18:17:43,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:17:43,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:17:43,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:17:43,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:17:43,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:17:43,808 INFO L273 TraceCheckUtils]: 9: Hoare triple {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} assume true; {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:17:43,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {884#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} assume !(#t~nondet5 != 0bv32);havoc #t~nondet5;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:17:43,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {888#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32)) (v_main_~end~0.base_26 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~end~0.base_26) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32); {884#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} is VALID [2018-11-14 18:17:43,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {888#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32)) (v_main_~end~0.base_26 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~end~0.base_26) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))} assume true; {888#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32)) (v_main_~end~0.base_26 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~end~0.base_26) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:17:43,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {794#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {888#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32)) (v_main_~end~0.base_26 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~end~0.base_26) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))} is VALID [2018-11-14 18:17:43,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {794#true} call #t~ret17 := main(); {794#true} is VALID [2018-11-14 18:17:43,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {794#true} {794#true} #144#return; {794#true} is VALID [2018-11-14 18:17:43,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {794#true} assume true; {794#true} is VALID [2018-11-14 18:17:43,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {794#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {794#true} is VALID [2018-11-14 18:17:43,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {794#true} call ULTIMATE.init(); {794#true} is VALID [2018-11-14 18:17:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:17:43,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:17:43,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-14 18:17:43,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 18:17:43,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:43,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:17:43,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:43,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:17:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:17:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=81, Unknown=3, NotChecked=0, Total=110 [2018-11-14 18:17:43,923 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 11 states. [2018-11-14 18:17:44,595 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2018-11-14 18:17:45,068 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-14 18:17:55,319 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-11-14 18:17:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:56,561 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2018-11-14 18:17:56,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:17:56,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 18:17:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:17:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-14 18:17:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:17:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-14 18:17:56,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 77 transitions. [2018-11-14 18:17:56,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:56,829 INFO L225 Difference]: With dead ends: 82 [2018-11-14 18:17:56,829 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 18:17:56,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=112, Invalid=265, Unknown=3, NotChecked=0, Total=380 [2018-11-14 18:17:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 18:17:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 30. [2018-11-14 18:17:56,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:56,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 30 states. [2018-11-14 18:17:56,882 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 30 states. [2018-11-14 18:17:56,882 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 30 states. [2018-11-14 18:17:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:56,886 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-14 18:17:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-11-14 18:17:56,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:56,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:56,888 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 80 states. [2018-11-14 18:17:56,888 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 80 states. [2018-11-14 18:17:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:56,892 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-14 18:17:56,892 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-11-14 18:17:56,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:56,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:56,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:56,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:17:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-14 18:17:56,895 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-11-14 18:17:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:56,896 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-14 18:17:56,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:17:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 18:17:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:17:56,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:56,897 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:17:56,897 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:56,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:56,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1167298014, now seen corresponding path program 1 times [2018-11-14 18:17:56,898 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:56,898 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:17:56,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:56,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:57,047 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 19 treesize of output 15 [2018-11-14 18:17:57,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-14 18:17:57,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:57,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:57,056 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:17:57,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-14 18:17:57,061 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:57,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {1223#true} call ULTIMATE.init(); {1223#true} is VALID [2018-11-14 18:17:57,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {1223#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1223#true} is VALID [2018-11-14 18:17:57,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {1223#true} assume true; {1223#true} is VALID [2018-11-14 18:17:57,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1223#true} {1223#true} #144#return; {1223#true} is VALID [2018-11-14 18:17:57,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {1223#true} call #t~ret17 := main(); {1223#true} is VALID [2018-11-14 18:17:57,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {1223#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1223#true} is VALID [2018-11-14 18:17:57,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {1223#true} assume true; {1223#true} is VALID [2018-11-14 18:17:57,075 INFO L273 TraceCheckUtils]: 7: Hoare triple {1223#true} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {1223#true} is VALID [2018-11-14 18:17:57,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {1223#true} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1223#true} is VALID [2018-11-14 18:17:57,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {1223#true} assume true; {1223#true} is VALID [2018-11-14 18:17:57,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {1223#true} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1223#true} is VALID [2018-11-14 18:17:57,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {1223#true} assume true; {1223#true} is VALID [2018-11-14 18:17:57,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {1223#true} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1264#(= |main_#t~mem8| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:17:57,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {1264#(= |main_#t~mem8| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:17:57,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:17:57,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 18:17:57,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1278#(= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2018-11-14 18:17:57,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {1278#(= ~unnamed1~0~BLACK |main_#t~mem9|)} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1224#false} is VALID [2018-11-14 18:17:57,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {1224#false} assume true; {1224#false} is VALID [2018-11-14 18:17:57,119 INFO L273 TraceCheckUtils]: 19: Hoare triple {1224#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1224#false} is VALID [2018-11-14 18:17:57,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {1224#false} assume !false; {1224#false} is VALID [2018-11-14 18:17:57,119 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:17:57,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:17:57,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:17:57,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:17:57,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 18:17:57,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:57,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:17:57,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:57,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:17:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:17:57,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:17:57,149 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-11-14 18:17:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:58,108 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 18:17:58,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:17:58,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 18:17:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:17:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:17:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 18:17:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:17:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 18:17:58,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-14 18:17:58,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:58,192 INFO L225 Difference]: With dead ends: 48 [2018-11-14 18:17:58,192 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:17:58,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:17:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:17:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 18:17:58,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:17:58,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 18:17:58,319 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 18:17:58,319 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 18:17:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:58,322 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:17:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:17:58,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:58,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:58,322 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 18:17:58,323 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 18:17:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:17:58,324 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:17:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:17:58,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:17:58,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:17:58,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:17:58,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:17:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:17:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-14 18:17:58,327 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2018-11-14 18:17:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:17:58,327 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-14 18:17:58,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:17:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 18:17:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:17:58,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:17:58,328 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] [2018-11-14 18:17:58,328 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:17:58,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:17:58,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1449495770, now seen corresponding path program 1 times [2018-11-14 18:17:58,329 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:17:58,329 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:17:58,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:17:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:17:58,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:17:58,564 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 27 treesize of output 20 [2018-11-14 18:17:58,579 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:17:58,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:58,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-14 18:17:58,749 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 20 treesize of output 19 [2018-11-14 18:17:58,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:58,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:58,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:58,961 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 27 treesize of output 20 [2018-11-14 18:17:58,969 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:17:58,970 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:59,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-14 18:17:59,051 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 20 treesize of output 19 [2018-11-14 18:17:59,057 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:59,162 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 17 treesize of output 17 [2018-11-14 18:17:59,167 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:59,192 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:17:59,314 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:17:59,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:17:59,349 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:67 [2018-11-14 18:18:01,487 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:01,653 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-11-14 18:18:01,850 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 46 treesize of output 52 [2018-11-14 18:18:01,873 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 48 treesize of output 41 [2018-11-14 18:18:01,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:01,961 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 41 treesize of output 39 [2018-11-14 18:18:01,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,027 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 37 treesize of output 31 [2018-11-14 18:18:02,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,134 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 28 treesize of output 30 [2018-11-14 18:18:02,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-14 18:18:02,161 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,213 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 14 [2018-11-14 18:18:02,214 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,255 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 22 treesize of output 13 [2018-11-14 18:18:02,262 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,292 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:18:02,354 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 28 [2018-11-14 18:18:02,361 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 11 treesize of output 7 [2018-11-14 18:18:02,364 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,378 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,431 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:02,442 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 11 treesize of output 7 [2018-11-14 18:18:02,443 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,453 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:02,477 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:79, output treesize:10 [2018-11-14 18:18:02,488 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:02,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2018-11-14 18:18:02,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {1456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1456#true} is VALID [2018-11-14 18:18:02,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2018-11-14 18:18:02,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #144#return; {1456#true} is VALID [2018-11-14 18:18:02,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret17 := main(); {1456#true} is VALID [2018-11-14 18:18:02,524 INFO L273 TraceCheckUtils]: 5: Hoare triple {1456#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 18:18:02,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} assume true; {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 18:18:02,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 18:18:02,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-14 18:18:02,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume true; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-14 18:18:02,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-14 18:18:02,535 INFO L273 TraceCheckUtils]: 11: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume true; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-14 18:18:02,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-14 18:18:02,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-14 18:18:02,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume true; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-14 18:18:02,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume true; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-14 18:18:02,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-14 18:18:02,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-14 18:18:02,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1517#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 18:18:02,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {1517#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} assume true; {1517#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 18:18:02,544 INFO L273 TraceCheckUtils]: 20: Hoare triple {1517#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1457#false} is VALID [2018-11-14 18:18:02,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {1457#false} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1457#false} is VALID [2018-11-14 18:18:02,545 INFO L273 TraceCheckUtils]: 22: Hoare triple {1457#false} assume true; {1457#false} is VALID [2018-11-14 18:18:02,545 INFO L273 TraceCheckUtils]: 23: Hoare triple {1457#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1457#false} is VALID [2018-11-14 18:18:02,545 INFO L273 TraceCheckUtils]: 24: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2018-11-14 18:18:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:18:02,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:18:02,744 INFO L273 TraceCheckUtils]: 24: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2018-11-14 18:18:02,745 INFO L273 TraceCheckUtils]: 23: Hoare triple {1457#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1457#false} is VALID [2018-11-14 18:18:02,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {1457#false} assume true; {1457#false} is VALID [2018-11-14 18:18:02,746 INFO L273 TraceCheckUtils]: 21: Hoare triple {1457#false} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1457#false} is VALID [2018-11-14 18:18:02,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {1548#(and (= main_~end~0.offset main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1457#false} is VALID [2018-11-14 18:18:02,761 INFO L273 TraceCheckUtils]: 19: Hoare triple {1548#(and (= main_~end~0.offset main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} assume true; {1548#(and (= main_~end~0.offset main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 18:18:02,762 INFO L273 TraceCheckUtils]: 18: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1548#(and (= main_~end~0.offset main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 18:18:02,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:18:02,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:18:02,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:18:02,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:18:02,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:18:02,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:18:02,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:18:02,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:18:02,771 INFO L273 TraceCheckUtils]: 9: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:18:02,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:18:02,776 INFO L273 TraceCheckUtils]: 7: Hoare triple {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} is VALID [2018-11-14 18:18:02,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} assume true; {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} is VALID [2018-11-14 18:18:02,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {1456#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} is VALID [2018-11-14 18:18:02,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret17 := main(); {1456#true} is VALID [2018-11-14 18:18:02,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #144#return; {1456#true} is VALID [2018-11-14 18:18:02,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2018-11-14 18:18:02,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {1456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1456#true} is VALID [2018-11-14 18:18:02,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2018-11-14 18:18:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:18:02,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:18:02,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 18:18:02,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-14 18:18:02,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:18:02,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:18:02,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:02,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:18:02,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:18:02,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:18:02,852 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-11-14 18:18:03,319 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-11-14 18:18:04,430 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-11-14 18:18:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:04,572 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-14 18:18:04,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:18:04,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-14 18:18:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:18:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:18:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-14 18:18:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:18:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-14 18:18:04,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2018-11-14 18:18:04,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:18:04,709 INFO L225 Difference]: With dead ends: 62 [2018-11-14 18:18:04,709 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 18:18:04,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:18:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 18:18:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 18:18:04,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:18:04,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 18:18:04,762 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 18:18:04,762 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 18:18:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:04,765 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 18:18:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 18:18:04,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:04,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:04,766 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 18:18:04,766 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 18:18:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:18:04,767 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 18:18:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 18:18:04,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:18:04,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:18:04,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:18:04,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:18:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:18:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-14 18:18:04,770 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 25 [2018-11-14 18:18:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:18:04,770 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-14 18:18:04,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:18:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 18:18:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:18:04,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:18:04,771 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] [2018-11-14 18:18:04,771 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:18:04,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:18:04,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1709093407, now seen corresponding path program 1 times [2018-11-14 18:18:04,772 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:18:04,772 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:04,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:18:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:18:04,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:18:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-14 18:18:05,021 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 12 treesize of output 11 [2018-11-14 18:18:05,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:23 [2018-11-14 18:18:05,057 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:05,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:05,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:05,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:05,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 30 [2018-11-14 18:18:05,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 18:18:05,439 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:05,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 18:18:05,509 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:05,515 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,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, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 18:18:05,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:18:05,685 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:05,760 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 19 treesize of output 29 [2018-11-14 18:18:05,771 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 18 treesize of output 16 [2018-11-14 18:18:05,775 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,791 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,801 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:05,850 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:85, output treesize:57 [2018-11-14 18:18:07,525 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:07,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:07,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:07,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:07,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:07,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:07,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-11-14 18:18:07,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:08,041 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:18:08,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2018-11-14 18:18:08,054 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 23 treesize of output 15 [2018-11-14 18:18:08,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:08,356 INFO L303 Elim1Store]: Index analysis took 200 ms [2018-11-14 18:18:08,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-11-14 18:18:08,412 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:08,439 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,547 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:08,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:08,666 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:08,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:08,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 88 [2018-11-14 18:18:08,759 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 59 [2018-11-14 18:18:08,770 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 18:18:08,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:08,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:08,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:08,876 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:08,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2018-11-14 18:18:08,891 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 31 treesize of output 28 [2018-11-14 18:18:08,895 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,948 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:08,973 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,033 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:156, output treesize:75 [2018-11-14 18:18:09,334 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:09,669 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:09,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:09,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:09,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 57 [2018-11-14 18:18:09,697 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:18:09,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-14 18:18:09,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,765 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:09,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:09,809 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:18:09,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:49 [2018-11-14 18:18:09,823 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:10,074 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:10,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:10,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:10,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:10,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:10,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:18:10,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-11-14 18:18:10,171 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 51 [2018-11-14 18:18:10,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:10,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-14 18:18:10,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:10,288 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:18:10,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:10,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:18:10,309 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:10,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:4 [2018-11-14 18:18:10,316 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:18:10,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {1802#true} call ULTIMATE.init(); {1802#true} is VALID [2018-11-14 18:18:10,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {1802#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1802#true} is VALID [2018-11-14 18:18:10,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {1802#true} assume true; {1802#true} is VALID [2018-11-14 18:18:10,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1802#true} {1802#true} #144#return; {1802#true} is VALID [2018-11-14 18:18:10,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {1802#true} call #t~ret17 := main(); {1802#true} is VALID [2018-11-14 18:18:10,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {1802#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1822#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:18:10,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {1822#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} assume true; {1822#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:18:10,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {1822#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32); {1829#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (not (= main_~end~0.base main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~end~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~end~0.offset)) (= main_~list~0.offset (_ bv0 32)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:18:10,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {1829#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (not (= main_~end~0.base main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~end~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~end~0.offset)) (= main_~list~0.offset (_ bv0 32)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !(#t~nondet5 != 0bv32);havoc #t~nondet5;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} is VALID [2018-11-14 18:18:10,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} assume true; {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} is VALID [2018-11-14 18:18:10,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} is VALID [2018-11-14 18:18:10,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:10,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume true; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:10,377 INFO L273 TraceCheckUtils]: 13: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:10,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume true; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:10,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:10,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:10,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume true; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:10,389 INFO L273 TraceCheckUtils]: 18: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume true; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:10,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:10,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:18:10,397 INFO L273 TraceCheckUtils]: 21: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1874#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} is VALID [2018-11-14 18:18:10,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {1874#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} assume true; {1874#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} is VALID [2018-11-14 18:18:10,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {1874#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1881#(and (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} is VALID [2018-11-14 18:18:10,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {1881#(and (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1885#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 18:18:10,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {1885#(not (= main_~end~0.base main_~null~0.base))} assume true; {1885#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 18:18:10,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {1885#(not (= main_~end~0.base main_~null~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1803#false} is VALID [2018-11-14 18:18:10,404 INFO L273 TraceCheckUtils]: 27: Hoare triple {1803#false} assume !false; {1803#false} is VALID [2018-11-14 18:18:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:18:10,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:18:11,277 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-14 18:18:13,398 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 263 treesize of output 208 [2018-11-14 18:18:13,412 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:13,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:13,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 186 [2018-11-14 18:18:14,917 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-14 18:18:14,934 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 159 treesize of output 158 [2018-11-14 18:18:14,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:14,944 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 159 treesize of output 158 [2018-11-14 18:18:14,948 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:15,883 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 158 treesize of output 159 [2018-11-14 18:18:15,886 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:15,906 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 158 treesize of output 159 [2018-11-14 18:18:15,910 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:16,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 166 [2018-11-14 18:18:17,028 INFO L303 Elim1Store]: Index analysis took 106 ms [2018-11-14 18:18:17,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 142 [2018-11-14 18:18:17,064 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:17,620 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 153 treesize of output 147 [2018-11-14 18:18:17,624 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:18,159 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 150 treesize of output 146 [2018-11-14 18:18:18,164 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:18:18,809 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 146 treesize of output 140 [2018-11-14 18:18:18,812 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:19,309 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 147 treesize of output 137 [2018-11-14 18:18:19,315 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:18:19,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-14 18:18:19,808 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:20,231 INFO L267 ElimStorePlain]: Start of recursive call 9: 6 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-14 18:18:20,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 166 [2018-11-14 18:18:20,396 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 150 treesize of output 146 [2018-11-14 18:18:20,402 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:18:21,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-14 18:18:21,044 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:21,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 150 [2018-11-14 18:18:21,842 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:22,381 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 146 treesize of output 140 [2018-11-14 18:18:22,384 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:23,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 147 [2018-11-14 18:18:23,133 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:23,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-14 18:18:23,683 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:24,260 INFO L267 ElimStorePlain]: Start of recursive call 16: 6 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-14 18:18:26,967 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 159 treesize of output 159 [2018-11-14 18:18:26,984 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 154 treesize of output 150 [2018-11-14 18:18:27,002 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:18:27,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 143 [2018-11-14 18:18:27,354 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:27,663 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 150 treesize of output 138 [2018-11-14 18:18:27,665 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:27,898 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 18:18:27,949 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 159 treesize of output 159 [2018-11-14 18:18:27,967 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 154 treesize of output 150 [2018-11-14 18:18:27,971 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:18:28,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 151 [2018-11-14 18:18:28,348 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:28,691 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 150 treesize of output 138 [2018-11-14 18:18:28,694 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:28,936 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 18:18:32,255 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 158 treesize of output 172 [2018-11-14 18:18:33,823 WARN L179 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 134 [2018-11-14 18:18:33,843 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 150 treesize of output 146 [2018-11-14 18:18:33,848 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:18:35,420 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 146 treesize of output 140 [2018-11-14 18:18:35,423 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:37,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 150 [2018-11-14 18:18:37,032 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:40,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 138 [2018-11-14 18:18:40,239 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:40,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 148 [2018-11-14 18:18:40,321 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:43,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 147 [2018-11-14 18:18:43,333 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:44,571 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 153 treesize of output 149 [2018-11-14 18:18:44,579 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:18:46,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 150 [2018-11-14 18:18:46,085 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:47,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-14 18:18:47,451 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:49,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 150 [2018-11-14 18:18:49,053 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:50,374 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 149 treesize of output 137 [2018-11-14 18:18:50,377 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-14 18:18:52,179 INFO L267 ElimStorePlain]: Start of recursive call 31: 10 dim-1 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-11-14 18:18:52,389 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 158 treesize of output 172 [2018-11-14 18:18:55,576 WARN L179 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2018-11-14 18:18:55,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 139 [2018-11-14 18:18:55,673 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:56,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 142 [2018-11-14 18:18:56,990 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:18:58,287 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 150 treesize of output 146 [2018-11-14 18:18:58,294 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:18:59,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 142 [2018-11-14 18:18:59,717 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:19:01,015 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 146 treesize of output 140 [2018-11-14 18:19:01,018 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:03,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 142 [2018-11-14 18:19:03,163 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:19:04,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-14 18:19:04,513 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:19:05,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-14 18:19:05,905 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.