/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:27:20,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:27:20,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:27:20,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:27:20,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:27:20,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:27:20,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:27:20,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:27:20,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:27:20,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:27:20,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:27:20,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:27:20,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:27:20,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:27:20,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:27:20,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:27:20,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:27:20,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:27:20,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:27:20,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:27:20,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:27:20,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:27:20,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:27:20,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:27:20,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:27:20,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:27:20,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:27:20,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:27:20,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:27:20,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:27:20,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:27:20,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:27:20,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:27:20,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:27:20,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:27:20,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:27:20,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:27:20,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:27:20,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:27:20,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:27:20,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:27:20,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:27:20,158 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:27:20,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:27:20,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:27:20,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:27:20,164 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:27:20,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:27:20,164 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:27:20,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:27:20,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:27:20,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:27:20,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:27:20,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:27:20,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:27:20,167 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:27:20,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:27:20,167 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:27:20,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:27:20,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:27:20,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:27:20,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:27:20,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:27:20,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:27:20,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:27:20,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:27:20,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:27:20,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:27:20,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:27:20,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:27:20,172 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:27:20,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:27:20,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:27:20,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:27:20,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:27:20,479 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:27:20,479 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:27:20,480 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i [2020-07-08 12:27:20,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2a9f62f/c32b11be9e3b4bf2bed24401620e1110/FLAG5e45cf109 [2020-07-08 12:27:21,087 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:27:21,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i [2020-07-08 12:27:21,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2a9f62f/c32b11be9e3b4bf2bed24401620e1110/FLAG5e45cf109 [2020-07-08 12:27:21,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2a9f62f/c32b11be9e3b4bf2bed24401620e1110 [2020-07-08 12:27:21,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:27:21,404 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:27:21,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:27:21,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:27:21,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:27:21,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:27:21" (1/1) ... [2020-07-08 12:27:21,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e91605f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:21, skipping insertion in model container [2020-07-08 12:27:21,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:27:21" (1/1) ... [2020-07-08 12:27:21,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:27:21,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:27:21,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:27:21,954 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:27:22,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:27:22,093 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:27:22,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:22 WrapperNode [2020-07-08 12:27:22,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:27:22,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:27:22,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:27:22,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:27:22,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:22" (1/1) ... [2020-07-08 12:27:22,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:22" (1/1) ... [2020-07-08 12:27:22,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:22" (1/1) ... [2020-07-08 12:27:22,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:22" (1/1) ... [2020-07-08 12:27:22,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:22" (1/1) ... [2020-07-08 12:27:22,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:22" (1/1) ... [2020-07-08 12:27:22,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:22" (1/1) ... [2020-07-08 12:27:22,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:27:22,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:27:22,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:27:22,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:27:22,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:22" (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 [2020-07-08 12:27:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:27:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:27:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:27:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-08 12:27:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-08 12:27:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-08 12:27:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-08 12:27:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-08 12:27:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-08 12:27:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-08 12:27:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-08 12:27:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-08 12:27:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-08 12:27:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-08 12:27:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-08 12:27:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-08 12:27:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-08 12:27:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-08 12:27:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-08 12:27:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-08 12:27:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-08 12:27:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-08 12:27:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-08 12:27:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-08 12:27:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-08 12:27:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-08 12:27:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-08 12:27:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-08 12:27:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-08 12:27:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-08 12:27:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-08 12:27:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-08 12:27:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-08 12:27:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-08 12:27:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-08 12:27:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-08 12:27:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-08 12:27:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-08 12:27:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-08 12:27:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-08 12:27:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-08 12:27:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-08 12:27:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-08 12:27:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-08 12:27:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-08 12:27:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-08 12:27:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-08 12:27:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-08 12:27:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-08 12:27:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-08 12:27:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-08 12:27:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-08 12:27:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-08 12:27:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:27:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 12:27:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-08 12:27:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 12:27:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-08 12:27:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-08 12:27:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-08 12:27:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-08 12:27:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-08 12:27:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:27:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-08 12:27:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-08 12:27:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-08 12:27:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-08 12:27:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-08 12:27:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-08 12:27:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-08 12:27:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-08 12:27:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-08 12:27:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-08 12:27:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-08 12:27:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-08 12:27:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-08 12:27:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-08 12:27:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-08 12:27:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-08 12:27:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-08 12:27:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-08 12:27:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-08 12:27:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-08 12:27:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-08 12:27:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-08 12:27:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-08 12:27:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-08 12:27:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-08 12:27:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-08 12:27:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-08 12:27:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-08 12:27:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-08 12:27:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-08 12:27:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-08 12:27:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-08 12:27:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-08 12:27:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-08 12:27:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-08 12:27:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-08 12:27:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-08 12:27:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-08 12:27:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-08 12:27:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-08 12:27:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-08 12:27:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-08 12:27:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-08 12:27:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:27:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:27:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:27:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:27:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:27:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 12:27:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 12:27:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:27:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:27:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:27:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:27:23,013 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:27:23,013 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-08 12:27:23,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:27:23 BoogieIcfgContainer [2020-07-08 12:27:23,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:27:23,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:27:23,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:27:23,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:27:23,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:27:21" (1/3) ... [2020-07-08 12:27:23,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2890291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:27:23, skipping insertion in model container [2020-07-08 12:27:23,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:22" (2/3) ... [2020-07-08 12:27:23,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2890291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:27:23, skipping insertion in model container [2020-07-08 12:27:23,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:27:23" (3/3) ... [2020-07-08 12:27:23,026 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2020-07-08 12:27:23,037 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:27:23,044 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-07-08 12:27:23,055 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-07-08 12:27:23,074 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:27:23,074 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:27:23,074 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:27:23,074 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:27:23,075 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:27:23,075 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:27:23,075 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:27:23,075 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:27:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-08 12:27:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:27:23,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:23,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:23,099 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:23,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash -742552803, now seen corresponding path program 1 times [2020-07-08 12:27:23,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:23,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491843453] [2020-07-08 12:27:23,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:23,381 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {41#true} is VALID [2020-07-08 12:27:23,382 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-08 12:27:23,383 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #136#return; {41#true} is VALID [2020-07-08 12:27:23,386 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:23,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {41#true} is VALID [2020-07-08 12:27:23,387 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-08 12:27:23,388 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #136#return; {41#true} is VALID [2020-07-08 12:27:23,388 INFO L263 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret17 := main(); {41#true} is VALID [2020-07-08 12:27:23,389 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {41#true} is VALID [2020-07-08 12:27:23,390 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} assume !true; {42#false} is VALID [2020-07-08 12:27:23,390 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#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; {42#false} is VALID [2020-07-08 12:27:23,390 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {42#false} is VALID [2020-07-08 12:27:23,391 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-08 12:27:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:23,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491843453] [2020-07-08 12:27:23,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:23,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:27:23,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305671650] [2020-07-08 12:27:23,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-08 12:27:23,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:23,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:27:23,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:23,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:27:23,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:23,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:27:23,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:27:23,442 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-07-08 12:27:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:23,664 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. [2020-07-08 12:27:23,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:27:23,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-08 12:27:23,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:27:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2020-07-08 12:27:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:27:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2020-07-08 12:27:23,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2020-07-08 12:27:23,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:23,813 INFO L225 Difference]: With dead ends: 67 [2020-07-08 12:27:23,813 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 12:27:23,817 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:27:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 12:27:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-08 12:27:23,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:23,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-08 12:27:23,863 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-08 12:27:23,864 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-08 12:27:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:23,868 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-08 12:27:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-08 12:27:23,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:23,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:23,870 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-08 12:27:23,870 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-08 12:27:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:23,874 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-08 12:27:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-08 12:27:23,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:23,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:23,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:23,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 12:27:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-08 12:27:23,880 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2020-07-08 12:27:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:23,880 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-08 12:27:23,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:27:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-08 12:27:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-08 12:27:23,881 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:23,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:23,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:27:23,882 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:23,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:23,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1556669446, now seen corresponding path program 1 times [2020-07-08 12:27:23,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:23,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874620926] [2020-07-08 12:27:23,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:24,000 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {225#true} is VALID [2020-07-08 12:27:24,000 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-08 12:27:24,001 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #136#return; {225#true} is VALID [2020-07-08 12:27:24,002 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:24,002 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {225#true} is VALID [2020-07-08 12:27:24,003 INFO L280 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-08 12:27:24,003 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #136#return; {225#true} is VALID [2020-07-08 12:27:24,003 INFO L263 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret17 := main(); {225#true} is VALID [2020-07-08 12:27:24,006 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {230#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-08 12:27:24,007 INFO L280 TraceCheckUtils]: 6: Hoare triple {230#(not (= main_~list~0.base main_~null~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {230#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-08 12:27:24,008 INFO L280 TraceCheckUtils]: 7: Hoare triple {230#(not (= main_~list~0.base main_~null~0.base))} assume !(0 != #t~nondet2);havoc #t~nondet2; {230#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-08 12:27:24,009 INFO L280 TraceCheckUtils]: 8: Hoare triple {230#(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; {231#(not (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-08 12:27:24,010 INFO L280 TraceCheckUtils]: 9: Hoare triple {231#(not (= main_~null~0.base main_~end~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {226#false} is VALID [2020-07-08 12:27:24,010 INFO L280 TraceCheckUtils]: 10: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-08 12:27:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:24,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874620926] [2020-07-08 12:27:24,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:24,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:27:24,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709582680] [2020-07-08 12:27:24,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-08 12:27:24,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:24,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:27:24,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:24,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:27:24,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:27:24,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:27:24,032 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2020-07-08 12:27:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:24,293 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-08 12:27:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:27:24,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-08 12:27:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:27:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-08 12:27:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:27:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-08 12:27:24,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-08 12:27:24,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:24,375 INFO L225 Difference]: With dead ends: 37 [2020-07-08 12:27:24,375 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:27:24,376 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:27:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:27:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2020-07-08 12:27:24,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:24,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 29 states. [2020-07-08 12:27:24,391 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 29 states. [2020-07-08 12:27:24,392 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 29 states. [2020-07-08 12:27:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:24,395 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-08 12:27:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-08 12:27:24,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:24,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:24,397 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 35 states. [2020-07-08 12:27:24,397 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 35 states. [2020-07-08 12:27:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:24,400 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-08 12:27:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-08 12:27:24,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:24,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:24,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:24,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 12:27:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-08 12:27:24,404 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2020-07-08 12:27:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:24,405 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-08 12:27:24,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:27:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-08 12:27:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:27:24,406 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:24,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:24,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:27:24,407 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:24,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1973625457, now seen corresponding path program 1 times [2020-07-08 12:27:24,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:24,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590969911] [2020-07-08 12:27:24,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:24,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {397#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {388#true} is VALID [2020-07-08 12:27:24,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {388#true} assume true; {388#true} is VALID [2020-07-08 12:27:24,719 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {388#true} {388#true} #136#return; {388#true} is VALID [2020-07-08 12:27:24,720 INFO L263 TraceCheckUtils]: 0: Hoare triple {388#true} call ULTIMATE.init(); {397#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:24,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {397#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {388#true} is VALID [2020-07-08 12:27:24,720 INFO L280 TraceCheckUtils]: 2: Hoare triple {388#true} assume true; {388#true} is VALID [2020-07-08 12:27:24,721 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {388#true} {388#true} #136#return; {388#true} is VALID [2020-07-08 12:27:24,721 INFO L263 TraceCheckUtils]: 4: Hoare triple {388#true} call #t~ret17 := main(); {388#true} is VALID [2020-07-08 12:27:24,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {388#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {393#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} is VALID [2020-07-08 12:27:24,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {393#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {393#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} is VALID [2020-07-08 12:27:24,727 INFO L280 TraceCheckUtils]: 7: Hoare triple {393#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} assume !(0 != #t~nondet2);havoc #t~nondet2; {393#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} is VALID [2020-07-08 12:27:24,728 INFO L280 TraceCheckUtils]: 8: Hoare triple {393#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 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; {394#(and (= 0 main_~null~0.offset) (= main_~end~0.offset main_~null~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2020-07-08 12:27:24,729 INFO L280 TraceCheckUtils]: 9: Hoare triple {394#(and (= 0 main_~null~0.offset) (= main_~end~0.offset main_~null~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {395#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-08 12:27:24,730 INFO L280 TraceCheckUtils]: 10: Hoare triple {395#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {395#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-08 12:27:24,731 INFO L280 TraceCheckUtils]: 11: Hoare triple {395#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {396#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-08 12:27:24,732 INFO L280 TraceCheckUtils]: 12: Hoare triple {396#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {389#false} is VALID [2020-07-08 12:27:24,733 INFO L280 TraceCheckUtils]: 13: Hoare triple {389#false} assume !false; {389#false} is VALID [2020-07-08 12:27:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:24,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590969911] [2020-07-08 12:27:24,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:24,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:27:24,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417834535] [2020-07-08 12:27:24,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-08 12:27:24,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:24,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:27:24,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:24,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:27:24,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:27:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:27:24,761 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2020-07-08 12:27:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:25,416 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2020-07-08 12:27:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:27:25,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-08 12:27:25,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:27:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-08 12:27:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:27:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-08 12:27:25,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2020-07-08 12:27:25,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:25,541 INFO L225 Difference]: With dead ends: 61 [2020-07-08 12:27:25,541 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 12:27:25,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:27:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 12:27:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2020-07-08 12:27:25,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:25,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 39 states. [2020-07-08 12:27:25,593 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 39 states. [2020-07-08 12:27:25,593 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 39 states. [2020-07-08 12:27:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:25,602 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2020-07-08 12:27:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2020-07-08 12:27:25,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:25,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:25,603 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 59 states. [2020-07-08 12:27:25,604 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 59 states. [2020-07-08 12:27:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:25,609 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2020-07-08 12:27:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2020-07-08 12:27:25,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:25,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:25,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:25,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-08 12:27:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2020-07-08 12:27:25,615 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 14 [2020-07-08 12:27:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:25,615 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2020-07-08 12:27:25,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:27:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-08 12:27:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:27:25,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:25,618 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:25,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:27:25,618 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash -954667545, now seen corresponding path program 1 times [2020-07-08 12:27:25,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:25,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719431458] [2020-07-08 12:27:25,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:26,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {657#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {646#true} is VALID [2020-07-08 12:27:26,102 INFO L280 TraceCheckUtils]: 1: Hoare triple {646#true} assume true; {646#true} is VALID [2020-07-08 12:27:26,104 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {646#true} {646#true} #136#return; {646#true} is VALID [2020-07-08 12:27:26,105 INFO L263 TraceCheckUtils]: 0: Hoare triple {646#true} call ULTIMATE.init(); {657#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:26,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {657#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {646#true} is VALID [2020-07-08 12:27:26,106 INFO L280 TraceCheckUtils]: 2: Hoare triple {646#true} assume true; {646#true} is VALID [2020-07-08 12:27:26,106 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {646#true} {646#true} #136#return; {646#true} is VALID [2020-07-08 12:27:26,107 INFO L263 TraceCheckUtils]: 4: Hoare triple {646#true} call #t~ret17 := main(); {646#true} is VALID [2020-07-08 12:27:26,119 INFO L280 TraceCheckUtils]: 5: Hoare triple {646#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {651#(and (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= main_~list~0.offset main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-08 12:27:26,120 INFO L280 TraceCheckUtils]: 6: Hoare triple {651#(and (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= main_~list~0.offset main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {651#(and (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= main_~list~0.offset main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-08 12:27:26,122 INFO L280 TraceCheckUtils]: 7: Hoare triple {651#(and (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= main_~list~0.offset main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~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, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {652#(and (= 0 main_~null~0.offset) (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} is VALID [2020-07-08 12:27:26,124 INFO L280 TraceCheckUtils]: 8: Hoare triple {652#(and (= 0 main_~null~0.offset) (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~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, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {653#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} is VALID [2020-07-08 12:27:26,126 INFO L280 TraceCheckUtils]: 9: Hoare triple {653#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {653#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} is VALID [2020-07-08 12:27:26,126 INFO L280 TraceCheckUtils]: 10: Hoare triple {653#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} assume !(0 != #t~nondet2);havoc #t~nondet2; {653#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= main_~list~0.offset main_~null~0.offset))} is VALID [2020-07-08 12:27:26,127 INFO L280 TraceCheckUtils]: 11: Hoare triple {653#(and (= 0 main_~null~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 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; {654#(and (= 0 main_~null~0.offset) (= main_~end~0.offset main_~null~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2020-07-08 12:27:26,128 INFO L280 TraceCheckUtils]: 12: Hoare triple {654#(and (= 0 main_~null~0.offset) (= main_~end~0.offset main_~null~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {655#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-08 12:27:26,129 INFO L280 TraceCheckUtils]: 13: Hoare triple {655#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {655#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-08 12:27:26,129 INFO L280 TraceCheckUtils]: 14: Hoare triple {655#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {656#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-08 12:27:26,134 INFO L280 TraceCheckUtils]: 15: Hoare triple {656#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {647#false} is VALID [2020-07-08 12:27:26,134 INFO L280 TraceCheckUtils]: 16: Hoare triple {647#false} assume !false; {647#false} is VALID [2020-07-08 12:27:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:26,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719431458] [2020-07-08 12:27:26,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835799965] [2020-07-08 12:27:26,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:26,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-08 12:27:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:26,272 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:26,377 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-08 12:27:26,378 INFO L384 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 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-08 12:27:26,378 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:26,391 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:26,397 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-08 12:27:26,398 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:26,408 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:26,410 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:26,410 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2020-07-08 12:27:26,417 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:26,417 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_21|, |main_#t~malloc0.base|, |v_#memory_int_27|]. (and (= |#valid| (store (store |v_#valid_21| |main_#t~malloc0.base| 1) main_~list~0.base 1)) (= (store |v_#memory_int_27| main_~list~0.base (store (select |v_#memory_int_27| main_~list~0.base) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (<= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base)) [2020-07-08 12:27:26,418 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc0.base|]. (and (<= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| |main_#t~malloc0.base|))) [2020-07-08 12:27:26,519 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:26,520 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-08 12:27:26,522 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:26,570 INFO L624 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2020-07-08 12:27:26,582 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:26,601 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:26,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:26,613 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2020-07-08 12:27:26,614 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:26,627 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:26,634 INFO L544 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. [2020-07-08 12:27:26,634 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:24 [2020-07-08 12:27:26,639 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:26,640 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, v_main_~end~0.offset_23, |v_#memory_int_31|, |v_#valid_22|]. (let ((.cse0 (select |v_#memory_int_31| main_~list~0.base))) (and (= 0 (select |v_#valid_22| main_~end~0.base)) (= (store |v_#memory_int_31| main_~list~0.base (store .cse0 v_main_~end~0.offset_23 (select (select |v_#memory_int_28| main_~list~0.base) v_main_~end~0.offset_23))) |v_#memory_int_28|) (= |#valid| (store |v_#valid_22| main_~end~0.base 1)) (= 1 (select |v_#valid_22| main_~list~0.base)) (= |#memory_int| (store |v_#memory_int_28| main_~end~0.base (store (select |v_#memory_int_28| main_~end~0.base) main_~end~0.offset (select (select |#memory_int| main_~end~0.base) main_~end~0.offset)))) (<= v_main_~end~0.offset_23 main_~list~0.offset) (= ~unnamed1~0~BLACK (select .cse0 (+ main_~list~0.offset 4))))) [2020-07-08 12:27:26,640 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base))) [2020-07-08 12:27:26,783 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:26,784 INFO L384 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-08 12:27:26,790 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:26,819 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:26,822 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_29|, |v_#memory_int_30|], 4=[|v_#memory_int_32|]} [2020-07-08 12:27:26,828 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:26,849 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:26,853 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:26,869 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:26,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:26,921 INFO L350 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2020-07-08 12:27:26,922 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2020-07-08 12:27:26,924 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:26,945 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:26,968 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:26,968 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:77, output treesize:40 [2020-07-08 12:27:29,045 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:29,046 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_29|, |main_#t~malloc6.base|, main_~end~0.offset, |v_#memory_int_30|, v_main_~end~0.base_24, |v_#valid_23|, |v_#memory_int_32|, v_main_~end~0.offset_24]. (let ((.cse0 (select |v_#memory_int_29| |main_#t~malloc6.base|))) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= |v_#memory_int_29| (store |v_#memory_int_30| |main_#t~malloc6.base| (store (select |v_#memory_int_30| |main_#t~malloc6.base|) main_~end~0.offset (select .cse0 main_~end~0.offset)))) (= 1 (select |v_#valid_23| main_~list~0.base)) (= 0 (select |v_#valid_23| |main_#t~malloc6.base|)) (= 1 (select |v_#valid_23| v_main_~end~0.base_24)) (= ~unnamed1~0~BLACK (select (select |v_#memory_int_32| main_~list~0.base) (+ main_~list~0.offset 4))) (= (store |v_#memory_int_29| |main_#t~malloc6.base| (store .cse0 (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |v_#memory_int_32| v_main_~end~0.base_24 (store (store (select |v_#memory_int_32| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4) ~unnamed1~0~RED) v_main_~end~0.offset_24 (select (select |v_#memory_int_30| v_main_~end~0.base_24) v_main_~end~0.offset_24))) |v_#memory_int_30|))) [2020-07-08 12:27:29,046 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc6.base|, main_~end~0.offset, v_main_~end~0.base_24, v_main_~end~0.offset_24]. (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED)) [2020-07-08 12:27:29,543 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2020-07-08 12:27:29,546 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:29,553 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:29,557 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:29,557 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-07-08 12:27:29,562 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:29,563 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~end~0.base, main_~end~0.offset, |main_#t~malloc6.base|, v_prenex_1, v_main_~end~0.base_24, v_main_~end~0.offset_24]. (let ((.cse0 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= |main_#t~malloc6.base| main_~end~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= .cse0 |main_#t~mem8|) (= .cse0 ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) [2020-07-08 12:27:29,563 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= ~unnamed1~0~BLACK |main_#t~mem8|) [2020-07-08 12:27:29,565 INFO L263 TraceCheckUtils]: 0: Hoare triple {646#true} call ULTIMATE.init(); {646#true} is VALID [2020-07-08 12:27:29,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {646#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {646#true} is VALID [2020-07-08 12:27:29,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {646#true} assume true; {646#true} is VALID [2020-07-08 12:27:29,566 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {646#true} {646#true} #136#return; {646#true} is VALID [2020-07-08 12:27:29,566 INFO L263 TraceCheckUtils]: 4: Hoare triple {646#true} call #t~ret17 := main(); {646#true} is VALID [2020-07-08 12:27:29,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {646#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {676#(and (<= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 12:27:29,571 INFO L280 TraceCheckUtils]: 6: Hoare triple {676#(and (<= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {676#(and (<= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 12:27:29,574 INFO L280 TraceCheckUtils]: 7: Hoare triple {676#(and (<= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~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, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {683#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:27:29,582 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)))} assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~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, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {687#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 12:27:29,583 INFO L280 TraceCheckUtils]: 9: Hoare triple {687#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {687#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 12:27:29,584 INFO L280 TraceCheckUtils]: 10: Hoare triple {687#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet2);havoc #t~nondet2; {687#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 12:27:29,586 INFO L280 TraceCheckUtils]: 11: Hoare triple {687#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_main_~end~0.base_24 Int) (main_~end~0.offset Int)) (and (not (= v_main_~end~0.base_24 main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {697#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2020-07-08 12:27:29,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {697#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {697#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2020-07-08 12:27:29,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {697#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} goto; {697#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2020-07-08 12:27:29,590 INFO L280 TraceCheckUtils]: 14: Hoare triple {697#(and (exists ((|main_#t~malloc6.base| Int) (v_main_~end~0.offset_24 Int) (v_prenex_1 Int) (v_main_~end~0.base_24 Int)) (and (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc6.base|) (+ v_prenex_1 4))) (not (= v_main_~end~0.base_24 |main_#t~malloc6.base|)) (not (= v_main_~end~0.base_24 main_~end~0.base)) (= (select (select |#memory_int| v_main_~end~0.base_24) (+ v_main_~end~0.offset_24 4)) ~unnamed1~0~RED))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {656#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-08 12:27:29,591 INFO L280 TraceCheckUtils]: 15: Hoare triple {656#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {647#false} is VALID [2020-07-08 12:27:29,591 INFO L280 TraceCheckUtils]: 16: Hoare triple {647#false} assume !false; {647#false} is VALID [2020-07-08 12:27:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:29,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:29,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-07-08 12:27:29,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773677493] [2020-07-08 12:27:29,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-07-08 12:27:29,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:29,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 12:27:29,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:29,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 12:27:29,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:29,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 12:27:29,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:27:29,656 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 13 states. [2020-07-08 12:27:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:49,803 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2020-07-08 12:27:49,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 12:27:49,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-07-08 12:27:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:27:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2020-07-08 12:27:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:27:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2020-07-08 12:27:49,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 67 transitions. [2020-07-08 12:27:49,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:49,956 INFO L225 Difference]: With dead ends: 66 [2020-07-08 12:27:49,957 INFO L226 Difference]: Without dead ends: 64 [2020-07-08 12:27:49,957 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2020-07-08 12:27:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-08 12:27:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 27. [2020-07-08 12:27:49,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:49,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 27 states. [2020-07-08 12:27:49,999 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 27 states. [2020-07-08 12:27:49,999 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 27 states. [2020-07-08 12:27:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:50,002 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2020-07-08 12:27:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2020-07-08 12:27:50,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:50,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:50,006 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 64 states. [2020-07-08 12:27:50,006 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 64 states. [2020-07-08 12:27:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:50,013 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2020-07-08 12:27:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2020-07-08 12:27:50,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:50,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:50,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:50,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:27:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-07-08 12:27:50,019 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2020-07-08 12:27:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:50,020 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-08 12:27:50,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 12:27:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-08 12:27:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 12:27:50,021 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:50,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:50,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:50,235 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:50,236 INFO L82 PathProgramCache]: Analyzing trace with hash 903516662, now seen corresponding path program 1 times [2020-07-08 12:27:50,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:50,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615937144] [2020-07-08 12:27:50,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:50,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {977#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {969#true} is VALID [2020-07-08 12:27:50,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {969#true} assume true; {969#true} is VALID [2020-07-08 12:27:50,380 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {969#true} {969#true} #136#return; {969#true} is VALID [2020-07-08 12:27:50,381 INFO L263 TraceCheckUtils]: 0: Hoare triple {969#true} call ULTIMATE.init(); {977#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:50,381 INFO L280 TraceCheckUtils]: 1: Hoare triple {977#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {969#true} is VALID [2020-07-08 12:27:50,382 INFO L280 TraceCheckUtils]: 2: Hoare triple {969#true} assume true; {969#true} is VALID [2020-07-08 12:27:50,382 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {969#true} {969#true} #136#return; {969#true} is VALID [2020-07-08 12:27:50,382 INFO L263 TraceCheckUtils]: 4: Hoare triple {969#true} call #t~ret17 := main(); {969#true} is VALID [2020-07-08 12:27:50,382 INFO L280 TraceCheckUtils]: 5: Hoare triple {969#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {969#true} is VALID [2020-07-08 12:27:50,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {969#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {969#true} is VALID [2020-07-08 12:27:50,383 INFO L280 TraceCheckUtils]: 7: Hoare triple {969#true} assume !(0 != #t~nondet2);havoc #t~nondet2; {969#true} is VALID [2020-07-08 12:27:50,383 INFO L280 TraceCheckUtils]: 8: Hoare triple {969#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; {969#true} is VALID [2020-07-08 12:27:50,383 INFO L280 TraceCheckUtils]: 9: Hoare triple {969#true} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {969#true} is VALID [2020-07-08 12:27:50,384 INFO L280 TraceCheckUtils]: 10: Hoare triple {969#true} goto; {969#true} is VALID [2020-07-08 12:27:50,384 INFO L280 TraceCheckUtils]: 11: Hoare triple {969#true} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {974#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|)} is VALID [2020-07-08 12:27:50,385 INFO L280 TraceCheckUtils]: 12: Hoare triple {974#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|)} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {975#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-08 12:27:50,386 INFO L280 TraceCheckUtils]: 13: Hoare triple {975#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {975#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-08 12:27:50,387 INFO L280 TraceCheckUtils]: 14: Hoare triple {975#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {976#(= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2020-07-08 12:27:50,388 INFO L280 TraceCheckUtils]: 15: Hoare triple {976#(= ~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, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {970#false} is VALID [2020-07-08 12:27:50,388 INFO L280 TraceCheckUtils]: 16: Hoare triple {970#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {970#false} is VALID [2020-07-08 12:27:50,388 INFO L280 TraceCheckUtils]: 17: Hoare triple {970#false} assume !false; {970#false} is VALID [2020-07-08 12:27:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:50,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615937144] [2020-07-08 12:27:50,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:50,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:27:50,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026002867] [2020-07-08 12:27:50,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 12:27:50,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:50,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:27:50,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:50,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:27:50,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:50,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:27:50,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:27:50,414 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2020-07-08 12:27:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:50,751 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-08 12:27:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:27:50,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 12:27:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-08 12:27:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-08 12:27:50,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2020-07-08 12:27:50,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:50,819 INFO L225 Difference]: With dead ends: 42 [2020-07-08 12:27:50,819 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:27:50,820 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:27:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:27:50,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-08 12:27:50,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:50,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-08 12:27:50,849 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-08 12:27:50,849 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-08 12:27:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:50,851 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:27:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:27:50,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:50,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:50,852 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-08 12:27:50,853 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-08 12:27:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:50,854 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:27:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:27:50,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:50,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:50,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:50,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 12:27:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-08 12:27:50,857 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2020-07-08 12:27:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:50,857 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-08 12:27:50,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:27:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-08 12:27:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:27:50,858 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:50,858 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:50,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:27:50,859 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:50,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1223911862, now seen corresponding path program 1 times [2020-07-08 12:27:50,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:50,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255763998] [2020-07-08 12:27:50,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:51,067 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1128#true} is VALID [2020-07-08 12:27:51,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {1128#true} assume true; {1128#true} is VALID [2020-07-08 12:27:51,067 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1128#true} {1128#true} #136#return; {1128#true} is VALID [2020-07-08 12:27:51,069 INFO L263 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1138#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:51,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {1138#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1128#true} is VALID [2020-07-08 12:27:51,069 INFO L280 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2020-07-08 12:27:51,069 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #136#return; {1128#true} is VALID [2020-07-08 12:27:51,070 INFO L263 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret17 := main(); {1128#true} is VALID [2020-07-08 12:27:51,073 INFO L280 TraceCheckUtils]: 5: Hoare triple {1128#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1133#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base))))} is VALID [2020-07-08 12:27:51,074 INFO L280 TraceCheckUtils]: 6: Hoare triple {1133#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1133#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base))))} is VALID [2020-07-08 12:27:51,075 INFO L280 TraceCheckUtils]: 7: Hoare triple {1133#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base))))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1133#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base))))} is VALID [2020-07-08 12:27:51,076 INFO L280 TraceCheckUtils]: 8: Hoare triple {1133#(and (or (= main_~list~0.base main_~null~0.base) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))) (or (= main_~list~0.offset main_~null~0.offset) (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; {1134#(or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))))} is VALID [2020-07-08 12:27:51,077 INFO L280 TraceCheckUtils]: 9: Hoare triple {1134#(or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:51,078 INFO L280 TraceCheckUtils]: 10: Hoare triple {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} goto; {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:51,079 INFO L280 TraceCheckUtils]: 11: Hoare triple {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:51,080 INFO L280 TraceCheckUtils]: 12: Hoare triple {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:51,080 INFO L280 TraceCheckUtils]: 13: Hoare triple {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} goto; {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:51,081 INFO L280 TraceCheckUtils]: 14: Hoare triple {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:51,082 INFO L280 TraceCheckUtils]: 15: Hoare triple {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:51,083 INFO L280 TraceCheckUtils]: 16: Hoare triple {1135#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1136#(and (= main_~end~0.offset main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:51,084 INFO L280 TraceCheckUtils]: 17: Hoare triple {1136#(and (= main_~end~0.offset main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1136#(and (= main_~end~0.offset main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:51,085 INFO L280 TraceCheckUtils]: 18: Hoare triple {1136#(and (= main_~end~0.offset main_~null~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) 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, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1137#(not (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-08 12:27:51,085 INFO L280 TraceCheckUtils]: 19: Hoare triple {1137#(not (= main_~null~0.base main_~end~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1129#false} is VALID [2020-07-08 12:27:51,086 INFO L280 TraceCheckUtils]: 20: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2020-07-08 12:27:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:51,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255763998] [2020-07-08 12:27:51,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689983402] [2020-07-08 12:27:51,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:51,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-08 12:27:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:51,198 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:51,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:51,279 INFO L350 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2020-07-08 12:27:51,280 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 48 [2020-07-08 12:27:51,281 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:51,343 INFO L624 ElimStorePlain]: treesize reduction 16, result has 81.4 percent of original size [2020-07-08 12:27:51,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:51,408 INFO L350 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2020-07-08 12:27:51,408 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 48 [2020-07-08 12:27:51,409 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:51,468 INFO L624 ElimStorePlain]: treesize reduction 16, result has 79.7 percent of original size [2020-07-08 12:27:51,469 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:51,469 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:63 [2020-07-08 12:27:53,627 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:53,628 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|]. (let ((.cse1 (+ main_~list~0.offset 4))) (and (= (let ((.cse0 (store |v_#memory_$Pointer$.base_24| main_~null~0.base (store (select |v_#memory_$Pointer$.base_24| main_~null~0.base) main_~null~0.offset 0)))) (store .cse0 main_~list~0.base (store (store (select .cse0 main_~list~0.base) main_~list~0.offset main_~null~0.base) .cse1 (select (select |#memory_$Pointer$.base| main_~list~0.base) .cse1)))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (let ((.cse2 (store |v_#memory_$Pointer$.offset_24| main_~null~0.base (store (select |v_#memory_$Pointer$.offset_24| main_~null~0.base) main_~null~0.offset 0)))) (store .cse2 main_~list~0.base (store (store (select .cse2 main_~list~0.base) main_~list~0.offset main_~null~0.offset) .cse1 (select (select |#memory_$Pointer$.offset| main_~list~0.base) .cse1))))))) [2020-07-08 12:27:53,628 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (= main_~list~0.base main_~null~0.base))) (let ((.cse0 (and (= (+ main_~list~0.offset 4) main_~null~0.offset) .cse2)) (.cse1 (and .cse2 (= main_~list~0.offset main_~null~0.offset)))) (and (or .cse0 (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) .cse1) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or .cse0 (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) .cse1)))) [2020-07-08 12:27:53,837 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-08 12:27:53,841 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-08 12:27:53,872 INFO L384 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 7 [2020-07-08 12:27:53,873 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:53,890 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:53,891 INFO L384 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 22 treesize of output 22 [2020-07-08 12:27:53,893 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:53,908 INFO L384 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 7 [2020-07-08 12:27:53,909 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:53,961 INFO L624 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2020-07-08 12:27:53,975 INFO L384 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 7 [2020-07-08 12:27:53,976 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:53,990 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:53,991 INFO L384 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 22 treesize of output 22 [2020-07-08 12:27:53,992 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:54,003 INFO L384 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 7 [2020-07-08 12:27:54,005 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:54,018 INFO L624 ElimStorePlain]: treesize reduction 20, result has 25.9 percent of original size [2020-07-08 12:27:54,018 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:54,018 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:110, output treesize:7 [2020-07-08 12:27:54,024 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:54,025 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_main_~end~0.base_25, v_main_~end~0.offset_25, |#memory_$Pointer$.base|]. (let ((.cse4 (select |#memory_$Pointer$.base| main_~null~0.base)) (.cse2 (select |#memory_$Pointer$.offset| main_~null~0.base))) (let ((.cse7 (select .cse2 main_~null~0.offset)) (.cse8 (select .cse4 main_~null~0.offset))) (or (let ((.cse3 (+ main_~null~0.offset (- 4)))) (let ((.cse0 (select .cse4 .cse3)) (.cse1 (select .cse2 .cse3))) (and (= .cse0 main_~end~0.base) (= .cse0 main_~null~0.base) (= main_~null~0.offset .cse1) (= main_~end~0.offset .cse1)))) (let ((.cse5 (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_25) v_main_~end~0.offset_25)) (.cse6 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_25) v_main_~end~0.offset_25))) (and (= main_~end~0.offset .cse5) (= .cse5 main_~null~0.offset) (= .cse6 main_~end~0.base) (= .cse6 main_~null~0.base) (= 0 .cse7) (= 0 .cse8))) (and (= main_~end~0.offset .cse7) (= .cse8 main_~end~0.base) (= main_~null~0.offset .cse7) (= .cse8 main_~null~0.base))))) [2020-07-08 12:27:54,025 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) [2020-07-08 12:27:54,051 INFO L263 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2020-07-08 12:27:54,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {1128#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1128#true} is VALID [2020-07-08 12:27:54,052 INFO L280 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2020-07-08 12:27:54,052 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #136#return; {1128#true} is VALID [2020-07-08 12:27:54,052 INFO L263 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret17 := main(); {1128#true} is VALID [2020-07-08 12:27:54,057 INFO L280 TraceCheckUtils]: 5: Hoare triple {1128#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1157#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))))} is VALID [2020-07-08 12:27:54,058 INFO L280 TraceCheckUtils]: 6: Hoare triple {1157#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1157#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))))} is VALID [2020-07-08 12:27:54,059 INFO L280 TraceCheckUtils]: 7: Hoare triple {1157#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1157#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))))} is VALID [2020-07-08 12:27:54,060 INFO L280 TraceCheckUtils]: 8: Hoare triple {1157#(and (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (or (and (= (+ main_~list~0.offset 4) main_~null~0.offset) (= main_~list~0.base main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (and (= main_~list~0.base main_~null~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; {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-08 12:27:54,068 INFO L280 TraceCheckUtils]: 9: Hoare triple {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-08 12:27:54,069 INFO L280 TraceCheckUtils]: 10: Hoare triple {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} goto; {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-08 12:27:54,070 INFO L280 TraceCheckUtils]: 11: Hoare triple {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-08 12:27:54,071 INFO L280 TraceCheckUtils]: 12: Hoare triple {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-08 12:27:54,072 INFO L280 TraceCheckUtils]: 13: Hoare triple {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} goto; {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-08 12:27:54,073 INFO L280 TraceCheckUtils]: 14: Hoare triple {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-08 12:27:54,074 INFO L280 TraceCheckUtils]: 15: Hoare triple {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} is VALID [2020-07-08 12:27:54,075 INFO L280 TraceCheckUtils]: 16: Hoare triple {1167#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset))) (or (and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (and (= (+ main_~end~0.offset 4) main_~null~0.offset) (= main_~null~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1192#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-08 12:27:54,076 INFO L280 TraceCheckUtils]: 17: Hoare triple {1192#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1129#false} is VALID [2020-07-08 12:27:54,076 INFO L280 TraceCheckUtils]: 18: Hoare triple {1129#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, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1129#false} is VALID [2020-07-08 12:27:54,076 INFO L280 TraceCheckUtils]: 19: Hoare triple {1129#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1129#false} is VALID [2020-07-08 12:27:54,077 INFO L280 TraceCheckUtils]: 20: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2020-07-08 12:27:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:54,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:54,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2020-07-08 12:27:54,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566430708] [2020-07-08 12:27:54,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-08 12:27:54,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:54,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:27:54,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:54,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:27:54,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:54,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:27:54,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:27:54,139 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 11 states. [2020-07-08 12:27:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:55,277 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-07-08 12:27:55,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:27:55,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-08 12:27:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:27:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2020-07-08 12:27:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:27:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2020-07-08 12:27:55,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2020-07-08 12:27:55,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:55,377 INFO L225 Difference]: With dead ends: 57 [2020-07-08 12:27:55,377 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:27:55,378 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:27:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:27:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-07-08 12:27:55,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:55,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2020-07-08 12:27:55,424 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2020-07-08 12:27:55,424 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2020-07-08 12:27:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:55,426 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-08 12:27:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-08 12:27:55,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:55,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:55,426 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2020-07-08 12:27:55,427 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2020-07-08 12:27:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:55,429 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-08 12:27:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-08 12:27:55,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:55,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:55,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:55,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 12:27:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-08 12:27:55,431 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2020-07-08 12:27:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:55,432 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-08 12:27:55,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:27:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-08 12:27:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:27:55,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:55,432 INFO L422 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] [2020-07-08 12:27:55,644 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:55,645 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1223476830, now seen corresponding path program 1 times [2020-07-08 12:27:55,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:55,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8459733] [2020-07-08 12:27:55,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:56,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {1400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1387#true} is VALID [2020-07-08 12:27:56,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {1387#true} assume true; {1387#true} is VALID [2020-07-08 12:27:56,120 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1387#true} {1387#true} #136#return; {1387#true} is VALID [2020-07-08 12:27:56,121 INFO L263 TraceCheckUtils]: 0: Hoare triple {1387#true} call ULTIMATE.init(); {1400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:56,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {1400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1387#true} is VALID [2020-07-08 12:27:56,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {1387#true} assume true; {1387#true} is VALID [2020-07-08 12:27:56,122 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1387#true} {1387#true} #136#return; {1387#true} is VALID [2020-07-08 12:27:56,122 INFO L263 TraceCheckUtils]: 4: Hoare triple {1387#true} call #t~ret17 := main(); {1387#true} is VALID [2020-07-08 12:27:56,125 INFO L280 TraceCheckUtils]: 5: Hoare triple {1387#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1392#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:27:56,126 INFO L280 TraceCheckUtils]: 6: Hoare triple {1392#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1392#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:27:56,137 INFO L280 TraceCheckUtils]: 7: Hoare triple {1392#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~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, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1393#(and (= 0 main_~null~0.offset) (not (= main_~list~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~list~0.base)) (or (= main_~list~0.base main_~null~0.base) (and (= 1 (select |#valid| main_~null~0.base)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:27:56,140 INFO L280 TraceCheckUtils]: 8: Hoare triple {1393#(and (= 0 main_~null~0.offset) (not (= main_~list~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~list~0.base)) (or (= main_~list~0.base main_~null~0.base) (and (= 1 (select |#valid| main_~null~0.base)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~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, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {1394#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:56,141 INFO L280 TraceCheckUtils]: 9: Hoare triple {1394#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1394#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:56,142 INFO L280 TraceCheckUtils]: 10: Hoare triple {1394#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1394#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:56,143 INFO L280 TraceCheckUtils]: 11: Hoare triple {1394#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~null~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 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; {1395#(and (= 0 main_~null~0.offset) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))) (= main_~end~0.offset main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 12:27:56,150 INFO L280 TraceCheckUtils]: 12: Hoare triple {1395#(and (= 0 main_~null~0.offset) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))) (= main_~end~0.offset main_~null~0.offset) (= 0 (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); {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-08 12:27:56,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} goto; {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-08 12:27:56,153 INFO L280 TraceCheckUtils]: 14: Hoare triple {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-08 12:27:56,154 INFO L280 TraceCheckUtils]: 15: Hoare triple {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-08 12:27:56,154 INFO L280 TraceCheckUtils]: 16: Hoare triple {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} goto; {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-08 12:27:56,168 INFO L280 TraceCheckUtils]: 17: Hoare triple {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-08 12:27:56,170 INFO L280 TraceCheckUtils]: 18: Hoare triple {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} is VALID [2020-07-08 12:27:56,171 INFO L280 TraceCheckUtils]: 19: Hoare triple {1396#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) main_~null~0.base))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1397#(and (= 0 main_~null~0.offset) (or (= main_~null~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))) (= 0 main_~end~0.offset))} is VALID [2020-07-08 12:27:56,172 INFO L280 TraceCheckUtils]: 20: Hoare triple {1397#(and (= 0 main_~null~0.offset) (or (= main_~null~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))) (= 0 main_~end~0.offset))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1398#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))} is VALID [2020-07-08 12:27:56,173 INFO L280 TraceCheckUtils]: 21: Hoare triple {1398#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) 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, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1399#(not (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-08 12:27:56,173 INFO L280 TraceCheckUtils]: 22: Hoare triple {1399#(not (= main_~null~0.base main_~end~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1388#false} is VALID [2020-07-08 12:27:56,173 INFO L280 TraceCheckUtils]: 23: Hoare triple {1388#false} assume !false; {1388#false} is VALID [2020-07-08 12:27:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:56,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8459733] [2020-07-08 12:27:56,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284888571] [2020-07-08 12:27:56,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:56,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 53 conjunts are in the unsatisfiable core [2020-07-08 12:27:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:56,299 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:56,332 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-08 12:27:56,333 INFO L384 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 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-08 12:27:56,334 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,344 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,344 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,345 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:23 [2020-07-08 12:27:56,353 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:56,353 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_24|]. (and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= |#valid| (store (store |v_#valid_24| main_~null~0.base 1) main_~list~0.base 1))) [2020-07-08 12:27:56,353 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base))) [2020-07-08 12:27:56,459 INFO L350 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2020-07-08 12:27:56,459 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2020-07-08 12:27:56,463 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,532 INFO L624 ElimStorePlain]: treesize reduction 28, result has 75.7 percent of original size [2020-07-08 12:27:56,554 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-08 12:27:56,554 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,607 INFO L624 ElimStorePlain]: treesize reduction 4, result has 94.6 percent of original size [2020-07-08 12:27:56,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:56,619 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-08 12:27:56,619 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,642 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,643 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,643 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:85, output treesize:57 [2020-07-08 12:27:56,656 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:56,656 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_26|, |v_#valid_25|, |v_#memory_$Pointer$.base_26|]. (and (= |#memory_$Pointer$.offset| (let ((.cse0 (store |v_#memory_$Pointer$.offset_26| main_~list~0.base (store (select |v_#memory_$Pointer$.offset_26| main_~list~0.base) main_~list~0.offset 0)))) (store .cse0 main_~end~0.base (store (select .cse0 main_~end~0.base) main_~end~0.offset main_~null~0.offset)))) (= 1 (select |v_#valid_25| main_~list~0.base)) (= 1 (select |v_#valid_25| main_~null~0.base)) (= 0 main_~null~0.offset) (= (let ((.cse1 (store |v_#memory_$Pointer$.base_26| main_~list~0.base (store (select |v_#memory_$Pointer$.base_26| main_~list~0.base) main_~list~0.offset main_~end~0.base)))) (store .cse1 main_~end~0.base (store (select .cse1 main_~end~0.base) main_~end~0.offset main_~null~0.base))) |#memory_$Pointer$.base|) (= 0 main_~end~0.offset) (= main_~list~0.offset main_~null~0.offset) (= |#valid| (store |v_#valid_25| main_~end~0.base 1)) (= 0 (select |v_#valid_25| main_~end~0.base))) [2020-07-08 12:27:56,657 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= 0 main_~end~0.offset) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)) (not (= main_~null~0.base main_~end~0.base))) [2020-07-08 12:27:56,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:56,860 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,861 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 49 [2020-07-08 12:27:56,863 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,963 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,966 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_33|, |v_#memory_int_35|], 2=[|v_#memory_int_34|], 4=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.offset_27|]} [2020-07-08 12:27:56,973 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,049 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,064 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2020-07-08 12:27:57,065 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,132 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,147 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2020-07-08 12:27:57,148 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,215 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,225 INFO L544 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:57,278 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,416 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2020-07-08 12:27:57,417 INFO L350 Elim1Store]: treesize reduction 124, result has 41.2 percent of original size [2020-07-08 12:27:57,418 INFO L384 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 161 [2020-07-08 12:27:57,437 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-07-08 12:27:57,437 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:27:57,444 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,544 INFO L624 ElimStorePlain]: treesize reduction 82, result has 65.5 percent of original size [2020-07-08 12:27:57,548 INFO L544 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:57,605 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:57,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:57,634 INFO L384 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2020-07-08 12:27:57,636 INFO L544 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,663 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,668 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:57,668 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:272, output treesize:89 [2020-07-08 12:27:58,183 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:58,183 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_25|, |main_#t~malloc6.offset|, main_~end~0.base, main_~end~0.offset, |v_#memory_$Pointer$.offset_27|, |v_#memory_int_35|, |v_#memory_int_34|, |v_#valid_26|, |v_#memory_$Pointer$.base_25|, |v_#memory_int_33|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_27| main_~list~0.base) main_~list~0.offset))) (let ((.cse2 (select |v_#memory_$Pointer$.offset_25| .cse0)) (.cse1 (select |v_#memory_$Pointer$.offset_27| .cse0)) (.cse4 (+ main_~end~0.offset 4)) (.cse6 (select |v_#memory_$Pointer$.base_25| .cse0)) (.cse7 (select |v_#memory_$Pointer$.base_27| .cse0))) (and (= (store |v_#memory_$Pointer$.offset_27| .cse0 (store .cse1 4 (select .cse2 4))) |v_#memory_$Pointer$.offset_25|) (= 0 main_~list~0.offset) (= (store |v_#memory_int_35| .cse0 (store (store (select |v_#memory_int_35| .cse0) 4 ~unnamed1~0~RED) 0 (select (select |v_#memory_int_34| .cse0) 0))) |v_#memory_int_34|) (= |#memory_$Pointer$.offset| (let ((.cse3 (store |v_#memory_$Pointer$.offset_25| .cse0 (store .cse2 0 |main_#t~malloc6.offset|)))) (store .cse3 main_~end~0.base (store (store (select .cse3 main_~end~0.base) main_~end~0.offset 0) .cse4 (select (select |#memory_$Pointer$.offset| main_~end~0.base) .cse4))))) (= (select (select |v_#memory_$Pointer$.offset_27| main_~list~0.base) main_~list~0.offset) 0) (= 0 (select |v_#valid_26| main_~end~0.base)) (= 1 (select |v_#valid_26| main_~null~0.base)) (= 0 (select .cse1 0)) (= 1 (select |v_#valid_26| main_~list~0.base)) (= |#memory_$Pointer$.base| (let ((.cse5 (store |v_#memory_$Pointer$.base_25| .cse0 (store .cse6 0 main_~end~0.base)))) (store .cse5 main_~end~0.base (store (store (select .cse5 main_~end~0.base) main_~end~0.offset main_~null~0.base) .cse4 (select (select |#memory_$Pointer$.base| main_~end~0.base) .cse4))))) (= (store |v_#memory_int_34| main_~end~0.base (store (select |v_#memory_int_34| main_~end~0.base) main_~end~0.offset (select (select |v_#memory_int_33| main_~end~0.base) main_~end~0.offset))) |v_#memory_int_33|) (= |v_#memory_$Pointer$.base_25| (store |v_#memory_$Pointer$.base_27| .cse0 (store .cse7 4 (select .cse6 4)))) (not (= .cse0 main_~null~0.base)) (= 1 (select |v_#valid_26| .cse0)) (= (select .cse7 0) main_~null~0.base)))) [2020-07-08 12:27:58,183 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~end~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse0) 0))) (and (not (= .cse0 main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= .cse1 main_~null~0.base)) (not (= .cse0 .cse1)) (= (select (select |#memory_$Pointer$.base| .cse1) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| .cse1) main_~end~0.offset)) (not (= main_~list~0.base .cse1))))) [2020-07-08 12:27:58,537 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2020-07-08 12:27:58,539 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:58,553 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:58,555 INFO L544 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. [2020-07-08 12:27:58,555 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:100, output treesize:74 [2020-07-08 12:27:58,560 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:58,560 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_main_~end~0.base_28, v_subst_3, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_28) 0)) (.cse1 (select (select |#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 main_~end~0.base) (not (= .cse1 main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| .cse1) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 .cse1)) (not (= .cse1 .cse0)) (= .cse2 main_~end~0.offset) (= 0 .cse2) (not (= .cse0 main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| .cse1) v_subst_3))))) [2020-07-08 12:27:58,561 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~end~0.base_28, v_subst_3]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 main_~end~0.base) (not (= .cse1 main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| .cse1) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 .cse1)) (= 0 main_~end~0.offset) (not (= .cse1 .cse0)) (not (= .cse0 main_~null~0.base))))) [2020-07-08 12:27:59,375 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:59,376 INFO L384 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 61 [2020-07-08 12:27:59,385 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:27:59,394 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-08 12:27:59,406 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-08 12:27:59,410 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:59,426 INFO L624 ElimStorePlain]: treesize reduction 36, result has 20.0 percent of original size [2020-07-08 12:27:59,428 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:59,428 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:4 [2020-07-08 12:27:59,431 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:59,431 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~end~0.base_28, v_subst_3]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse1) 0))) (and (not (= .cse0 main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| .cse0) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 .cse0)) (= .cse0 main_~end~0.base) (not (= .cse0 .cse1)) (not (= .cse1 main_~null~0.base))))) [2020-07-08 12:27:59,431 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= main_~null~0.base main_~end~0.base)) [2020-07-08 12:27:59,433 INFO L263 TraceCheckUtils]: 0: Hoare triple {1387#true} call ULTIMATE.init(); {1387#true} is VALID [2020-07-08 12:27:59,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {1387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1387#true} is VALID [2020-07-08 12:27:59,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {1387#true} assume true; {1387#true} is VALID [2020-07-08 12:27:59,433 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1387#true} {1387#true} #136#return; {1387#true} is VALID [2020-07-08 12:27:59,433 INFO L263 TraceCheckUtils]: 4: Hoare triple {1387#true} call #t~ret17 := main(); {1387#true} is VALID [2020-07-08 12:27:59,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {1387#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1392#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:27:59,438 INFO L280 TraceCheckUtils]: 6: Hoare triple {1392#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1392#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:27:59,442 INFO L280 TraceCheckUtils]: 7: Hoare triple {1392#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= 1 (select |#valid| main_~end~0.base)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~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, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1425#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= 0 main_~end~0.offset) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)) (not (= main_~null~0.base main_~end~0.base)))} is VALID [2020-07-08 12:27:59,446 INFO L280 TraceCheckUtils]: 8: Hoare triple {1425#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= 0 main_~end~0.offset) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)) (not (= main_~null~0.base main_~end~0.base)))} assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~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, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {1429#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} is VALID [2020-07-08 12:27:59,447 INFO L280 TraceCheckUtils]: 9: Hoare triple {1429#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1429#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} is VALID [2020-07-08 12:27:59,448 INFO L280 TraceCheckUtils]: 10: Hoare triple {1429#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1429#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} is VALID [2020-07-08 12:27:59,450 INFO L280 TraceCheckUtils]: 11: Hoare triple {1429#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))) (exists ((main_~end~0.offset Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset) main_~null~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) main_~end~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:59,451 INFO L280 TraceCheckUtils]: 12: Hoare triple {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:59,452 INFO L280 TraceCheckUtils]: 13: Hoare triple {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} goto; {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:59,454 INFO L280 TraceCheckUtils]: 14: Hoare triple {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:59,455 INFO L280 TraceCheckUtils]: 15: Hoare triple {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:59,456 INFO L280 TraceCheckUtils]: 16: Hoare triple {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} goto; {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:59,457 INFO L280 TraceCheckUtils]: 17: Hoare triple {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:59,458 INFO L280 TraceCheckUtils]: 18: Hoare triple {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} is VALID [2020-07-08 12:27:59,459 INFO L280 TraceCheckUtils]: 19: Hoare triple {1439#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (exists ((v_subst_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0)) v_subst_3) main_~null~0.base))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0) main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1464#(and (= 0 main_~end~0.offset) (exists ((v_main_~end~0.base_28 Int) (v_subst_3 Int)) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0)) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~null~0.base)))))} is VALID [2020-07-08 12:27:59,460 INFO L280 TraceCheckUtils]: 20: Hoare triple {1464#(and (= 0 main_~end~0.offset) (exists ((v_main_~end~0.base_28 Int) (v_subst_3 Int)) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0)) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~null~0.base)))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1464#(and (= 0 main_~end~0.offset) (exists ((v_main_~end~0.base_28 Int) (v_subst_3 Int)) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0)) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~null~0.base)))))} is VALID [2020-07-08 12:27:59,461 INFO L280 TraceCheckUtils]: 21: Hoare triple {1464#(and (= 0 main_~end~0.offset) (exists ((v_main_~end~0.base_28 Int) (v_subst_3 Int)) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0)) v_subst_3) main_~null~0.base) (not (= v_main_~end~0.base_28 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0)) 0) (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0))) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_28) 0) 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, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1399#(not (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-08 12:27:59,462 INFO L280 TraceCheckUtils]: 22: Hoare triple {1399#(not (= main_~null~0.base main_~end~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1388#false} is VALID [2020-07-08 12:27:59,462 INFO L280 TraceCheckUtils]: 23: Hoare triple {1388#false} assume !false; {1388#false} is VALID [2020-07-08 12:27:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:59,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:59,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2020-07-08 12:27:59,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971178466] [2020-07-08 12:27:59,469 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2020-07-08 12:27:59,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:59,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 12:27:59,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:59,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 12:27:59,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:59,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 12:27:59,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=175, Unknown=1, NotChecked=0, Total=210 [2020-07-08 12:27:59,563 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 15 states. [2020-07-08 12:28:00,673 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2020-07-08 12:28:01,372 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2020-07-08 12:28:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:03,194 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2020-07-08 12:28:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-08 12:28:03,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2020-07-08 12:28:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:28:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 135 transitions. [2020-07-08 12:28:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:28:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 135 transitions. [2020-07-08 12:28:03,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 135 transitions. [2020-07-08 12:28:03,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:03,503 INFO L225 Difference]: With dead ends: 121 [2020-07-08 12:28:03,504 INFO L226 Difference]: Without dead ends: 119 [2020-07-08 12:28:03,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=171, Invalid=758, Unknown=1, NotChecked=0, Total=930 [2020-07-08 12:28:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-07-08 12:28:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 49. [2020-07-08 12:28:03,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:03,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 49 states. [2020-07-08 12:28:03,613 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 49 states. [2020-07-08 12:28:03,613 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 49 states. [2020-07-08 12:28:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:03,618 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-07-08 12:28:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2020-07-08 12:28:03,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:03,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:03,619 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 119 states. [2020-07-08 12:28:03,619 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 119 states. [2020-07-08 12:28:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:03,624 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-07-08 12:28:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2020-07-08 12:28:03,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:03,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:03,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:03,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-08 12:28:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2020-07-08 12:28:03,627 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 24 [2020-07-08 12:28:03,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:03,627 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2020-07-08 12:28:03,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 12:28:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2020-07-08 12:28:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:28:03,628 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:28:03,628 INFO L422 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] [2020-07-08 12:28:03,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:28:03,843 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:28:03,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:28:03,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2050422112, now seen corresponding path program 1 times [2020-07-08 12:28:03,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:28:03,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872481223] [2020-07-08 12:28:03,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:28:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:04,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {1961#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1946#true} is VALID [2020-07-08 12:28:04,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {1946#true} assume true; {1946#true} is VALID [2020-07-08 12:28:04,353 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1946#true} {1946#true} #136#return; {1946#true} is VALID [2020-07-08 12:28:04,353 INFO L263 TraceCheckUtils]: 0: Hoare triple {1946#true} call ULTIMATE.init(); {1961#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:28:04,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {1961#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1946#true} is VALID [2020-07-08 12:28:04,354 INFO L280 TraceCheckUtils]: 2: Hoare triple {1946#true} assume true; {1946#true} is VALID [2020-07-08 12:28:04,354 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1946#true} {1946#true} #136#return; {1946#true} is VALID [2020-07-08 12:28:04,354 INFO L263 TraceCheckUtils]: 4: Hoare triple {1946#true} call #t~ret17 := main(); {1946#true} is VALID [2020-07-08 12:28:04,360 INFO L280 TraceCheckUtils]: 5: Hoare triple {1946#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1951#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:28:04,361 INFO L280 TraceCheckUtils]: 6: Hoare triple {1951#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1951#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-08 12:28:04,364 INFO L280 TraceCheckUtils]: 7: Hoare triple {1951#(and (= main_~list~0.offset main_~end~0.offset) (= 0 main_~null~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~end~0.base)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~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, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1952#(and (= 0 main_~null~0.offset) (not (= main_~list~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base))} is VALID [2020-07-08 12:28:04,367 INFO L280 TraceCheckUtils]: 8: Hoare triple {1952#(and (= 0 main_~null~0.offset) (not (= main_~list~0.base main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base))} assume 0 != #t~nondet5;havoc #t~nondet5;call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {1953#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 4))) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-08 12:28:04,367 INFO L280 TraceCheckUtils]: 9: Hoare triple {1953#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 4))) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1953#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 4))) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-08 12:28:04,368 INFO L280 TraceCheckUtils]: 10: Hoare triple {1953#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 4))) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1953#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 4))) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-08 12:28:04,369 INFO L280 TraceCheckUtils]: 11: Hoare triple {1953#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 4))) (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~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; {1954#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))))} is VALID [2020-07-08 12:28:04,369 INFO L280 TraceCheckUtils]: 12: Hoare triple {1954#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1954#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))))} is VALID [2020-07-08 12:28:04,370 INFO L280 TraceCheckUtils]: 13: Hoare triple {1954#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))))} goto; {1954#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))))} is VALID [2020-07-08 12:28:04,371 INFO L280 TraceCheckUtils]: 14: Hoare triple {1954#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1955#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|))} is VALID [2020-07-08 12:28:04,372 INFO L280 TraceCheckUtils]: 15: Hoare triple {1955#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1956#(and (= 0 main_~null~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 12:28:04,373 INFO L280 TraceCheckUtils]: 16: Hoare triple {1956#(and (= 0 main_~null~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} goto; {1956#(and (= 0 main_~null~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 12:28:04,373 INFO L280 TraceCheckUtils]: 17: Hoare triple {1956#(and (= 0 main_~null~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))) (= 0 (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~int(~end~0.base, 4 + ~end~0.offset, 4); {1957#(and (= 0 main_~null~0.offset) (= |main_#t~mem9| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 12:28:04,374 INFO L280 TraceCheckUtils]: 18: Hoare triple {1957#(and (= 0 main_~null~0.offset) (= |main_#t~mem9| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1958#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= ~unnamed1~0~RED (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4)))))} is VALID [2020-07-08 12:28:04,375 INFO L280 TraceCheckUtils]: 19: Hoare triple {1958#(and (= 0 main_~null~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= ~unnamed1~0~RED (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ main_~null~0.offset 4)))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1959#(and (= 0 main_~null~0.offset) (= main_~end~0.offset main_~null~0.offset) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~RED)))} is VALID [2020-07-08 12:28:04,375 INFO L280 TraceCheckUtils]: 20: Hoare triple {1959#(and (= 0 main_~null~0.offset) (= main_~end~0.offset main_~null~0.offset) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~RED)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {1960#(and (not (= ~unnamed1~0~RED |main_#t~mem9|)) (= 0 main_~null~0.offset) (= main_~end~0.offset main_~null~0.offset))} is VALID [2020-07-08 12:28:04,376 INFO L280 TraceCheckUtils]: 21: Hoare triple {1960#(and (not (= ~unnamed1~0~RED |main_#t~mem9|)) (= 0 main_~null~0.offset) (= main_~end~0.offset main_~null~0.offset))} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1947#false} is VALID [2020-07-08 12:28:04,376 INFO L280 TraceCheckUtils]: 22: Hoare triple {1947#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1947#false} is VALID [2020-07-08 12:28:04,376 INFO L280 TraceCheckUtils]: 23: Hoare triple {1947#false} assume !false; {1947#false} is VALID [2020-07-08 12:28:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:28:04,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872481223] [2020-07-08 12:28:04,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003898605] [2020-07-08 12:28:04,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:28:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:04,479 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-08 12:28:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:04,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:28:04,541 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-08 12:28:04,541 INFO L384 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 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-08 12:28:04,541 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,550 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,551 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:28:04,551 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2020-07-08 12:28:04,556 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:04,557 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_27|, |main_#t~malloc0.base|]. (and (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |v_#valid_27| |main_#t~malloc0.base| 1) main_~list~0.base 1)) (= main_~list~0.base main_~end~0.base)) [2020-07-08 12:28:04,557 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc0.base|]. (and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| |main_#t~malloc0.base|))) [2020-07-08 12:28:04,626 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,626 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-08 12:28:04,630 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:28:04,632 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,642 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,651 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-08 12:28:04,651 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,662 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,668 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-08 12:28:04,668 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,679 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,680 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,680 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:19 [2020-07-08 12:28:04,693 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:04,693 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_28|, main_~null~0.offset, |v_#valid_28|, |v_#memory_$Pointer$.base_28|, main_~null~0.base]. (and (<= (select |v_#valid_28| main_~end~0.base) 0) (= (let ((.cse0 (store |v_#memory_$Pointer$.offset_28| main_~list~0.base (store (select |v_#memory_$Pointer$.offset_28| main_~list~0.base) main_~list~0.offset main_~end~0.offset)))) (store .cse0 main_~end~0.base (store (select .cse0 main_~end~0.base) main_~end~0.offset main_~null~0.offset))) |#memory_$Pointer$.offset|) (= 1 (select |v_#valid_28| main_~list~0.base)) (= |#memory_$Pointer$.base| (let ((.cse1 (store |v_#memory_$Pointer$.base_28| main_~list~0.base (store (select |v_#memory_$Pointer$.base_28| main_~list~0.base) main_~list~0.offset main_~end~0.base)))) (store .cse1 main_~end~0.base (store (select .cse1 main_~end~0.base) main_~end~0.offset main_~null~0.base))))) [2020-07-08 12:28:04,693 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~list~0.base main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) [2020-07-08 12:28:04,750 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_29|]} [2020-07-08 12:28:04,755 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2020-07-08 12:28:04,755 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,770 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,776 INFO L384 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 96 treesize of output 78 [2020-07-08 12:28:04,783 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,794 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,821 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,821 INFO L384 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 1 case distinctions, treesize of input 65 treesize of output 97 [2020-07-08 12:28:04,828 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-07-08 12:28:04,829 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-08 12:28:04,831 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,844 INFO L624 ElimStorePlain]: treesize reduction 40, result has 39.4 percent of original size [2020-07-08 12:28:04,844 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,844 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:26 [2020-07-08 12:28:07,399 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:07,400 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_29|, |v_#memory_int_36|, |v_#memory_$Pointer$.offset_29|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_29| main_~list~0.base) main_~list~0.offset)) (.cse1 (+ (select (select |v_#memory_$Pointer$.offset_29| main_~list~0.base) main_~list~0.offset) 4))) (and (= (store |v_#memory_$Pointer$.offset_29| .cse0 (store (select |v_#memory_$Pointer$.offset_29| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_29| .cse0 (store (select |v_#memory_$Pointer$.base_29| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (not (= main_~list~0.base .cse0)) (= (store |v_#memory_int_36| .cse0 (store (select |v_#memory_int_36| .cse0) .cse1 ~unnamed1~0~BLACK)) |#memory_int|))) [2020-07-08 12:28:07,400 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (not (= main_~list~0.base .cse0)) (= ~unnamed1~0~BLACK (select (select |#memory_int| .cse0) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))) [2020-07-08 12:28:07,517 INFO L384 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 33 treesize of output 21 [2020-07-08 12:28:07,519 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:07,527 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:07,533 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2020-07-08 12:28:07,534 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:07,539 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:07,542 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:07,542 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:9 [2020-07-08 12:28:07,545 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:07,545 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~end~0.base_31, v_main_~end~0.offset_31, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_31) v_main_~end~0.offset_31)) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_31) v_main_~end~0.offset_31))) (and (= main_~end~0.offset .cse0) (not (= v_main_~end~0.base_31 .cse1)) (= .cse1 main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| .cse1) (+ .cse0 4))))) [2020-07-08 12:28:07,545 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK) [2020-07-08 12:28:07,582 INFO L384 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 7 [2020-07-08 12:28:07,587 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:07,588 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:07,589 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:07,589 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-07-08 12:28:07,591 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:07,592 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~end~0.base, main_~end~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))) (and (<= .cse0 |main_#t~mem9|) (= .cse0 ~unnamed1~0~BLACK))) [2020-07-08 12:28:07,592 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= ~unnamed1~0~BLACK |main_#t~mem9|) [2020-07-08 12:28:07,630 INFO L263 TraceCheckUtils]: 0: Hoare triple {1946#true} call ULTIMATE.init(); {1946#true} is VALID [2020-07-08 12:28:07,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {1946#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1946#true} is VALID [2020-07-08 12:28:07,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {1946#true} assume true; {1946#true} is VALID [2020-07-08 12:28:07,631 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1946#true} {1946#true} #136#return; {1946#true} is VALID [2020-07-08 12:28:07,631 INFO L263 TraceCheckUtils]: 4: Hoare triple {1946#true} call #t~ret17 := main(); {1946#true} is VALID [2020-07-08 12:28:07,636 INFO L280 TraceCheckUtils]: 5: Hoare triple {1946#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8);~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, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1980#(and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-08 12:28:07,637 INFO L280 TraceCheckUtils]: 6: Hoare triple {1980#(and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1980#(and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-08 12:28:07,638 INFO L280 TraceCheckUtils]: 7: Hoare triple {1980#(and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base))} assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~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, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1987#(and (not (= main_~list~0.base main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-08 12:28:07,640 INFO L280 TraceCheckUtils]: 8: Hoare triple {1987#(and (not (= main_~list~0.base main_~end~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume 0 != #t~nondet5;havoc #t~nondet5;call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {1991#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} is VALID [2020-07-08 12:28:07,641 INFO L280 TraceCheckUtils]: 9: Hoare triple {1991#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1991#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} is VALID [2020-07-08 12:28:07,642 INFO L280 TraceCheckUtils]: 10: Hoare triple {1991#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1991#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} is VALID [2020-07-08 12:28:07,642 INFO L280 TraceCheckUtils]: 11: Hoare triple {1991#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 4))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-08 12:28:07,643 INFO L280 TraceCheckUtils]: 12: Hoare triple {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-08 12:28:07,644 INFO L280 TraceCheckUtils]: 13: Hoare triple {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} goto; {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-08 12:28:07,645 INFO L280 TraceCheckUtils]: 14: Hoare triple {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-08 12:28:07,645 INFO L280 TraceCheckUtils]: 15: Hoare triple {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-08 12:28:07,646 INFO L280 TraceCheckUtils]: 16: Hoare triple {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} goto; {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-08 12:28:07,647 INFO L280 TraceCheckUtils]: 17: Hoare triple {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-08 12:28:07,647 INFO L280 TraceCheckUtils]: 18: Hoare triple {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} is VALID [2020-07-08 12:28:07,648 INFO L280 TraceCheckUtils]: 19: Hoare triple {2001#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 4))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {2026#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-08 12:28:07,649 INFO L280 TraceCheckUtils]: 20: Hoare triple {2026#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {2030#(<= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2020-07-08 12:28:07,650 INFO L280 TraceCheckUtils]: 21: Hoare triple {2030#(<= ~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, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1947#false} is VALID [2020-07-08 12:28:07,650 INFO L280 TraceCheckUtils]: 22: Hoare triple {1947#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1947#false} is VALID [2020-07-08 12:28:07,650 INFO L280 TraceCheckUtils]: 23: Hoare triple {1947#false} assume !false; {1947#false} is VALID [2020-07-08 12:28:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:28:07,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:28:07,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2020-07-08 12:28:07,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445812616] [2020-07-08 12:28:07,653 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2020-07-08 12:28:07,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:28:07,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-08 12:28:07,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:07,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-08 12:28:07,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:28:07,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-08 12:28:07,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2020-07-08 12:28:07,719 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 19 states. [2020-07-08 12:28:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:10,434 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2020-07-08 12:28:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 12:28:10,434 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2020-07-08 12:28:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:28:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2020-07-08 12:28:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:28:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2020-07-08 12:28:10,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 80 transitions. [2020-07-08 12:28:10,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:10,563 INFO L225 Difference]: With dead ends: 88 [2020-07-08 12:28:10,563 INFO L226 Difference]: Without dead ends: 76 [2020-07-08 12:28:10,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2020-07-08 12:28:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-08 12:28:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2020-07-08 12:28:10,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:10,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 58 states. [2020-07-08 12:28:10,682 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 58 states. [2020-07-08 12:28:10,682 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 58 states. [2020-07-08 12:28:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:10,685 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-08 12:28:10,685 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-08 12:28:10,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:10,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:10,686 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 76 states. [2020-07-08 12:28:10,686 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 76 states. [2020-07-08 12:28:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:10,689 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-08 12:28:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-08 12:28:10,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:10,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:10,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:10,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-08 12:28:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2020-07-08 12:28:10,692 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 24 [2020-07-08 12:28:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:10,692 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2020-07-08 12:28:10,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-08 12:28:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2020-07-08 12:28:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:28:10,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:28:10,693 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:28:10,907 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:28:10,908 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:28:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:28:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1509760762, now seen corresponding path program 1 times [2020-07-08 12:28:10,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:28:10,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874987169] [2020-07-08 12:28:10,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:28:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:28:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:28:11,014 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:28:11,014 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:28:11,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 12:28:11,098 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:28:11,098 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:28:11,098 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:28:11,098 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:28:11,098 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:28:11,099 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:28:11,099 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:28:11,099 WARN L170 areAnnotationChecker]: L1012-2 has no Hoare annotation [2020-07-08 12:28:11,099 WARN L170 areAnnotationChecker]: L1012-2 has no Hoare annotation [2020-07-08 12:28:11,099 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:28:11,099 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:28:11,099 WARN L170 areAnnotationChecker]: L1005-3 has no Hoare annotation [2020-07-08 12:28:11,099 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2020-07-08 12:28:11,100 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2020-07-08 12:28:11,100 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2020-07-08 12:28:11,100 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2020-07-08 12:28:11,100 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2020-07-08 12:28:11,100 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-08 12:28:11,100 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-08 12:28:11,100 WARN L170 areAnnotationChecker]: L1031-4 has no Hoare annotation [2020-07-08 12:28:11,101 WARN L170 areAnnotationChecker]: L1031-4 has no Hoare annotation [2020-07-08 12:28:11,101 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-08 12:28:11,101 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-08 12:28:11,101 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-08 12:28:11,101 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-08 12:28:11,101 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2020-07-08 12:28:11,101 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2020-07-08 12:28:11,101 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-08 12:28:11,102 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-08 12:28:11,102 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-08 12:28:11,102 WARN L170 areAnnotationChecker]: L1031-1 has no Hoare annotation [2020-07-08 12:28:11,102 WARN L170 areAnnotationChecker]: L1031-1 has no Hoare annotation [2020-07-08 12:28:11,102 WARN L170 areAnnotationChecker]: L1031-3 has no Hoare annotation [2020-07-08 12:28:11,102 WARN L170 areAnnotationChecker]: L1031-3 has no Hoare annotation [2020-07-08 12:28:11,102 WARN L170 areAnnotationChecker]: L1048-2 has no Hoare annotation [2020-07-08 12:28:11,102 WARN L170 areAnnotationChecker]: L1048-2 has no Hoare annotation [2020-07-08 12:28:11,103 WARN L170 areAnnotationChecker]: L1048-2 has no Hoare annotation [2020-07-08 12:28:11,103 WARN L170 areAnnotationChecker]: L1035 has no Hoare annotation [2020-07-08 12:28:11,103 WARN L170 areAnnotationChecker]: L1035 has no Hoare annotation [2020-07-08 12:28:11,103 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2020-07-08 12:28:11,103 WARN L170 areAnnotationChecker]: L1048 has no Hoare annotation [2020-07-08 12:28:11,103 WARN L170 areAnnotationChecker]: L1048 has no Hoare annotation [2020-07-08 12:28:11,103 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2020-07-08 12:28:11,103 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2020-07-08 12:28:11,104 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2020-07-08 12:28:11,104 WARN L170 areAnnotationChecker]: L1035-1 has no Hoare annotation [2020-07-08 12:28:11,104 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:28:11,104 WARN L170 areAnnotationChecker]: L1039-4 has no Hoare annotation [2020-07-08 12:28:11,104 WARN L170 areAnnotationChecker]: L1039-4 has no Hoare annotation [2020-07-08 12:28:11,104 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-08 12:28:11,104 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-08 12:28:11,105 WARN L170 areAnnotationChecker]: L1038-3 has no Hoare annotation [2020-07-08 12:28:11,105 WARN L170 areAnnotationChecker]: L1038-3 has no Hoare annotation [2020-07-08 12:28:11,105 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:28:11,105 WARN L170 areAnnotationChecker]: L1039 has no Hoare annotation [2020-07-08 12:28:11,105 WARN L170 areAnnotationChecker]: L1039 has no Hoare annotation [2020-07-08 12:28:11,105 WARN L170 areAnnotationChecker]: L1039-1 has no Hoare annotation [2020-07-08 12:28:11,105 WARN L170 areAnnotationChecker]: L1039-1 has no Hoare annotation [2020-07-08 12:28:11,105 WARN L170 areAnnotationChecker]: L1039-3 has no Hoare annotation [2020-07-08 12:28:11,106 WARN L170 areAnnotationChecker]: L1039-3 has no Hoare annotation [2020-07-08 12:28:11,106 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:28:11,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:28:11 BoogieIcfgContainer [2020-07-08 12:28:11,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:28:11,111 INFO L168 Benchmark]: Toolchain (without parser) took 49707.65 ms. Allocated memory was 144.7 MB in the beginning and 388.5 MB in the end (delta: 243.8 MB). Free memory was 100.9 MB in the beginning and 243.4 MB in the end (delta: -142.6 MB). Peak memory consumption was 101.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:11,111 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 144.7 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:28:11,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.12 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 167.7 MB in the end (delta: -66.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:11,112 INFO L168 Benchmark]: Boogie Preprocessor took 76.66 ms. Allocated memory is still 201.9 MB. Free memory was 167.7 MB in the beginning and 163.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:11,113 INFO L168 Benchmark]: RCFGBuilder took 846.30 ms. Allocated memory is still 201.9 MB. Free memory was 163.7 MB in the beginning and 104.0 MB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:11,113 INFO L168 Benchmark]: TraceAbstraction took 48090.05 ms. Allocated memory was 201.9 MB in the beginning and 388.5 MB in the end (delta: 186.6 MB). Free memory was 104.0 MB in the beginning and 243.4 MB in the end (delta: -139.4 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:11,115 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 144.7 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 689.12 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 167.7 MB in the end (delta: -66.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.66 ms. Allocated memory is still 201.9 MB. Free memory was 167.7 MB in the beginning and 163.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 846.30 ms. Allocated memory is still 201.9 MB. Free memory was 163.7 MB in the beginning and 104.0 MB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48090.05 ms. Allocated memory was 201.9 MB in the beginning and 388.5 MB in the end (delta: 186.6 MB). Free memory was 104.0 MB in the beginning and 243.4 MB in the end (delta: -139.4 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1039]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] SLL* null = malloc(sizeof(SLL)); [L995] null->colour = BLACK [L996] null->next = ((void*)0) [L998] SLL* list = malloc(sizeof(SLL)); [L999] list->next = null [L1000] list->colour = BLACK [L1002] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, null={-2:0}] [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] end->next = malloc(sizeof(SLL)) [L1009] EXPR end->next [L1009] end = end->next [L1010] end->next = null [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] end->colour = RED [L1019] end->next = malloc(sizeof(SLL)) [L1020] EXPR end->next [L1020] end = end->next [L1021] end->next = null [L1022] end->colour = BLACK VAL [end={-4:0}, list={-1:0}, malloc(sizeof(SLL))={-4:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-1:0}, null={-2:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-4:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-1:0}, null={-2:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-4:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-1:0}, null={-2:0}] [L1031] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-4:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-1:0}, null={-2:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1033] COND TRUE null != end [L1035] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-4:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-1:0}, null={-2:0}] [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR end->next [L1042] end = end->next [L1033] COND TRUE null != end [L1035] EXPR end->colour VAL [end={-3:0}, end->colour=0, list={-1:0}, malloc(sizeof(SLL))={-4:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-1:0}, null={-2:0}] [L1035] COND TRUE RED == end->colour [L1037] EXPR end->next [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) VAL [end={-4:0}, list={-1:0}, malloc(sizeof(SLL))={-4:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-1:0}, null={-2:0}] [L1039] EXPR end->colour VAL [end={-4:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-4:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-1:0}, null={-2:0}] [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() VAL [end={-4:0}, list={-1:0}, malloc(sizeof(SLL))={-4:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-1:0}, null={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 47.9s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 208 SDtfs, 447 SDslu, 1019 SDs, 0 SdLazy, 1307 SolverSat, 176 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 156 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 213 ConstructedInterpolants, 19 QuantifiedInterpolants, 90645 SizeOfPredicates, 54 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 1/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...